/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/parallel-sum-2.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:22:11,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:22:11,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:22:11,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:22:11,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:22:11,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:22:11,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:22:11,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:22:11,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:22:11,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:22:11,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:22:11,184 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:22:11,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:22:11,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:22:11,185 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:22:11,186 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:22:11,186 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:22:11,187 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:22:11,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:22:11,189 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:22:11,190 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:22:11,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:22:11,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:22:11,205 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:22:11,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:22:11,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:22:11,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:22:11,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:22:11,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:22:11,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:22:11,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:22:11,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:22:11,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:22:11,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:22:11,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:22:11,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:22:11,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:22:11,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:22:11,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:22:11,211 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:22:11,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:22:11,213 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 21:22:11,235 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:22:11,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:22:11,236 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:22:11,237 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:22:11,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:22:11,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:22:11,237 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:22:11,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:22:11,237 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:22:11,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:22:11,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:22:11,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:22:11,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:22:11,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:22:11,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:22:11,238 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:22:11,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:22:11,238 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:22:11,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:22:11,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:22:11,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:22:11,239 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:22:11,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:22:11,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:22:11,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:22:11,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:22:11,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:22:11,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:22:11,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:22:11,240 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:22:11,240 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:22:11,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:22:11,241 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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 [2022-03-15 21:22:11,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:22:11,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:22:11,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:22:11,464 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:22:11,464 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:22:11,465 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/parallel-sum-2.wvr.bpl [2022-03-15 21:22:11,465 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/parallel-sum-2.wvr.bpl' [2022-03-15 21:22:11,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:22:11,493 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:22:11,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:22:11,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:22:11,494 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:22:11,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:22:11" (1/1) ... [2022-03-15 21:22:11,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:22:11" (1/1) ... [2022-03-15 21:22:11,511 INFO L137 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:22:11,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:22:11,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:22:11,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:22:11,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:22:11,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:22:11" (1/1) ... [2022-03-15 21:22:11,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:22:11" (1/1) ... [2022-03-15 21:22:11,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:22:11" (1/1) ... [2022-03-15 21:22:11,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:22:11" (1/1) ... [2022-03-15 21:22:11,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:22:11" (1/1) ... [2022-03-15 21:22:11,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:22:11" (1/1) ... [2022-03-15 21:22:11,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:22:11" (1/1) ... [2022-03-15 21:22:11,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:22:11,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:22:11,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:22:11,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:22:11,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:22:11" (1/1) ... [2022-03-15 21:22:11,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:22:11,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:22:11,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 21:22:11,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 21:22:11,582 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:22:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:22:11,583 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:22:11,583 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:22:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:22:11,583 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:22:11,583 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:22:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:22:11,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:22:11,583 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 21:22:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 21:22:11,584 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 21:22:11,584 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2022-03-15 21:22:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 21:22:11,584 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 21:22:11,584 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2022-03-15 21:22:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-03-15 21:22:11,584 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-03-15 21:22:11,584 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2022-03-15 21:22:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-03-15 21:22:11,584 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-03-15 21:22:11,585 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 21:22:11,619 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:22:11,621 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:22:11,719 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:22:11,741 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:22:11,741 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-15 21:22:11,743 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread2EXIT is neither atomic block end nor error location. [2022-03-15 21:22:11,744 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread3EXIT is neither atomic block end nor error location. [2022-03-15 21:22:11,744 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread5EXIT is neither atomic block end nor error location. [2022-03-15 21:22:11,744 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread6EXIT is neither atomic block end nor error location. [2022-03-15 21:22:11,745 INFO L202 PluginConnector]: Adding new model parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:22:11 BoogieIcfgContainer [2022-03-15 21:22:11,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:22:11,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:22:11,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:22:11,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:22:11,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:22:11" (1/2) ... [2022-03-15 21:22:11,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1318cfee and model type parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:22:11, skipping insertion in model container [2022-03-15 21:22:11,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:22:11" (2/2) ... [2022-03-15 21:22:11,754 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-sum-2.wvr.bpl [2022-03-15 21:22:11,757 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:22:11,757 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:22:11,757 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:22:11,757 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:22:11,797 INFO L148 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2022-03-15 21:22:11,866 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:22:11,871 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 21:22:11,871 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-03-15 21:22:11,879 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:22:11,898 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 55 transitions, 182 flow [2022-03-15 21:22:11,899 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 55 transitions, 182 flow [2022-03-15 21:22:11,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 182 flow [2022-03-15 21:22:11,948 INFO L129 PetriNetUnfolder]: 8/39 cut-off events. [2022-03-15 21:22:11,948 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-03-15 21:22:11,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 39 events. 8/39 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 66 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 49. Up to 3 conditions per place. [2022-03-15 21:22:11,961 INFO L116 LiptonReduction]: Number of co-enabled transitions 582 [2022-03-15 21:22:12,176 INFO L131 LiptonReduction]: Checked pairs total: 1080 [2022-03-15 21:22:12,176 INFO L133 LiptonReduction]: Total number of compositions: 11 [2022-03-15 21:22:12,198 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 45 transitions, 162 flow [2022-03-15 21:22:12,231 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 172 states, 171 states have (on average 3.6608187134502925) internal successors, (626), 171 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:12,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 172 states, 171 states have (on average 3.6608187134502925) internal successors, (626), 171 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:12,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:22:12,245 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:22:12,245 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:22:12,246 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:22:12,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:22:12,249 INFO L85 PathProgramCache]: Analyzing trace with hash 972814747, now seen corresponding path program 1 times [2022-03-15 21:22:12,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:22:12,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840092613] [2022-03-15 21:22:12,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:22:12,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:22:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:22:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:22:12,483 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:22:12,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840092613] [2022-03-15 21:22:12,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840092613] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:22:12,484 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:22:12,484 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:22:12,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [963732592] [2022-03-15 21:22:12,486 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:22:12,491 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:22:12,525 INFO L252 McrAutomatonBuilder]: Finished intersection with 172 states and 392 transitions. [2022-03-15 21:22:12,526 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:22:14,331 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [418#(and (< x2 (+ s11 s21 1)) (<= (+ s11 s21) x2))] [2022-03-15 21:22:14,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:22:14,347 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:22:14,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:22:14,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-15 21:22:14,363 INFO L87 Difference]: Start difference. First operand has 172 states, 171 states have (on average 3.6608187134502925) internal successors, (626), 171 states have internal predecessors, (626), 0 states have call successors, (0), 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 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:14,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:22:14,500 INFO L93 Difference]: Finished difference Result 339 states and 1245 transitions. [2022-03-15 21:22:14,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:22:14,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 21:22:14,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:22:14,510 INFO L225 Difference]: With dead ends: 339 [2022-03-15 21:22:14,510 INFO L226 Difference]: Without dead ends: 308 [2022-03-15 21:22:14,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:22:14,518 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:22:14,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 50 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:22:14,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-03-15 21:22:14,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2022-03-15 21:22:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 3.7133550488599347) internal successors, (1140), 307 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:14,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 1140 transitions. [2022-03-15 21:22:14,569 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 1140 transitions. Word has length 22 [2022-03-15 21:22:14,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:22:14,570 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 1140 transitions. [2022-03-15 21:22:14,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 1140 transitions. [2022-03-15 21:22:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:22:14,572 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:22:14,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:22:14,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:22:14,573 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:22:14,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:22:14,573 INFO L85 PathProgramCache]: Analyzing trace with hash -677887948, now seen corresponding path program 1 times [2022-03-15 21:22:14,574 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:22:14,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538776042] [2022-03-15 21:22:14,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:22:14,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:22:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:22:14,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:22:14,607 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:22:14,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538776042] [2022-03-15 21:22:14,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538776042] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:22:14,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043691955] [2022-03-15 21:22:14,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:22:14,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:22:14,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:22:14,610 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:22:14,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 21:22:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:22:14,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 21:22:14,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:22:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:22:14,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:22:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:22:14,763 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043691955] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:22:14,763 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:22:14,764 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-03-15 21:22:14,764 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1479987459] [2022-03-15 21:22:14,764 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:22:14,766 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:22:14,787 INFO L252 McrAutomatonBuilder]: Finished intersection with 211 states and 502 transitions. [2022-03-15 21:22:14,788 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:22:16,554 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [1516#(not (= i1 n)), 1518#(not (= n (+ i1 1))), 1517#(or (not (= i1 n)) (<= (+ i2 1) n)), 1519#(or (not (= n (+ i1 1))) (<= (+ i2 1) n)), 1520#(or (<= n i1) (<= (+ i2 1) n))] [2022-03-15 21:22:16,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 21:22:16,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:22:16,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 21:22:16,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:22:16,561 INFO L87 Difference]: Start difference. First operand 308 states and 1140 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:16,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:22:16,774 INFO L93 Difference]: Finished difference Result 503 states and 1795 transitions. [2022-03-15 21:22:16,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 21:22:16,775 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 21:22:16,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:22:16,778 INFO L225 Difference]: With dead ends: 503 [2022-03-15 21:22:16,778 INFO L226 Difference]: Without dead ends: 461 [2022-03-15 21:22:16,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 225 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-03-15 21:22:16,779 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 128 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:22:16,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 65 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:22:16,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-03-15 21:22:16,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 345. [2022-03-15 21:22:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 3.7906976744186047) internal successors, (1304), 344 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:16,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1304 transitions. [2022-03-15 21:22:16,807 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1304 transitions. Word has length 23 [2022-03-15 21:22:16,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:22:16,807 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 1304 transitions. [2022-03-15 21:22:16,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:16,807 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1304 transitions. [2022-03-15 21:22:16,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:22:16,811 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:22:16,812 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:22:16,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 21:22:17,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:22:17,016 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:22:17,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:22:17,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1223429809, now seen corresponding path program 1 times [2022-03-15 21:22:17,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:22:17,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604026605] [2022-03-15 21:22:17,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:22:17,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:22:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:22:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:22:17,042 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:22:17,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604026605] [2022-03-15 21:22:17,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604026605] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:22:17,042 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:22:17,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:22:17,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [365377736] [2022-03-15 21:22:17,043 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:22:17,045 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:22:17,076 INFO L252 McrAutomatonBuilder]: Finished intersection with 211 states and 502 transitions. [2022-03-15 21:22:17,077 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:22:17,948 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2728#(not (= i1 n)), 2729#(or (<= n i2) (not (= i1 n)))] [2022-03-15 21:22:17,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:22:17,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:22:17,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:22:17,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 21:22:17,949 INFO L87 Difference]: Start difference. First operand 345 states and 1304 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:18,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:22:18,070 INFO L93 Difference]: Finished difference Result 517 states and 1908 transitions. [2022-03-15 21:22:18,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:22:18,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 21:22:18,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:22:18,073 INFO L225 Difference]: With dead ends: 517 [2022-03-15 21:22:18,073 INFO L226 Difference]: Without dead ends: 437 [2022-03-15 21:22:18,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:22:18,074 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 49 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:22:18,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 41 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:22:18,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-03-15 21:22:18,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 399. [2022-03-15 21:22:18,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 3.8266331658291457) internal successors, (1523), 398 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:18,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1523 transitions. [2022-03-15 21:22:18,095 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1523 transitions. Word has length 23 [2022-03-15 21:22:18,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:22:18,095 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 1523 transitions. [2022-03-15 21:22:18,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:18,095 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1523 transitions. [2022-03-15 21:22:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 21:22:18,096 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:22:18,096 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:22:18,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 21:22:18,097 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:22:18,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:22:18,097 INFO L85 PathProgramCache]: Analyzing trace with hash -855605802, now seen corresponding path program 1 times [2022-03-15 21:22:18,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:22:18,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980327271] [2022-03-15 21:22:18,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:22:18,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:22:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:22:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:22:18,212 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:22:18,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980327271] [2022-03-15 21:22:18,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980327271] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:22:18,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439734427] [2022-03-15 21:22:18,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:22:18,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:22:18,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:22:18,228 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:22:18,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 21:22:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:22:18,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 21:22:18,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:22:18,457 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2022-03-15 21:22:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:22:18,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:22:18,602 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:22:18,602 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 17 treesize of output 22 [2022-03-15 21:22:18,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:22:18,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 7 [2022-03-15 21:22:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:22:18,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439734427] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:22:18,649 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:22:18,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2022-03-15 21:22:18,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [722343356] [2022-03-15 21:22:18,650 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:22:18,651 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:22:18,676 INFO L252 McrAutomatonBuilder]: Finished intersection with 259 states and 642 transitions. [2022-03-15 21:22:18,677 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:22:24,823 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [4213#(and (or (<= (+ s12 s22 (select x (+ i2 1))) x1) (not (= (+ i2 1) n))) (or (<= x1 (+ s12 s22 (select x (+ i2 1)))) (not (= (+ i2 1) n)))), 4208#(and (or (not (= i1 n)) (<= (+ s11 s21) (+ s12 s22))) (or (<= (+ s12 s22) (+ s11 s21)) (not (= i1 n)))), 4212#(and (or (<= (+ s12 s22) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1))) (not (= i2 n))) (or (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22)) (not (= n (+ i1 1))) (not (= i2 n)))), 4207#(and (or (<= (+ s11 s21 (select x (+ i1 1))) x2) (not (= n (+ i1 1)))) (or (not (= n (+ i1 1))) (< x2 (+ s11 s21 (select x (+ i1 1)) 1)))), 4211#(and (or (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22)) (not (= n (+ i1 1)))) (or (<= (+ s12 s22) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1))))), 4214#(and (or (<= (+ s11 s21) (+ s12 s22 (select x (+ i2 1)))) (not (= (+ i2 1) n))) (or (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21)) (not (= (+ i2 1) n)))), 4217#(and (or (<= (+ s12 s22) (+ s11 s21)) (not (= n (+ i1 1)))) (or (not (= n (+ i1 1))) (<= (+ s11 s21) (+ s12 s22)))), 4209#(and (or (not (= i2 n)) (<= (+ s11 s21) (+ s12 s22))) (or (<= (+ s12 s22) (+ s11 s21)) (not (= i2 n)))), 4205#(and (< x2 (+ s11 s21 1)) (<= (+ s11 s21) x2)), 4206#(and (or (not (= i1 n)) (<= (+ s11 s21) x2)) (or (< x2 (+ s11 s21 1)) (not (= i1 n)))), 4216#(and (or (not (= n (+ i1 1))) (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ i1 1)))) (not (= (+ i2 1) n))) (or (not (= n (+ i1 1))) (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22 (select x (+ i2 1)))) (not (= (+ i2 1) n)))), 4210#(and (or (<= (+ s12 s22) (+ s11 s21)) (not (= i1 n)) (not (= i2 n))) (or (not (= i1 n)) (not (= i2 n)) (<= (+ s11 s21) (+ s12 s22)))), 4215#(and (or (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21)) (not (= i1 n)) (not (= (+ i2 1) n))) (or (<= (+ s11 s21) (+ s12 s22 (select x (+ i2 1)))) (not (= i1 n)) (not (= (+ i2 1) n))))] [2022-03-15 21:22:24,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 21:22:24,824 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:22:24,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 21:22:24,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2022-03-15 21:22:24,824 INFO L87 Difference]: Start difference. First operand 399 states and 1523 transitions. Second operand has 22 states, 21 states have (on average 5.761904761904762) internal successors, (121), 21 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:27,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:22:27,057 INFO L93 Difference]: Finished difference Result 875 states and 3166 transitions. [2022-03-15 21:22:27,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 21:22:27,057 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.761904761904762) internal successors, (121), 21 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 21:22:27,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:22:27,061 INFO L225 Difference]: With dead ends: 875 [2022-03-15 21:22:27,061 INFO L226 Difference]: Without dead ends: 829 [2022-03-15 21:22:27,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 220 SyntacticMatches, 40 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=558, Invalid=2864, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 21:22:27,063 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 435 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 1658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:22:27,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [435 Valid, 326 Invalid, 1658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:22:27,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2022-03-15 21:22:27,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 593. [2022-03-15 21:22:27,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 592 states have (on average 3.9695945945945947) internal successors, (2350), 592 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:27,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 2350 transitions. [2022-03-15 21:22:27,077 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 2350 transitions. Word has length 24 [2022-03-15 21:22:27,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:22:27,077 INFO L470 AbstractCegarLoop]: Abstraction has 593 states and 2350 transitions. [2022-03-15 21:22:27,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.761904761904762) internal successors, (121), 21 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:27,078 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 2350 transitions. [2022-03-15 21:22:27,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 21:22:27,079 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:22:27,079 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:22:27,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 21:22:27,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-15 21:22:27,311 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:22:27,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:22:27,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1522698195, now seen corresponding path program 1 times [2022-03-15 21:22:27,312 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:22:27,312 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887968497] [2022-03-15 21:22:27,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:22:27,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:22:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:22:27,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:22:27,352 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:22:27,353 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887968497] [2022-03-15 21:22:27,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887968497] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:22:27,353 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:22:27,353 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 21:22:27,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1841625793] [2022-03-15 21:22:27,354 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:22:27,355 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:22:27,377 INFO L252 McrAutomatonBuilder]: Finished intersection with 250 states and 612 transitions. [2022-03-15 21:22:27,378 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:22:28,761 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [6346#(<= n (+ i1 1)), 6345#(or (<= (+ n 1) i1) (not (= i2 n))), 6344#(not (= i2 n))] [2022-03-15 21:22:28,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:22:28,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:22:28,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:22:28,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:22:28,763 INFO L87 Difference]: Start difference. First operand 593 states and 2350 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:22:28,885 INFO L93 Difference]: Finished difference Result 696 states and 2634 transitions. [2022-03-15 21:22:28,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:22:28,885 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 21:22:28,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:22:28,889 INFO L225 Difference]: With dead ends: 696 [2022-03-15 21:22:28,889 INFO L226 Difference]: Without dead ends: 661 [2022-03-15 21:22:28,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-03-15 21:22:28,890 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 102 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:22:28,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 37 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:22:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-03-15 21:22:28,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 572. [2022-03-15 21:22:28,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 571 states have (on average 3.9754816112084064) internal successors, (2270), 571 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 2270 transitions. [2022-03-15 21:22:28,907 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 2270 transitions. Word has length 24 [2022-03-15 21:22:28,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:22:28,907 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 2270 transitions. [2022-03-15 21:22:28,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:28,907 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 2270 transitions. [2022-03-15 21:22:28,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:22:28,909 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:22:28,909 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:22:28,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 21:22:28,909 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:22:28,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:22:28,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1957003823, now seen corresponding path program 2 times [2022-03-15 21:22:28,910 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:22:28,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894676631] [2022-03-15 21:22:28,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:22:28,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:22:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:22:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:22:28,948 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:22:28,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894676631] [2022-03-15 21:22:28,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894676631] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:22:28,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418434619] [2022-03-15 21:22:28,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:22:28,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:22:28,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:22:28,953 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:22:28,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 21:22:28,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:22:28,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:22:28,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:22:28,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:22:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:22:29,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:22:29,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:22:29,091 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418434619] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:22:29,091 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:22:29,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 9 [2022-03-15 21:22:29,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1169530338] [2022-03-15 21:22:29,091 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:22:29,093 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:22:29,120 INFO L252 McrAutomatonBuilder]: Finished intersection with 307 states and 782 transitions. [2022-03-15 21:22:29,120 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:22:31,624 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [8348#(not (= n (+ i1 1))), 8347#(not (= i1 n)), 8356#(or (not (= (+ i2 (* (- 1) n) 1) 0)) (<= i2 i1)), 8350#(or (not (= n (+ i1 1))) (not (= i2 n))), 8355#(or (not (= n (+ 2 i1))) (not (= (+ i2 1) n))), 8354#(or (not (= n (+ i1 1))) (not (= (+ i2 1) n))), 8352#(not (= n (+ 2 i1))), 8353#(or (not (= n (+ 2 i1))) (not (= i2 n))), 8351#(or (not (= i1 n)) (not (= (+ i2 1) n))), 8349#(or (not (= i1 n)) (not (= i2 n)))] [2022-03-15 21:22:31,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:22:31,624 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:22:31,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:22:31,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:22:31,625 INFO L87 Difference]: Start difference. First operand 572 states and 2270 transitions. Second operand has 16 states, 16 states have (on average 7.0) internal successors, (112), 15 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:32,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:22:32,173 INFO L93 Difference]: Finished difference Result 1055 states and 4235 transitions. [2022-03-15 21:22:32,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 21:22:32,173 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.0) internal successors, (112), 15 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:22:32,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:22:32,178 INFO L225 Difference]: With dead ends: 1055 [2022-03-15 21:22:32,178 INFO L226 Difference]: Without dead ends: 989 [2022-03-15 21:22:32,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 309 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=312, Invalid=948, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 21:22:32,179 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 313 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:22:32,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 193 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:22:32,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2022-03-15 21:22:32,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 699. [2022-03-15 21:22:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 4.16189111747851) internal successors, (2905), 698 states have internal predecessors, (2905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 2905 transitions. [2022-03-15 21:22:32,199 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 2905 transitions. Word has length 25 [2022-03-15 21:22:32,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:22:32,201 INFO L470 AbstractCegarLoop]: Abstraction has 699 states and 2905 transitions. [2022-03-15 21:22:32,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.0) internal successors, (112), 15 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:32,201 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 2905 transitions. [2022-03-15 21:22:32,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:22:32,203 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:22:32,204 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:22:32,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 21:22:32,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:22:32,421 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:22:32,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:22:32,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2069891980, now seen corresponding path program 3 times [2022-03-15 21:22:32,425 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:22:32,425 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386421038] [2022-03-15 21:22:32,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:22:32,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:22:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:22:32,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:22:32,459 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:22:32,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386421038] [2022-03-15 21:22:32,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386421038] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:22:32,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44992808] [2022-03-15 21:22:32,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:22:32,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:22:32,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:22:32,461 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:22:32,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 21:22:32,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 21:22:32,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:22:32,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:22:32,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:22:32,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:22:32,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:22:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:22:32,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44992808] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:22:32,580 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:22:32,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 6 [2022-03-15 21:22:32,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [762677144] [2022-03-15 21:22:32,580 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:22:32,582 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:22:32,610 INFO L252 McrAutomatonBuilder]: Finished intersection with 307 states and 782 transitions. [2022-03-15 21:22:32,610 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:22:34,171 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [10996#(or (<= n (+ i2 1)) (not (= i1 n))), 10999#(or (<= i1 i2) (not (< i1 n))), 10995#(or (<= n i2) (not (= i1 n))), 10994#(not (= n (+ i1 1))), 10993#(not (= i1 n)), 10997#(or (<= n i2) (not (= n (+ i1 1)))), 10998#(or (not (= n (+ i1 1))) (<= n (+ i2 1)))] [2022-03-15 21:22:34,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 21:22:34,172 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:22:34,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 21:22:34,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-03-15 21:22:34,173 INFO L87 Difference]: Start difference. First operand 699 states and 2905 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:22:34,607 INFO L93 Difference]: Finished difference Result 1701 states and 6888 transitions. [2022-03-15 21:22:34,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 21:22:34,608 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:22:34,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:22:34,615 INFO L225 Difference]: With dead ends: 1701 [2022-03-15 21:22:34,615 INFO L226 Difference]: Without dead ends: 1474 [2022-03-15 21:22:34,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 319 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=559, Unknown=0, NotChecked=0, Total=812 [2022-03-15 21:22:34,616 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 235 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:22:34,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 121 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:22:34,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2022-03-15 21:22:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1059. [2022-03-15 21:22:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 1058 states have (on average 4.248582230623819) internal successors, (4495), 1058 states have internal predecessors, (4495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 4495 transitions. [2022-03-15 21:22:34,645 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 4495 transitions. Word has length 25 [2022-03-15 21:22:34,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:22:34,646 INFO L470 AbstractCegarLoop]: Abstraction has 1059 states and 4495 transitions. [2022-03-15 21:22:34,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:22:34,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 4495 transitions. [2022-03-15 21:22:34,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:22:34,649 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:22:34,649 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:22:34,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 21:22:34,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:22:34,870 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:22:34,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:22:34,870 INFO L85 PathProgramCache]: Analyzing trace with hash -778339525, now seen corresponding path program 4 times [2022-03-15 21:22:34,871 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:22:34,871 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221208080] [2022-03-15 21:22:34,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:22:34,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:22:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:22:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:22:35,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:22:35,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221208080] [2022-03-15 21:22:35,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221208080] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:22:35,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865410043] [2022-03-15 21:22:35,022 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:22:35,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:22:35,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:22:35,028 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:22:35,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 21:22:35,062 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:22:35,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:22:35,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 21:22:35,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:22:35,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-03-15 21:22:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:22:35,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:22:35,541 INFO L353 Elim1Store]: treesize reduction 36, result has 50.7 percent of original size [2022-03-15 21:22:35,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 48 [2022-03-15 21:22:35,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:22:35,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:22:35,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:22:35,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:22:35,601 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2022-03-15 21:22:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:22:35,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865410043] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:22:35,624 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:22:35,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2022-03-15 21:22:35,624 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2067471270] [2022-03-15 21:22:35,624 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:22:35,626 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:22:35,663 INFO L252 McrAutomatonBuilder]: Finished intersection with 364 states and 952 transitions. [2022-03-15 21:22:35,663 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:22:45,505 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [15031#(and (or (<= (+ s11 s21 (select x (+ i1 1))) x2) (not (= n (+ i1 1)))) (or (not (= n (+ i1 1))) (< x2 (+ s11 s21 (select x (+ i1 1)) 1)))), 15043#(and (or (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22)) (not (= i2 n))) (or (not (= n (+ 2 i1))) (not (= i2 n)) (<= (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))))), 15046#(and (or (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))) (not (= n (+ 2 i1))) (not (= n (+ 2 i2)))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22 (select x (+ i2 1)) (select x n))) (not (= n (+ 2 i1))) (not (= n (+ 2 i2))))), 15045#(and (or (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22 (select x n)))) (or (not (= n (+ 2 i1))) (<= (+ s12 s22 (select x n)) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))))), 15028#(and (or (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21)) (not (= i1 n)) (not (= (+ i2 1) n))) (or (<= (+ s11 s21) (+ s12 s22 (select x n))) (not (= i1 n)) (not (= (+ i2 1) n)))), 15037#(and (or (not (= n (+ 2 i2))) (<= (+ s12 s22 (select x (+ i2 1)) (select x n)) (+ s11 s21))) (or (not (= n (+ 2 i2))) (<= (+ s11 s21) (+ s12 s22 (select x (+ i2 1)) (select x n))))), 15020#(and (< x2 (+ s11 s21 1)) (<= (+ s11 s21) x2)), 15041#(and (or (not (= n (+ 2 i1))) (< x2 (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) 1))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) x2) (not (= n (+ 2 i1))))), 15030#(and (or (<= (+ s11 s21) (+ s12 s22 (select x n))) (not (= i1 n))) (or (not (= i1 n)) (<= (+ s12 s22 (select x n)) (+ s11 s21)))), 15021#(and (or (not (= i1 n)) (<= (+ s11 s21) x2)) (or (< x2 (+ s11 s21 1)) (not (= i1 n)))), 15038#(and (or (not (= i1 n)) (not (= n (+ 2 i2))) (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21))) (or (not (= i1 n)) (not (= n (+ 2 i2))) (<= (+ s11 s21) (+ s12 s22 (select x (+ i2 1)) (select x n))))), 15025#(and (or (<= (+ s12 s22) (+ s11 s21)) (not (= i1 n)) (not (= i2 n))) (or (not (= i1 n)) (not (= i2 n)) (<= (+ s11 s21) (+ s12 s22)))), 15026#(and (or (<= x1 (+ s12 s22 (select x n))) (not (= (+ i2 1) n))) (or (<= (+ s12 s22 (select x n)) x1) (not (= (+ i2 1) n)))), 15039#(and (or (not (= n (+ i1 1))) (not (= n (+ 2 i2))) (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22 (select x (+ i2 1)) (select x n)))) (or (not (= n (+ i1 1))) (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ 2 i2))))), 15029#(and (<= (+ s11 s21) (+ s12 s22 (select x n))) (<= (+ s12 s22 (select x n)) (+ s11 s21))), 15035#(and (or (not (= n (+ i1 1))) (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22 (select x n)))) (or (<= (+ s12 s22 (select x n)) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1))))), 15040#(and (or (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21)) (not (= n (+ i1 1)))) (or (<= (+ s11 s21) (+ s12 s22 (select x (+ i2 1)))) (not (= n (+ i1 1))))), 15044#(and (or (not (= n (+ 2 i1))) (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))) (not (= (+ i2 1) n))) (or (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22 (select x n))) (not (= (+ i2 1) n)))), 15023#(and (or (not (= i1 n)) (<= (+ s11 s21) (+ s12 s22))) (or (<= (+ s12 s22) (+ s11 s21)) (not (= i1 n)))), 15036#(and (or (<= (+ s12 s22 (select x (+ i2 1)) (select x n)) x1) (not (= n (+ 2 i2)))) (or (<= x1 (+ s12 s22 (select x (+ i2 1)) (select x n))) (not (= n (+ 2 i2))))), 15047#(and (or (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22 (select x (+ i2 1))))) (or (not (= n (+ 2 i1))) (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ i1 1)))))), 15022#(and (<= (+ s12 s22) (+ s11 s21)) (<= (+ s11 s21) (+ s12 s22))), 15042#(and (or (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22))) (or (not (= n (+ 2 i1))) (<= (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))))), 15034#(and (or (not (= n (+ i1 1))) (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22 (select x n))) (not (= (+ i2 1) n))) (or (not (= n (+ i1 1))) (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ i1 1)))) (not (= (+ i2 1) n)))), 15024#(and (or (not (= i2 n)) (<= (+ s11 s21) (+ s12 s22))) (or (<= (+ s12 s22) (+ s11 s21)) (not (= i2 n)))), 15027#(and (or (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21)) (not (= (+ i2 1) n))) (or (<= (+ s11 s21) (+ s12 s22 (select x n))) (not (= (+ i2 1) n)))), 15033#(and (or (<= (+ s12 s22) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1))) (not (= i2 n))) (or (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22)) (not (= n (+ i1 1))) (not (= i2 n)))), 15032#(and (or (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22)) (not (= n (+ i1 1)))) (or (<= (+ s12 s22) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1)))))] [2022-03-15 21:22:45,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 21:22:45,506 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:22:45,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 21:22:45,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2158, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 21:22:45,507 INFO L87 Difference]: Start difference. First operand 1059 states and 4495 transitions. Second operand has 39 states, 38 states have (on average 5.342105263157895) internal successors, (203), 38 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:23:12,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:23:12,077 INFO L93 Difference]: Finished difference Result 5393 states and 20886 transitions. [2022-03-15 21:23:12,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2022-03-15 21:23:12,077 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 5.342105263157895) internal successors, (203), 38 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 21:23:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:23:12,101 INFO L225 Difference]: With dead ends: 5393 [2022-03-15 21:23:12,101 INFO L226 Difference]: Without dead ends: 4659 [2022-03-15 21:23:12,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 293 SyntacticMatches, 56 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16867 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=8366, Invalid=39376, Unknown=0, NotChecked=0, Total=47742 [2022-03-15 21:23:12,109 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 3178 mSDsluCounter, 5084 mSDsCounter, 0 mSdLazyCounter, 6306 mSolverCounterSat, 936 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3178 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 7242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 936 IncrementalHoareTripleChecker+Valid, 6306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:23:12,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3178 Valid, 1300 Invalid, 7242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [936 Valid, 6306 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-03-15 21:23:12,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4659 states. [2022-03-15 21:23:12,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4659 to 1910. [2022-03-15 21:23:12,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1910 states, 1909 states have (on average 4.492928234677842) internal successors, (8577), 1909 states have internal predecessors, (8577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:23:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 8577 transitions. [2022-03-15 21:23:12,168 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 8577 transitions. Word has length 26 [2022-03-15 21:23:12,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:23:12,168 INFO L470 AbstractCegarLoop]: Abstraction has 1910 states and 8577 transitions. [2022-03-15 21:23:12,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 5.342105263157895) internal successors, (203), 38 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:23:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 8577 transitions. [2022-03-15 21:23:12,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:23:12,173 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:23:12,174 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:23:12,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 21:23:12,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:23:12,376 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:23:12,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:23:12,376 INFO L85 PathProgramCache]: Analyzing trace with hash 859125479, now seen corresponding path program 1 times [2022-03-15 21:23:12,377 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:23:12,377 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931915300] [2022-03-15 21:23:12,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:23:12,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:23:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:23:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:23:12,427 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:23:12,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931915300] [2022-03-15 21:23:12,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931915300] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:23:12,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547428386] [2022-03-15 21:23:12,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:23:12,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:23:12,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:23:12,429 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:23:12,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 21:23:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:23:12,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:23:12,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:23:12,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:23:12,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:23:12,555 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:23:12,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547428386] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:23:12,555 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:23:12,555 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-03-15 21:23:12,555 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [872820239] [2022-03-15 21:23:12,555 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:23:12,557 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:23:12,593 INFO L252 McrAutomatonBuilder]: Finished intersection with 355 states and 922 transitions. [2022-03-15 21:23:12,593 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:23:15,546 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [24769#(or (not (= n (+ i1 1))) (not (= (+ i2 1) n))), 24771#(not (= n (+ 2 i1))), 24775#(not (= n (+ 3 i1))), 24778#(or (<= n (+ 2 i1)) (not (= i2 n))), 24774#(or (<= n i1) (not (= (+ i2 1) n))), 24763#(not (= i1 n)), 24772#(or (not (= n (+ 2 i1))) (not (= i2 n))), 24770#(or (<= (+ n 1) i1) (not (= (+ i2 1) n))), 24773#(or (not (= n (+ 2 i1))) (not (= (+ i2 1) n))), 24768#(or (not (= n (+ i1 1))) (not (= i2 n))), 24777#(or (not (= n (+ 3 i1))) (not (= (+ i2 1) n))), 24766#(or (not (= i1 n)) (not (= (+ i2 1) n))), 24764#(or (not (= i1 n)) (not (= i2 n))), 24765#(not (= (+ i2 1) n)), 24767#(not (= n (+ i1 1))), 24776#(or (not (= n (+ 3 i1))) (not (= i2 n)))] [2022-03-15 21:23:15,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:23:15,546 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:23:15,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:23:15,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:23:15,547 INFO L87 Difference]: Start difference. First operand 1910 states and 8577 transitions. Second operand has 23 states, 23 states have (on average 7.086956521739131) internal successors, (163), 22 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:23:16,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:23:16,507 INFO L93 Difference]: Finished difference Result 5117 states and 21822 transitions. [2022-03-15 21:23:16,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 21:23:16,508 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.086956521739131) internal successors, (163), 22 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 21:23:16,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:23:16,531 INFO L225 Difference]: With dead ends: 5117 [2022-03-15 21:23:16,531 INFO L226 Difference]: Without dead ends: 4913 [2022-03-15 21:23:16,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=874, Invalid=2666, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 21:23:16,532 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 912 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:23:16,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [912 Valid, 275 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:23:16,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4913 states. [2022-03-15 21:23:16,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4913 to 3172. [2022-03-15 21:23:16,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3172 states, 3171 states have (on average 4.567644276253548) internal successors, (14484), 3171 states have internal predecessors, (14484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:23:16,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3172 states to 3172 states and 14484 transitions. [2022-03-15 21:23:16,645 INFO L78 Accepts]: Start accepts. Automaton has 3172 states and 14484 transitions. Word has length 26 [2022-03-15 21:23:16,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:23:16,645 INFO L470 AbstractCegarLoop]: Abstraction has 3172 states and 14484 transitions. [2022-03-15 21:23:16,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.086956521739131) internal successors, (163), 22 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:23:16,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3172 states and 14484 transitions. [2022-03-15 21:23:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:23:16,654 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:23:16,654 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:23:16,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 21:23:16,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:23:16,855 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:23:16,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:23:16,856 INFO L85 PathProgramCache]: Analyzing trace with hash 325362607, now seen corresponding path program 5 times [2022-03-15 21:23:16,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:23:16,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71508936] [2022-03-15 21:23:16,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:23:16,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:23:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:23:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:23:16,896 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:23:16,896 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71508936] [2022-03-15 21:23:16,896 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71508936] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:23:16,896 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143613626] [2022-03-15 21:23:16,896 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:23:16,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:23:16,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:23:16,897 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:23:16,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 21:23:16,931 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:23:16,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:23:16,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:23:16,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:23:16,967 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:23:16,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:23:17,005 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:23:17,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143613626] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:23:17,005 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:23:17,005 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2022-03-15 21:23:17,005 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1905114777] [2022-03-15 21:23:17,005 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:23:17,007 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:23:17,056 INFO L252 McrAutomatonBuilder]: Finished intersection with 421 states and 1122 transitions. [2022-03-15 21:23:17,056 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:23:19,429 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [36480#(or (not (< i1 n)) (<= i1 (+ i2 1))), 36472#(or (<= n i2) (not (= n (+ i1 1)))), 36470#(not (= n (+ 2 i1))), 36473#(or (<= n i2) (not (= n (+ 2 i1)))), 36475#(or (not (= n (+ i1 1))) (<= n (+ i2 1))), 36471#(or (<= n i2) (not (= i1 n))), 36476#(or (<= n (+ i2 1)) (not (= n (+ 2 i1)))), 36469#(not (= n (+ i1 1))), 36477#(or (<= n (+ 2 i2)) (not (= i1 n))), 36478#(or (<= n (+ 2 i2)) (not (= n (+ i1 1)))), 36481#(or (<= i1 i2) (<= n (+ i1 1))), 36468#(not (= i1 n)), 36479#(or (<= n (+ 2 i2)) (not (= n (+ 2 i1)))), 36474#(or (<= n (+ i2 1)) (not (= i1 n)))] [2022-03-15 21:23:19,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 21:23:19,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:23:19,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 21:23:19,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2022-03-15 21:23:19,430 INFO L87 Difference]: Start difference. First operand 3172 states and 14484 transitions. Second operand has 22 states, 22 states have (on average 7.045454545454546) internal successors, (155), 21 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:23:20,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:23:20,256 INFO L93 Difference]: Finished difference Result 7433 states and 32267 transitions. [2022-03-15 21:23:20,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 21:23:20,257 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.045454545454546) internal successors, (155), 21 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:23:20,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:23:20,280 INFO L225 Difference]: With dead ends: 7433 [2022-03-15 21:23:20,280 INFO L226 Difference]: Without dead ends: 6738 [2022-03-15 21:23:20,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 429 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=862, Invalid=2000, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 21:23:20,281 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 585 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:23:20,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [585 Valid, 249 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:23:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6738 states. [2022-03-15 21:23:20,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6738 to 3557. [2022-03-15 21:23:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 4.549775028121485) internal successors, (16179), 3556 states have internal predecessors, (16179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:23:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 16179 transitions. [2022-03-15 21:23:20,388 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 16179 transitions. Word has length 27 [2022-03-15 21:23:20,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:23:20,388 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 16179 transitions. [2022-03-15 21:23:20,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.045454545454546) internal successors, (155), 21 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:23:20,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 16179 transitions. [2022-03-15 21:23:20,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:23:20,397 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:23:20,397 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:23:20,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 21:23:20,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:23:20,628 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:23:20,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:23:20,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1528474685, now seen corresponding path program 2 times [2022-03-15 21:23:20,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:23:20,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534644669] [2022-03-15 21:23:20,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:23:20,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:23:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:23:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:23:20,667 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:23:20,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534644669] [2022-03-15 21:23:20,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534644669] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:23:20,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800369164] [2022-03-15 21:23:20,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:23:20,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:23:20,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:23:20,668 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:23:20,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 21:23:20,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:23:20,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:23:20,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:23:20,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:23:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:23:20,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:23:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:23:20,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800369164] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:23:20,790 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:23:20,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-03-15 21:23:20,791 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [690632436] [2022-03-15 21:23:20,791 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:23:20,793 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:23:20,844 INFO L252 McrAutomatonBuilder]: Finished intersection with 403 states and 1062 transitions. [2022-03-15 21:23:20,844 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:23:23,911 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [51269#(or (<= n i1) (not (= (+ i2 1) n))), 51213#(<= n (+ 2 i1)), 51267#(or (<= (+ 2 n) i1) (not (= (+ i2 1) n))), 51265#(or (<= n i1) (not (= i2 n))), 51217#(<= n (+ 3 i1)), 51262#(not (= i2 n)), 51268#(or (<= (+ n 1) i1) (not (= (+ i2 1) n))), 51263#(or (not (= i2 n)) (<= (+ 2 n) i1)), 51264#(or (<= (+ n 1) i1) (not (= i2 n))), 51266#(not (= (+ i2 1) n)), 51270#(or (<= n (+ i1 1)) (not (= (+ i2 1) n)))] [2022-03-15 21:23:23,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 21:23:23,912 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:23:23,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 21:23:23,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-03-15 21:23:23,913 INFO L87 Difference]: Start difference. First operand 3557 states and 16179 transitions. Second operand has 19 states, 19 states have (on average 7.473684210526316) internal successors, (142), 18 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:23:24,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:23:24,244 INFO L93 Difference]: Finished difference Result 3972 states and 17421 transitions. [2022-03-15 21:23:24,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 21:23:24,245 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.473684210526316) internal successors, (142), 18 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:23:24,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:23:24,257 INFO L225 Difference]: With dead ends: 3972 [2022-03-15 21:23:24,257 INFO L226 Difference]: Without dead ends: 3895 [2022-03-15 21:23:24,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 413 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2022-03-15 21:23:24,257 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 350 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:23:24,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 143 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:23:24,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2022-03-15 21:23:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 3518. [2022-03-15 21:23:24,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3518 states, 3517 states have (on average 4.547625817458061) internal successors, (15994), 3517 states have internal predecessors, (15994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:23:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3518 states to 3518 states and 15994 transitions. [2022-03-15 21:23:24,338 INFO L78 Accepts]: Start accepts. Automaton has 3518 states and 15994 transitions. Word has length 27 [2022-03-15 21:23:24,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:23:24,338 INFO L470 AbstractCegarLoop]: Abstraction has 3518 states and 15994 transitions. [2022-03-15 21:23:24,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.473684210526316) internal successors, (142), 18 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:23:24,338 INFO L276 IsEmpty]: Start isEmpty. Operand 3518 states and 15994 transitions. [2022-03-15 21:23:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 21:23:24,346 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:23:24,347 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:23:24,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 21:23:24,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 21:23:24,558 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:23:24,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:23:24,559 INFO L85 PathProgramCache]: Analyzing trace with hash 261723318, now seen corresponding path program 6 times [2022-03-15 21:23:24,559 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:23:24,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100008794] [2022-03-15 21:23:24,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:23:24,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:23:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:23:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:23:24,750 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:23:24,750 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100008794] [2022-03-15 21:23:24,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100008794] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:23:24,750 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257249940] [2022-03-15 21:23:24,750 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:23:24,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:23:24,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:23:24,751 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:23:24,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 21:23:24,785 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:23:24,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:23:24,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 53 conjunts are in the unsatisfiable core [2022-03-15 21:23:24,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:23:25,109 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:23:25,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 61 [2022-03-15 21:23:25,671 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:23:25,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:23:25,987 INFO L353 Elim1Store]: treesize reduction 36, result has 50.7 percent of original size [2022-03-15 21:23:25,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 48 [2022-03-15 21:23:26,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:23:26,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:23:26,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:23:26,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:23:26,048 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2022-03-15 21:23:26,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:23:26,072 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257249940] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:23:26,072 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:23:26,072 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-03-15 21:23:26,072 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [581084677] [2022-03-15 21:23:26,072 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:23:26,074 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:23:26,139 INFO L252 McrAutomatonBuilder]: Finished intersection with 487 states and 1322 transitions. [2022-03-15 21:23:26,139 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:23:41,441 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [62513#(and (or (not (= n (+ 2 i1))) (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))) (not (= (+ i2 1) n))) (or (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22 (select x (+ i2 1)))) (not (= (+ i2 1) n)))), 62495#(and (or (<= (+ s11 s21) (+ s12 s22 (select x (+ i2 1)))) (not (= (+ i2 1) n))) (or (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21)) (not (= (+ i2 1) n)))), 62498#(and (or (not (= i1 n)) (not (= n (+ 2 i2))) (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21))) (or (not (= i1 n)) (<= (+ s11 s21) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 2 i2))))), 62518#(and (or (not (= n (+ 3 i1))) (< (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) 1 (select x (+ 3 i1))))) (or (not (= n (+ 3 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22)))), 62494#(and (or (<= (+ s12 s22) (+ s11 s21)) (not (= i1 n)) (not (= i2 n))) (or (not (= i1 n)) (not (= i2 n)) (<= (+ s11 s21) (+ s12 s22)))), 62509#(and (or (not (= n (+ i1 1))) (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22 (select x (+ (- 1) n)) (select x (+ i2 1)) (select x n)))) (or (<= (+ s12 s22 (select x (+ (- 1) n)) (select x n) (select x (+ (- 2) n))) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1))))), 62508#(and (or (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1))) (not (= n (+ 3 i2)))) (or (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ i1 1))) (not (= n (+ 3 i2))))), 62499#(and (or (<= n (+ 2 i2)) (<= (+ i2 4) n) (<= x1 (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)) (select x n)))) (or (<= n (+ 2 i2)) (<= (+ i2 4) n) (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)) (select x n)) x1))), 62503#(and (or (<= (+ s11 s21 (select x (+ i1 1))) x2) (not (= n (+ i1 1)))) (or (not (= n (+ i1 1))) (< x2 (+ s11 s21 (select x (+ i1 1)) 1)))), 62522#(and (or (not (= n (+ 3 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 3 i2)))) (or (not (= n (+ 3 i1))) (not (= n (+ 3 i2))) (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))))), 62521#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 3 i1))) (not (= n (+ 2 i2)))) (or (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))) (not (= n (+ 3 i1))) (not (= n (+ 2 i2))))), 62490#(and (<= (+ s12 s22) (+ s11 s21)) (<= (+ s11 s21) (+ s12 s22))), 62505#(and (or (<= (+ s12 s22) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1))) (not (= i2 n))) (or (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22)) (not (= n (+ i1 1))) (not (= i2 n)))), 62491#(and (or (not (= i2 n)) (<= (+ s11 s21) (+ s12 s22))) (or (<= (+ s12 s22) (+ s11 s21)) (not (= i2 n)))), 62516#(and (or (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22 (select x (+ (- 1) n)) (select x (+ i2 1)) (select x n)))) (or (not (= n (+ 2 i1))) (<= (+ s12 s22 (select x (+ (- 1) n)) (select x n) (select x (+ (- 2) n))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))))), 62507#(and (or (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ i1 1))) (not (= n (+ 2 i2)))) (or (not (= n (+ i1 1))) (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ 2 i2))))), 62492#(and (or (not (= i1 n)) (<= (+ s11 s21) x2)) (or (< x2 (+ s11 s21 1)) (not (= i1 n)))), 62493#(and (or (not (= i1 n)) (<= (+ s11 s21) (+ s12 s22))) (or (<= (+ s12 s22) (+ s11 s21)) (not (= i1 n)))), 62511#(and (or (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22))) (or (not (= n (+ 2 i1))) (<= (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))))), 62501#(and (or (<= (+ s11 s21) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= i1 n)) (not (= n (+ 3 i2)))) (or (not (= i1 n)) (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21)) (not (= n (+ 3 i2))))), 62514#(and (or (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))) (not (= n (+ 2 i1))) (not (= n (+ 2 i2)))) (or (not (= n (+ 2 i1))) (not (= n (+ 2 i2))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))))), 62519#(and (or (not (= n (+ 3 i1))) (not (= i2 n)) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22))) (or (not (= n (+ 3 i1))) (< (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) 1 (select x (+ 3 i1)))) (not (= i2 n)))), 62502#(and (or (not (= i1 n)) (<= (+ s12 s22 (select x (+ (- 1) n)) (select x n) (select x (+ (- 2) n))) (+ s11 s21))) (or (<= (+ s11 s21) (+ s12 s22 (select x (+ (- 1) n)) (select x (+ i2 1)) (select x n))) (not (= i1 n)))), 62489#(and (< x2 (+ s11 s21 1)) (<= (+ s11 s21) x2)), 62512#(and (or (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22)) (not (= i2 n))) (or (not (= n (+ 2 i1))) (not (= i2 n)) (<= (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))))), 62500#(and (or (<= (+ s11 s21) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 3 i2)))) (or (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21)) (not (= n (+ 3 i2))))), 62515#(and (or (not (= n (+ 2 i1))) (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))) (not (= n (+ 3 i2)))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 2 i1))) (not (= n (+ 3 i2))))), 62497#(and (or (not (= n (+ 2 i2))) (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21))) (or (<= (+ s11 s21) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 2 i2))))), 62523#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ (- 1) n)) (select x (+ i2 1)) (select x n))) (not (= n (+ 3 i1)))) (or (not (= n (+ 3 i1))) (<= (+ s12 s22 (select x (+ (- 1) n)) (select x n) (select x (+ (- 2) n))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))))), 62504#(and (or (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22)) (not (= n (+ i1 1)))) (or (<= (+ s12 s22) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1))))), 62517#(and (or (< x2 (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) 1 (select x (+ 3 i1)))) (not (= n (+ 3 i1)))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) x2) (not (= n (+ 3 i1))))), 62506#(and (or (not (= n (+ i1 1))) (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ i1 1)))) (not (= (+ i2 1) n))) (or (not (= n (+ i1 1))) (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22 (select x (+ i2 1)))) (not (= (+ i2 1) n)))), 62510#(and (or (not (= n (+ 2 i1))) (< x2 (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) 1))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) x2) (not (= n (+ 2 i1))))), 62496#(and (or (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21)) (not (= i1 n)) (not (= (+ i2 1) n))) (or (<= (+ s11 s21) (+ s12 s22 (select x (+ i2 1)))) (not (= i1 n)) (not (= (+ i2 1) n)))), 62520#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ i2 1)))) (not (= n (+ 3 i1))) (not (= (+ i2 1) n))) (or (not (= n (+ 3 i1))) (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))) (not (= (+ i2 1) n))))] [2022-03-15 21:23:41,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-15 21:23:41,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:23:41,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-15 21:23:41,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=3894, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 21:23:41,443 INFO L87 Difference]: Start difference. First operand 3518 states and 15994 transitions. Second operand has 48 states, 47 states have (on average 5.617021276595745) internal successors, (264), 47 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) [2022-03-15 21:24:32,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:24:32,878 INFO L93 Difference]: Finished difference Result 10445 states and 44202 transitions. [2022-03-15 21:24:32,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2022-03-15 21:24:32,879 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 5.617021276595745) internal successors, (264), 47 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) Word has length 28 [2022-03-15 21:24:32,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:24:32,906 INFO L225 Difference]: With dead ends: 10445 [2022-03-15 21:24:32,907 INFO L226 Difference]: Without dead ends: 9797 [2022-03-15 21:24:32,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 702 GetRequests, 376 SyntacticMatches, 84 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20865 ImplicationChecksByTransitivity, 49.6s TimeCoverageRelationStatistics Valid=9557, Invalid=49735, Unknown=0, NotChecked=0, Total=59292 [2022-03-15 21:24:32,910 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 4651 mSDsluCounter, 5910 mSDsCounter, 0 mSdLazyCounter, 7177 mSolverCounterSat, 1391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4651 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 8568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1391 IncrementalHoareTripleChecker+Valid, 7177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:24:32,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4651 Valid, 1600 Invalid, 8568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1391 Valid, 7177 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-03-15 21:24:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9797 states. [2022-03-15 21:24:33,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9797 to 4622. [2022-03-15 21:24:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4622 states, 4621 states have (on average 4.633196277861934) internal successors, (21410), 4621 states have internal predecessors, (21410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:24:33,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4622 states to 4622 states and 21410 transitions. [2022-03-15 21:24:33,082 INFO L78 Accepts]: Start accepts. Automaton has 4622 states and 21410 transitions. Word has length 28 [2022-03-15 21:24:33,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:24:33,082 INFO L470 AbstractCegarLoop]: Abstraction has 4622 states and 21410 transitions. [2022-03-15 21:24:33,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 5.617021276595745) internal successors, (264), 47 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) [2022-03-15 21:24:33,082 INFO L276 IsEmpty]: Start isEmpty. Operand 4622 states and 21410 transitions. [2022-03-15 21:24:33,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 21:24:33,093 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:24:33,093 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:24:33,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 21:24:33,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:24:33,307 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:24:33,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:24:33,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1669911977, now seen corresponding path program 3 times [2022-03-15 21:24:33,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:24:33,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961754391] [2022-03-15 21:24:33,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:24:33,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:24:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:24:33,360 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:24:33,361 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:24:33,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961754391] [2022-03-15 21:24:33,361 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961754391] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:24:33,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753712236] [2022-03-15 21:24:33,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:24:33,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:24:33,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:24:33,362 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:24:33,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 21:24:33,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:24:33,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:24:33,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:24:33,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:24:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:24:33,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:24:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:24:33,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753712236] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:24:33,503 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:24:33,503 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2022-03-15 21:24:33,503 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1697683229] [2022-03-15 21:24:33,503 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:24:33,505 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:24:33,565 INFO L252 McrAutomatonBuilder]: Finished intersection with 478 states and 1292 transitions. [2022-03-15 21:24:33,565 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:24:37,971 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [82759#(not (= n (+ 2 i2))), 82768#(or (<= n (+ 3 i1)) (not (= i2 n))), 82750#(not (= (+ i1 4) n)), 82746#(not (= i1 n)), 82773#(or (not (= n (+ 2 i2))) (<= (+ i2 1) i1)), 82752#(or (not (= n (+ i1 1))) (not (= i2 n))), 82754#(or (not (= n (+ 3 i1))) (not (= i2 n))), 82764#(or (not (= (+ i1 4) n)) (not (= i2 n))), 82758#(or (not (= n (+ 3 i1))) (not (= (+ i2 1) n))), 82748#(not (= n (+ 2 i1))), 82749#(not (= n (+ 3 i1))), 82766#(or (not (= i2 n)) (<= n (+ i1 1))), 82747#(not (= n (+ i1 1))), 82756#(or (not (= n (+ i1 1))) (not (= (+ i2 1) n))), 82767#(or (<= n (+ 2 i1)) (not (= i2 n))), 82770#(or (not (= n (+ 2 i2))) (not (= (+ i1 4) n))), 82769#(or (not (= (+ i1 4) n)) (not (= (+ i2 1) n))), 82757#(or (not (= n (+ 2 i1))) (not (= (+ i2 1) n))), 82772#(or (not (= n (+ 2 i2))) (<= (+ 2 i2) i1)), 82765#(or (<= n i1) (not (= i2 n))), 82763#(or (not (= n (+ 3 i1))) (not (= n (+ 2 i2)))), 82761#(or (not (= n (+ i1 1))) (not (= n (+ 2 i2)))), 82751#(or (not (= i1 n)) (not (= i2 n))), 82760#(or (not (= i1 n)) (not (= n (+ 2 i2)))), 82771#(or (not (= n (+ 2 i2))) (<= (+ 3 i2) i1)), 82753#(or (not (= n (+ 2 i1))) (not (= i2 n))), 82762#(or (not (= n (+ 2 i1))) (not (= n (+ 2 i2)))), 82755#(or (not (= i1 n)) (not (= (+ i2 1) n)))] [2022-03-15 21:24:37,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 21:24:37,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:24:37,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 21:24:37,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1390, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 21:24:37,972 INFO L87 Difference]: Start difference. First operand 4622 states and 21410 transitions. Second operand has 37 states, 37 states have (on average 6.621621621621622) internal successors, (245), 36 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:24:40,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:24:40,408 INFO L93 Difference]: Finished difference Result 10964 states and 47973 transitions. [2022-03-15 21:24:40,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 21:24:40,408 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 6.621621621621622) internal successors, (245), 36 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 21:24:40,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:24:40,436 INFO L225 Difference]: With dead ends: 10964 [2022-03-15 21:24:40,437 INFO L226 Difference]: Without dead ends: 10469 [2022-03-15 21:24:40,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 465 SyntacticMatches, 7 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2700 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2463, Invalid=7637, Unknown=0, NotChecked=0, Total=10100 [2022-03-15 21:24:40,443 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 1890 mSDsluCounter, 2805 mSDsCounter, 0 mSdLazyCounter, 3156 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1890 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 3598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 3156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:24:40,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1890 Valid, 741 Invalid, 3598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 3156 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 21:24:40,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10469 states. [2022-03-15 21:24:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10469 to 7030. [2022-03-15 21:24:40,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7030 states, 7029 states have (on average 4.654431640347133) internal successors, (32716), 7029 states have internal predecessors, (32716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:24:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7030 states to 7030 states and 32716 transitions. [2022-03-15 21:24:40,617 INFO L78 Accepts]: Start accepts. Automaton has 7030 states and 32716 transitions. Word has length 28 [2022-03-15 21:24:40,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:24:40,618 INFO L470 AbstractCegarLoop]: Abstraction has 7030 states and 32716 transitions. [2022-03-15 21:24:40,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 6.621621621621622) internal successors, (245), 36 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:24:40,618 INFO L276 IsEmpty]: Start isEmpty. Operand 7030 states and 32716 transitions. [2022-03-15 21:24:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 21:24:40,634 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:24:40,634 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:24:40,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 21:24:40,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 21:24:40,847 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:24:40,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:24:40,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1792427628, now seen corresponding path program 7 times [2022-03-15 21:24:40,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:24:40,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621078929] [2022-03-15 21:24:40,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:24:40,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:24:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:24:40,910 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:24:40,910 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:24:40,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621078929] [2022-03-15 21:24:40,910 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621078929] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:24:40,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763953643] [2022-03-15 21:24:40,910 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:24:40,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:24:40,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:24:40,911 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:24:40,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 21:24:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:24:40,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:24:40,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:24:41,016 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:24:41,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:24:41,059 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:24:41,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763953643] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:24:41,059 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:24:41,060 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2022-03-15 21:24:41,060 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [733851264] [2022-03-15 21:24:41,060 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:24:41,062 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:24:41,141 INFO L252 McrAutomatonBuilder]: Finished intersection with 553 states and 1522 transitions. [2022-03-15 21:24:41,141 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:24:44,544 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [108099#(not (= n (+ i1 1))), 108100#(or (<= n i2) (not (= n (+ i1 1)))), 108109#(or (<= n i2) (not (= n (+ 3 i1)))), 108096#(not (= i1 n)), 108107#(or (<= n (+ 3 i2)) (not (= n (+ i1 1)))), 108114#(or (<= i1 (+ 2 i2)) (not (< i1 n))), 108102#(not (= n (+ 2 i1))), 108098#(or (<= n (+ i2 1)) (not (= i1 n))), 108118#(or (<= i1 i2) (<= n (+ 2 i1))), 108113#(or (<= n (+ 2 i2)) (not (= n (+ 3 i1)))), 108117#(or (<= n (+ 3 i2)) (not (= n (+ 3 i1)))), 108115#(or (<= n (+ 3 i2)) (not (= n (+ 2 i1)))), 108111#(or (<= n (+ i2 1)) (not (= n (+ 3 i1)))), 108097#(or (<= n i2) (not (= i1 n))), 108110#(or (<= n (+ i2 1)) (not (= n (+ 2 i1)))), 108103#(not (= n (+ 3 i1))), 108104#(or (not (= n (+ i1 1))) (<= n (+ i2 1))), 108101#(or (<= n (+ 2 i2)) (not (= i1 n))), 108116#(or (<= n (+ i1 1)) (<= i1 (+ i2 1))), 108108#(or (<= n i2) (not (= n (+ 2 i1)))), 108105#(or (<= n (+ 2 i2)) (not (= n (+ i1 1)))), 108112#(or (<= n (+ 2 i2)) (not (= n (+ 2 i1)))), 108106#(or (<= n (+ 3 i2)) (not (= i1 n)))] [2022-03-15 21:24:44,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:24:44,544 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:24:44,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:24:44,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=860, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 21:24:44,545 INFO L87 Difference]: Start difference. First operand 7030 states and 32716 transitions. Second operand has 33 states, 33 states have (on average 6.787878787878788) internal successors, (224), 32 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:24:46,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:24:46,412 INFO L93 Difference]: Finished difference Result 18340 states and 81357 transitions. [2022-03-15 21:24:46,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-03-15 21:24:46,412 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.787878787878788) internal successors, (224), 32 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 21:24:46,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:24:46,498 INFO L225 Difference]: With dead ends: 18340 [2022-03-15 21:24:46,498 INFO L226 Difference]: Without dead ends: 16811 [2022-03-15 21:24:46,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 554 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2700 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2879, Invalid=6823, Unknown=0, NotChecked=0, Total=9702 [2022-03-15 21:24:46,500 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 1397 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:24:46,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1397 Valid, 375 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:24:46,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16811 states. [2022-03-15 21:24:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16811 to 7847. [2022-03-15 21:24:46,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7847 states, 7846 states have (on average 4.63357124649503) internal successors, (36355), 7846 states have internal predecessors, (36355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:24:46,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7847 states to 7847 states and 36355 transitions. [2022-03-15 21:24:46,731 INFO L78 Accepts]: Start accepts. Automaton has 7847 states and 36355 transitions. Word has length 29 [2022-03-15 21:24:46,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:24:46,731 INFO L470 AbstractCegarLoop]: Abstraction has 7847 states and 36355 transitions. [2022-03-15 21:24:46,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.787878787878788) internal successors, (224), 32 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:24:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 7847 states and 36355 transitions. [2022-03-15 21:24:46,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 21:24:46,749 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:24:46,750 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:24:46,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 21:24:46,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 21:24:46,963 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:24:46,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:24:46,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1886015239, now seen corresponding path program 4 times [2022-03-15 21:24:46,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:24:46,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266140824] [2022-03-15 21:24:46,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:24:46,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:24:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:24:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:24:47,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:24:47,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266140824] [2022-03-15 21:24:47,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266140824] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:24:47,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811164782] [2022-03-15 21:24:47,037 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:24:47,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:24:47,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:24:47,038 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:24:47,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 21:24:47,073 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:24:47,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:24:47,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:24:47,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:24:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:24:47,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:24:47,162 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:24:47,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811164782] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:24:47,163 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:24:47,163 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 12 [2022-03-15 21:24:47,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1935690315] [2022-03-15 21:24:47,163 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:24:47,165 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:24:47,277 INFO L252 McrAutomatonBuilder]: Finished intersection with 535 states and 1462 transitions. [2022-03-15 21:24:47,277 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:24:52,522 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [142467#(or (<= (+ 3 n) i1) (not (= i2 n))), 142471#(not (= (+ i2 1) n)), 142478#(or (<= (+ 2 n) i1) (not (= (+ i2 1) n))), 142475#(<= n (+ i1 4)), 142482#(or (<= n (+ i1 1)) (not (= (+ i2 1) n))), 142473#(or (not (= i2 n)) (<= n (+ i1 1))), 142474#(<= n (+ 3 i1)), 142472#(or (<= (+ 3 n) i1) (not (= (+ i2 1) n))), 142480#(or (<= (+ n 1) i1) (not (= (+ i2 1) n))), 142470#(or (<= n i1) (not (= i2 n))), 142481#(or (<= n i1) (not (= (+ i2 1) n))), 142483#(or (<= (+ n 1) i1) (not (= n (+ 2 i2)))), 142484#(or (not (= n (+ 2 i2))) (<= n i1)), 142469#(or (<= (+ n 1) i1) (not (= i2 n))), 142479#(or (not (= n (+ 2 i2))) (<= (+ 2 n) i1)), 142466#(not (= i2 n)), 142476#(not (= n (+ 2 i2))), 142468#(or (not (= i2 n)) (<= (+ 2 n) i1)), 142477#(or (<= (+ 3 n) i1) (not (= n (+ 2 i2)))), 142485#(or (not (= n (+ 2 i2))) (<= n (+ i1 1))), 142486#(or (not (= n (+ 2 i2))) (<= n (+ 2 i1)))] [2022-03-15 21:24:52,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 21:24:52,522 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:24:52,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 21:24:52,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=890, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 21:24:52,523 INFO L87 Difference]: Start difference. First operand 7847 states and 36355 transitions. Second operand has 32 states, 32 states have (on average 6.875) internal successors, (220), 31 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:24:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:24:53,164 INFO L93 Difference]: Finished difference Result 8694 states and 38938 transitions. [2022-03-15 21:24:53,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 21:24:53,164 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.875) internal successors, (220), 31 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 21:24:53,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:24:53,187 INFO L225 Difference]: With dead ends: 8694 [2022-03-15 21:24:53,188 INFO L226 Difference]: Without dead ends: 8563 [2022-03-15 21:24:53,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 516 SyntacticMatches, 23 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=682, Invalid=1970, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 21:24:53,188 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 733 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:24:53,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [733 Valid, 223 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:24:53,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8563 states. [2022-03-15 21:24:53,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8563 to 7682. [2022-03-15 21:24:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7682 states, 7681 states have (on average 4.625048821767999) internal successors, (35525), 7681 states have internal predecessors, (35525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:24:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7682 states to 7682 states and 35525 transitions. [2022-03-15 21:24:53,377 INFO L78 Accepts]: Start accepts. Automaton has 7682 states and 35525 transitions. Word has length 29 [2022-03-15 21:24:53,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:24:53,377 INFO L470 AbstractCegarLoop]: Abstraction has 7682 states and 35525 transitions. [2022-03-15 21:24:53,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.875) internal successors, (220), 31 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:24:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 7682 states and 35525 transitions. [2022-03-15 21:24:53,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:24:53,394 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:24:53,394 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:24:53,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 21:24:53,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 21:24:53,595 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:24:53,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:24:53,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1474725083, now seen corresponding path program 8 times [2022-03-15 21:24:53,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:24:53,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675699377] [2022-03-15 21:24:53,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:24:53,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:24:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:24:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:24:53,839 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:24:53,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675699377] [2022-03-15 21:24:53,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675699377] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:24:53,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542452516] [2022-03-15 21:24:53,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:24:53,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:24:53,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:24:53,841 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:24:53,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 21:24:53,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:24:53,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:24:53,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-15 21:24:53,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:24:54,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:24:54,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:24:54,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:24:54,337 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:24:54,337 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 56 treesize of output 96 [2022-03-15 21:24:54,519 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:24:54,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:24:54,949 INFO L353 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2022-03-15 21:24:54,950 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 37 treesize of output 98 [2022-03-15 21:24:55,149 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:24:55,149 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:24:55,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:24:55,150 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:24:55,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:24:55,153 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:24:55,153 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:24:55,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:24:55,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:24:55,155 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 7 [2022-03-15 21:24:55,199 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:24:55,199 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542452516] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:24:55,199 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:24:55,199 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2022-03-15 21:24:55,199 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [126872006] [2022-03-15 21:24:55,199 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:24:55,202 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:24:55,297 INFO L252 McrAutomatonBuilder]: Finished intersection with 628 states and 1752 transitions. [2022-03-15 21:24:55,297 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:25:17,144 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 47 new interpolants: [166794#(and (or (<= (+ s11 s21) (+ s12 s22 (select x (+ i2 1)))) (not (= (+ i2 1) n))) (or (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21)) (not (= (+ i2 1) n)))), 166802#(and (or (<= (+ s11 s21) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= i1 n)) (not (= n (+ 3 i2)))) (or (not (= i1 n)) (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21)) (not (= n (+ 3 i2))))), 166830#(and (or (not (= n (+ 2 i2))) (not (= (+ i1 4) n)) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))))) (or (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)))) (not (= n (+ 2 i2))) (not (= (+ i1 4) n)))), 166808#(and (or (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22)) (not (= n (+ i1 1)))) (or (<= (+ s12 s22) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1))))), 166796#(and (or (not (= i1 n)) (<= (+ s11 s21) (+ s12 s22))) (or (<= (+ s12 s22) (+ s11 s21)) (not (= i1 n)))), 166822#(and (or (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ i1 1))) (not (= n (+ 2 i2)))) (or (not (= n (+ i1 1))) (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ 2 i2))))), 166825#(and (or (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))) (not (= n (+ 2 i1))) (not (= n (+ 2 i2)))) (or (not (= n (+ 2 i1))) (not (= n (+ 2 i2))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))))), 166795#(and (or (not (= i1 n)) (<= (+ s11 s21) x2)) (or (< x2 (+ s11 s21 1)) (not (= i1 n)))), 166792#(and (< x2 (+ s11 s21 1)) (<= (+ s11 s21) x2)), 166815#(and (or (not (= n (+ 3 i1))) (not (= i2 n)) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22))) (or (not (= n (+ 3 i1))) (< (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) 1 (select x (+ 3 i1)))) (not (= i2 n)))), 166823#(and (or (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1))) (not (= n (+ 3 i2)))) (or (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ i1 1))) (not (= n (+ 3 i2))))), 166835#(and (or (not (= (+ i2 4) n)) (not (= (+ i1 4) n)) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))))) (or (not (= (+ i2 4) n)) (not (= (+ i1 4) n)) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))))), 166797#(and (or (<= (+ s12 s22) (+ s11 s21)) (not (= i1 n)) (not (= i2 n))) (or (not (= i1 n)) (not (= i2 n)) (<= (+ s11 s21) (+ s12 s22)))), 166820#(and (or (not (= n (+ 2 i1))) (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))) (not (= (+ i2 1) n))) (or (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22 (select x (+ i2 1)))) (not (= (+ i2 1) n)))), 166798#(and (or (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21)) (not (= i1 n)) (not (= (+ i2 1) n))) (or (<= (+ s11 s21) (+ s12 s22 (select x (+ i2 1)))) (not (= i1 n)) (not (= (+ i2 1) n)))), 166818#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ s12 s22)) (not (= (+ i1 4) n)) (not (= i2 n))) (or (< (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)))) (not (= (+ i1 4) n)) (not (= i2 n)))), 166806#(and (or (not (= i1 n)) (<= (+ s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n))) (+ s11 s21))) (or (not (= i1 n)) (<= (+ s11 s21) (+ s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n)))))), 166799#(and (or (not (= n (+ 2 i2))) (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21))) (or (<= (+ s11 s21) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 2 i2))))), 166805#(and (or (not (= (+ i2 4) n)) (not (= i1 n)) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21))) (or (not (= (+ i2 4) n)) (not (= i1 n)) (<= (+ s11 s21) (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))))), 166834#(and (or (not (= (+ i2 4) n)) (not (= n (+ 3 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))))) (or (not (= (+ i2 4) n)) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))) (not (= n (+ 3 i1))))), 166811#(and (or (< x2 (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) 1 (select x (+ 3 i1)))) (not (= n (+ 3 i1)))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) x2) (not (= n (+ 3 i1))))), 166819#(and (or (not (= n (+ i1 1))) (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ i1 1)))) (not (= (+ i2 1) n))) (or (not (= n (+ i1 1))) (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22 (select x (+ i2 1)))) (not (= (+ i2 1) n)))), 166812#(and (or (not (= n (+ 3 i1))) (< (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) 1 (select x (+ 3 i1))))) (or (not (= n (+ 3 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22)))), 166803#(and (or (<= (+ 5 i2) n) (<= n (+ 3 i2)) (<= x1 (+ s12 s22 (select x (+ (- 1) n)) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n)))) (or (<= (+ 5 i2) n) (<= n (+ 3 i2)) (<= (+ s12 s22 (select x (+ (- 1) n)) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n)) x1))), 166837#(and (or (<= (+ s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))) (not (= n (+ 3 i1)))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n)))) (not (= n (+ 3 i1))))), 166814#(and (or (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22)) (not (= i2 n))) (or (not (= n (+ 2 i1))) (not (= i2 n)) (<= (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))))), 166832#(and (or (not (= n (+ i1 1))) (<= (+ s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n))) (+ s11 s21 (select x (+ i1 1))))) (or (not (= n (+ i1 1))) (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n)))))), 166809#(and (or (not (= n (+ 2 i1))) (< x2 (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) 1))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) x2) (not (= n (+ 2 i1))))), 166826#(and (or (not (= n (+ 2 i1))) (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))) (not (= n (+ 3 i2)))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 2 i1))) (not (= n (+ 3 i2))))), 166833#(and (or (not (= (+ i2 4) n)) (not (= n (+ 2 i1))) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))))) (or (not (= (+ i2 4) n)) (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))))), 166838#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n)))) (not (= (+ i1 4) n))) (or (<= (+ s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)))) (not (= (+ i1 4) n)))), 166821#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ i2 1)))) (not (= n (+ 3 i1))) (not (= (+ i2 1) n))) (or (not (= n (+ 3 i1))) (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))) (not (= (+ i2 1) n)))), 166793#(and (or (not (= i2 n)) (<= (+ s11 s21) (+ s12 s22))) (or (<= (+ s12 s22) (+ s11 s21)) (not (= i2 n)))), 166810#(and (or (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22))) (or (not (= n (+ 2 i1))) (<= (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))))), 166807#(and (or (<= (+ s11 s21 (select x (+ i1 1))) x2) (not (= n (+ i1 1)))) (or (not (= n (+ i1 1))) (< x2 (+ s11 s21 (select x (+ i1 1)) 1)))), 166829#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ i2 1)))) (not (= (+ i1 4) n)) (not (= (+ i2 1) n))) (or (< (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)))) (not (= (+ i1 4) n)) (not (= (+ i2 1) n)))), 166828#(and (or (not (= n (+ 3 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 3 i2)))) (or (not (= n (+ 3 i1))) (not (= n (+ 3 i2))) (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))))), 166800#(and (or (not (= i1 n)) (not (= n (+ 2 i2))) (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21))) (or (not (= i1 n)) (<= (+ s11 s21) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 2 i2))))), 166836#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n)))) (not (= n (+ 2 i1)))) (or (not (= n (+ 2 i1))) (<= (+ s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))))), 166801#(and (or (<= (+ s11 s21) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 3 i2)))) (or (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21)) (not (= n (+ 3 i2))))), 166827#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 3 i1))) (not (= n (+ 2 i2)))) (or (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))) (not (= n (+ 3 i1))) (not (= n (+ 2 i2))))), 166804#(and (or (not (= (+ i2 4) n)) (<= (+ s11 s21) (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))))) (or (not (= (+ i2 4) n)) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21)))), 166831#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= (+ i1 4) n)) (not (= n (+ 3 i2)))) (or (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)))) (not (= (+ i1 4) n)) (not (= n (+ 3 i2))))), 166813#(and (or (<= (+ s12 s22) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1))) (not (= i2 n))) (or (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22)) (not (= n (+ i1 1))) (not (= i2 n)))), 166817#(and (or (< (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)))) (not (= (+ i1 4) n))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ s12 s22)) (not (= (+ i1 4) n)))), 166816#(and (or (< x2 (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)))) (not (= (+ i1 4) n))) (or (not (= (+ i1 4) n)) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) x2))), 166824#(and (or (not (= (+ i2 4) n)) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1)))) (or (not (= (+ i2 4) n)) (not (= n (+ i1 1))) (<= (+ s11 s21 (select x (+ i1 1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))))))] [2022-03-15 21:25:17,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 21:25:17,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:25:17,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 21:25:17,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=6609, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 21:25:17,145 INFO L87 Difference]: Start difference. First operand 7682 states and 35525 transitions. Second operand has 62 states, 61 states have (on average 5.737704918032787) internal successors, (350), 61 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:26:31,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:26:31,855 INFO L93 Difference]: Finished difference Result 19427 states and 85310 transitions. [2022-03-15 21:26:31,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2022-03-15 21:26:31,856 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 5.737704918032787) internal successors, (350), 61 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:26:31,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:26:31,924 INFO L225 Difference]: With dead ends: 19427 [2022-03-15 21:26:31,924 INFO L226 Difference]: Without dead ends: 18888 [2022-03-15 21:26:31,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 832 GetRequests, 500 SyntacticMatches, 86 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19608 ImplicationChecksByTransitivity, 74.0s TimeCoverageRelationStatistics Valid=8588, Invalid=52668, Unknown=0, NotChecked=0, Total=61256 [2022-03-15 21:26:31,927 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 5339 mSDsluCounter, 6484 mSDsCounter, 0 mSdLazyCounter, 7154 mSolverCounterSat, 1209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5339 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 8363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1209 IncrementalHoareTripleChecker+Valid, 7154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:26:31,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5339 Valid, 1732 Invalid, 8363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1209 Valid, 7154 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-03-15 21:26:31,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18888 states. [2022-03-15 21:26:32,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18888 to 9823. [2022-03-15 21:26:32,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9823 states, 9822 states have (on average 4.650274893097129) internal successors, (45675), 9822 states have internal predecessors, (45675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:26:32,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9823 states to 9823 states and 45675 transitions. [2022-03-15 21:26:32,193 INFO L78 Accepts]: Start accepts. Automaton has 9823 states and 45675 transitions. Word has length 30 [2022-03-15 21:26:32,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:26:32,193 INFO L470 AbstractCegarLoop]: Abstraction has 9823 states and 45675 transitions. [2022-03-15 21:26:32,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 5.737704918032787) internal successors, (350), 61 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:26:32,193 INFO L276 IsEmpty]: Start isEmpty. Operand 9823 states and 45675 transitions. [2022-03-15 21:26:32,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:26:32,217 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:26:32,217 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:26:32,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-03-15 21:26:32,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 21:26:32,418 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:26:32,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:26:32,418 INFO L85 PathProgramCache]: Analyzing trace with hash -281031769, now seen corresponding path program 5 times [2022-03-15 21:26:32,419 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:26:32,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962506064] [2022-03-15 21:26:32,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:26:32,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:26:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:26:32,481 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:26:32,482 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:26:32,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962506064] [2022-03-15 21:26:32,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962506064] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:26:32,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493741187] [2022-03-15 21:26:32,482 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:26:32,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:26:32,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:26:32,486 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:26:32,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 21:26:32,524 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:26:32,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:26:32,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 21:26:32,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:26:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:26:32,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:26:32,640 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:26:32,641 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493741187] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:26:32,641 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:26:32,641 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-15 21:26:32,641 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [670823227] [2022-03-15 21:26:32,641 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:26:32,643 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:26:32,818 INFO L252 McrAutomatonBuilder]: Finished intersection with 619 states and 1722 transitions. [2022-03-15 21:26:32,818 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:26:39,526 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 47 new interpolants: [206437#(or (not (= (+ i1 4) n)) (not (= i2 n))), 206432#(or (not (= n (+ i1 1))) (not (= i2 n))), 206462#(or (<= n (+ i1 1)) (not (= (+ i2 1) n))), 206454#(or (not (= n (+ 3 i1))) (not (= (+ i2 1) n))), 206428#(not (= i1 n)), 206438#(not (= n (+ 5 i1))), 206467#(or (not (= (+ i1 4) n)) (not (= n (+ 3 i2)))), 206448#(or (not (= i1 n)) (not (= n (+ 3 i2)))), 206449#(or (not (= n (+ i1 1))) (not (= n (+ 3 i2)))), 206468#(or (not (= n (+ 5 i1))) (not (= n (+ 3 i2)))), 206447#(not (= n (+ 3 i2))), 206435#(or (not (= n (+ 3 i1))) (not (= i2 n))), 206463#(or (not (= (+ i1 4) n)) (not (= (+ i2 1) n))), 206445#(or (not (= n (+ 2 i1))) (not (= (+ i2 1) n))), 206470#(or (<= n (+ i1 4)) (not (= i2 n))), 206436#(not (= (+ i1 4) n)), 206441#(or (not (= n (+ i1 1))) (not (= (+ i2 1) n))), 206446#(or (not (= n (+ 2 i1))) (not (= n (+ 2 i2)))), 206434#(not (= n (+ 3 i1))), 206452#(or (<= (+ i2 4) i1) (not (< i2 n))), 206450#(or (not (= n (+ 2 i1))) (not (= n (+ 3 i2)))), 206456#(or (not (= n (+ 3 i1))) (not (= n (+ 3 i2)))), 206461#(or (<= n i1) (not (= (+ i2 1) n))), 206473#(or (<= n (+ i1 4)) (not (= (+ i2 1) n))), 206471#(or (<= n (+ 2 i1)) (not (= (+ i2 1) n))), 206429#(not (= n (+ i1 1))), 206457#(or (not (< i2 n)) (<= (+ 2 i2) i1)), 206459#(or (not (= i2 n)) (<= n (+ i1 1))), 206440#(or (not (= i1 n)) (not (= (+ i2 1) n))), 206472#(or (<= n (+ 3 i1)) (not (= (+ i2 1) n))), 206442#(not (= n (+ 2 i2))), 206439#(or (not (= n (+ 5 i1))) (not (= i2 n))), 206451#(or (<= (+ 5 i2) n) (not (< i2 n))), 206474#(or (not (< i2 n)) (<= (+ i2 1) i1)), 206465#(or (not (= n (+ 2 i2))) (not (= (+ i1 4) n))), 206455#(or (not (= n (+ 3 i1))) (not (= n (+ 2 i2)))), 206466#(or (not (= n (+ 2 i2))) (not (= n (+ 5 i1)))), 206458#(or (<= n i1) (not (= i2 n))), 206431#(or (not (= i1 n)) (not (= i2 n))), 206464#(or (not (= n (+ 5 i1))) (not (= (+ i2 1) n))), 206469#(or (<= n (+ 3 i1)) (not (= i2 n))), 206460#(or (<= n (+ 2 i1)) (not (= i2 n))), 206430#(not (= n (+ 2 i1))), 206444#(or (not (= n (+ i1 1))) (not (= n (+ 2 i2)))), 206433#(or (not (= n (+ 2 i1))) (not (= i2 n))), 206453#(or (not (< i2 n)) (<= (+ 3 i2) i1)), 206443#(or (not (= i1 n)) (not (= n (+ 2 i2))))] [2022-03-15 21:26:39,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-03-15 21:26:39,527 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:26:39,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-03-15 21:26:39,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=616, Invalid=3044, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 21:26:39,527 INFO L87 Difference]: Start difference. First operand 9823 states and 45675 transitions. Second operand has 57 states, 57 states have (on average 6.385964912280702) internal successors, (364), 56 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) [2022-03-15 21:26:44,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:26:44,232 INFO L93 Difference]: Finished difference Result 23752 states and 105180 transitions. [2022-03-15 21:26:44,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-03-15 21:26:44,232 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 6.385964912280702) internal successors, (364), 56 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) Word has length 30 [2022-03-15 21:26:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:26:44,304 INFO L225 Difference]: With dead ends: 23752 [2022-03-15 21:26:44,304 INFO L226 Difference]: Without dead ends: 22375 [2022-03-15 21:26:44,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 573 SyntacticMatches, 24 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7956 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5979, Invalid=18201, Unknown=0, NotChecked=0, Total=24180 [2022-03-15 21:26:44,306 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 5085 mSDsluCounter, 3443 mSDsCounter, 0 mSdLazyCounter, 3856 mSolverCounterSat, 1309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5085 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 5165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1309 IncrementalHoareTripleChecker+Valid, 3856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:26:44,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5085 Valid, 929 Invalid, 5165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1309 Valid, 3856 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 21:26:44,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22375 states. [2022-03-15 21:26:44,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22375 to 12000. [2022-03-15 21:26:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12000 states, 11999 states have (on average 4.661055087923994) internal successors, (55928), 11999 states have internal predecessors, (55928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:26:44,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12000 states to 12000 states and 55928 transitions. [2022-03-15 21:26:44,747 INFO L78 Accepts]: Start accepts. Automaton has 12000 states and 55928 transitions. Word has length 30 [2022-03-15 21:26:44,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:26:44,747 INFO L470 AbstractCegarLoop]: Abstraction has 12000 states and 55928 transitions. [2022-03-15 21:26:44,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 6.385964912280702) internal successors, (364), 56 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) [2022-03-15 21:26:44,747 INFO L276 IsEmpty]: Start isEmpty. Operand 12000 states and 55928 transitions. [2022-03-15 21:26:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 21:26:44,776 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:26:44,776 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:26:44,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 21:26:44,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:26:44,977 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:26:44,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:26:44,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1450888719, now seen corresponding path program 9 times [2022-03-15 21:26:44,978 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:26:44,978 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391951924] [2022-03-15 21:26:44,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:26:44,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:26:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:26:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:26:45,039 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:26:45,039 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391951924] [2022-03-15 21:26:45,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391951924] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:26:45,039 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141762445] [2022-03-15 21:26:45,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:26:45,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:26:45,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:26:45,044 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:26:45,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 21:26:45,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:26:45,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:26:45,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 21:26:45,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:26:45,133 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:26:45,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:26:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:26:45,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141762445] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:26:45,183 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:26:45,183 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 12 [2022-03-15 21:26:45,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1909980232] [2022-03-15 21:26:45,184 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:26:45,186 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:26:45,375 INFO L252 McrAutomatonBuilder]: Finished intersection with 703 states and 1982 transitions. [2022-03-15 21:26:45,375 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:26:50,174 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 34 new interpolants: [254620#(or (<= n (+ 2 i2)) (not (= n (+ i1 1)))), 254614#(or (<= n i2) (not (= n (+ i1 1)))), 254640#(or (<= i1 (+ 3 i2)) (not (< i1 n))), 254610#(not (= i1 n)), 254622#(or (<= n (+ 3 i2)) (not (= i1 n))), 254616#(not (= n (+ 3 i1))), 254621#(not (= (+ i1 4) n)), 254626#(or (<= n (+ i2 1)) (not (= n (+ 2 i1)))), 254629#(or (<= n (+ i2 4)) (not (= n (+ 2 i1)))), 254627#(or (<= n (+ 2 i2)) (not (= n (+ 2 i1)))), 254625#(or (<= n (+ i2 4)) (not (= n (+ i1 1)))), 254631#(or (<= n (+ i2 1)) (not (= n (+ 3 i1)))), 254642#(or (<= n (+ 2 i1)) (<= i1 (+ i2 1))), 254623#(or (<= n (+ i2 4)) (not (= i1 n))), 254633#(or (<= n (+ 3 i2)) (not (= n (+ 3 i1)))), 254641#(or (<= i1 (+ 2 i2)) (<= n (+ i1 1))), 254635#(or (<= n i2) (not (= (+ i1 4) n))), 254611#(not (= n (+ i1 1))), 254618#(or (<= n (+ 2 i2)) (not (= i1 n))), 254628#(or (<= n (+ 3 i2)) (not (= n (+ 2 i1)))), 254619#(or (not (= n (+ i1 1))) (<= n (+ i2 1))), 254637#(or (<= n (+ 2 i2)) (not (= (+ i1 4) n))), 254624#(or (<= n (+ 3 i2)) (not (= n (+ i1 1)))), 254615#(or (<= n i2) (not (= n (+ 2 i1)))), 254632#(or (<= n (+ 2 i2)) (not (= n (+ 3 i1)))), 254612#(not (= n (+ 2 i1))), 254643#(or (<= i1 i2) (<= n (+ 3 i1))), 254617#(or (<= n (+ i2 1)) (not (= i1 n))), 254638#(or (<= n (+ 3 i2)) (not (= (+ i1 4) n))), 254636#(or (<= n (+ i2 1)) (not (= (+ i1 4) n))), 254613#(or (<= n i2) (not (= i1 n))), 254630#(or (<= n i2) (not (= n (+ 3 i1)))), 254634#(or (<= n (+ i2 4)) (not (= n (+ 3 i1)))), 254639#(or (<= n (+ i2 4)) (not (= (+ i1 4) n)))] [2022-03-15 21:26:50,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 21:26:50,174 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:26:50,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 21:26:50,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=1798, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 21:26:50,175 INFO L87 Difference]: Start difference. First operand 12000 states and 55928 transitions. Second operand has 46 states, 46 states have (on average 6.630434782608695) internal successors, (305), 45 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:26:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:26:55,402 INFO L93 Difference]: Finished difference Result 37559 states and 168806 transitions. [2022-03-15 21:26:55,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2022-03-15 21:26:55,403 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 6.630434782608695) internal successors, (305), 45 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 21:26:55,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:26:55,548 INFO L225 Difference]: With dead ends: 37559 [2022-03-15 21:26:55,548 INFO L226 Difference]: Without dead ends: 34362 [2022-03-15 21:26:55,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 879 GetRequests, 696 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11737 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=10253, Invalid=23419, Unknown=0, NotChecked=0, Total=33672 [2022-03-15 21:26:55,550 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 2654 mSDsluCounter, 2706 mSDsCounter, 0 mSdLazyCounter, 2980 mSolverCounterSat, 556 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2654 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 3536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 556 IncrementalHoareTripleChecker+Valid, 2980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:26:55,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2654 Valid, 745 Invalid, 3536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [556 Valid, 2980 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 21:26:55,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34362 states. [2022-03-15 21:26:56,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34362 to 15924. [2022-03-15 21:26:56,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15924 states, 15923 states have (on average 4.698612070589713) internal successors, (74816), 15923 states have internal predecessors, (74816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:26:56,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15924 states to 15924 states and 74816 transitions. [2022-03-15 21:26:56,343 INFO L78 Accepts]: Start accepts. Automaton has 15924 states and 74816 transitions. Word has length 31 [2022-03-15 21:26:56,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:26:56,343 INFO L470 AbstractCegarLoop]: Abstraction has 15924 states and 74816 transitions. [2022-03-15 21:26:56,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 6.630434782608695) internal successors, (305), 45 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:26:56,343 INFO L276 IsEmpty]: Start isEmpty. Operand 15924 states and 74816 transitions. [2022-03-15 21:26:56,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 21:26:56,499 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:26:56,499 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:26:56,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 21:26:56,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 21:26:56,700 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:26:56,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:26:56,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1450975299, now seen corresponding path program 6 times [2022-03-15 21:26:56,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:26:56,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984933755] [2022-03-15 21:26:56,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:26:56,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:26:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:26:56,858 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:26:56,858 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:26:56,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984933755] [2022-03-15 21:26:56,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984933755] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:26:56,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228575654] [2022-03-15 21:26:56,859 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:26:56,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:26:56,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:26:56,860 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:26:56,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 21:26:56,898 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:26:56,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:26:56,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 21:26:56,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:26:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:26:56,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:26:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:26:57,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228575654] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:26:57,036 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:26:57,036 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2022-03-15 21:26:57,036 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1646897616] [2022-03-15 21:26:57,036 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:26:57,040 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:26:57,200 INFO L252 McrAutomatonBuilder]: Finished intersection with 685 states and 1922 transitions. [2022-03-15 21:26:57,200 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:27:04,206 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [324548#(or (<= (+ n 1) i1) (not (= n (+ 3 i2)))), 324540#(or (not (= n (+ 2 i2))) (<= (+ 2 n) i1)), 324542#(or (not (= n (+ 2 i2))) (<= n i1)), 324551#(or (<= n (+ 2 i1)) (not (= n (+ 3 i2)))), 324550#(or (not (= n (+ 3 i2))) (<= n (+ i1 1))), 324537#(or (<= n (+ i1 1)) (not (= (+ i2 1) n))), 324469#(<= n (+ i1 4)), 324549#(or (<= n i1) (not (= n (+ 3 i2)))), 324544#(or (not (= n (+ 2 i2))) (<= n (+ 2 i1))), 324532#(or (<= n (+ 2 i1)) (not (= i2 n))), 324553#(or (<= n (+ 3 i1)) (not (= n (+ 3 i2)))), 324546#(or (<= (+ 3 n) i1) (not (= n (+ 3 i2)))), 324545#(not (= n (+ 3 i2))), 324534#(or (<= (+ 2 n) i1) (not (= (+ i2 1) n))), 324525#(not (= (+ i2 1) n)), 324527#(or (<= (+ 3 n) i1) (not (= i2 n))), 324541#(or (<= (+ n 1) i1) (not (= n (+ 2 i2)))), 324530#(or (<= n i1) (not (= i2 n))), 324535#(or (<= (+ n 1) i1) (not (= (+ i2 1) n))), 324524#(not (= i2 n)), 324543#(or (not (= n (+ 2 i2))) (<= n (+ i1 1))), 324473#(<= n (+ 5 i1)), 324539#(or (<= (+ 3 n) i1) (not (= n (+ 2 i2)))), 324552#(or (<= n (+ 3 i1)) (not (= n (+ 2 i2)))), 324536#(or (<= n i1) (not (= (+ i2 1) n))), 324526#(not (= n (+ 2 i2))), 324547#(or (not (= n (+ 3 i2))) (<= (+ 2 n) i1)), 324531#(or (not (= i2 n)) (<= n (+ i1 1))), 324528#(or (not (= i2 n)) (<= (+ 2 n) i1)), 324529#(or (<= (+ n 1) i1) (not (= i2 n))), 324538#(or (<= n (+ 2 i1)) (not (= (+ i2 1) n))), 324533#(or (<= (+ 3 n) i1) (not (= (+ i2 1) n)))] [2022-03-15 21:27:04,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 21:27:04,207 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:27:04,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 21:27:04,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=1962, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 21:27:04,207 INFO L87 Difference]: Start difference. First operand 15924 states and 74816 transitions. Second operand has 45 states, 45 states have (on average 6.7555555555555555) internal successors, (304), 44 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:06,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:27:06,807 INFO L93 Difference]: Finished difference Result 42747 states and 192580 transitions. [2022-03-15 21:27:06,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-03-15 21:27:06,807 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 6.7555555555555555) internal successors, (304), 44 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 21:27:06,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:27:06,978 INFO L225 Difference]: With dead ends: 42747 [2022-03-15 21:27:06,978 INFO L226 Difference]: Without dead ends: 42154 [2022-03-15 21:27:06,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 660 SyntacticMatches, 18 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3519 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2999, Invalid=8557, Unknown=0, NotChecked=0, Total=11556 [2022-03-15 21:27:06,979 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 1022 mSDsluCounter, 2285 mSDsCounter, 0 mSdLazyCounter, 2727 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 2727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:27:06,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1022 Valid, 547 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 2727 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 21:27:07,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42154 states. [2022-03-15 21:27:07,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42154 to 20523. [2022-03-15 21:27:07,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20523 states, 20522 states have (on average 4.656953513302797) internal successors, (95570), 20522 states have internal predecessors, (95570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20523 states to 20523 states and 95570 transitions. [2022-03-15 21:27:07,908 INFO L78 Accepts]: Start accepts. Automaton has 20523 states and 95570 transitions. Word has length 31 [2022-03-15 21:27:07,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:27:07,908 INFO L470 AbstractCegarLoop]: Abstraction has 20523 states and 95570 transitions. [2022-03-15 21:27:07,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 6.7555555555555555) internal successors, (304), 44 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 20523 states and 95570 transitions. [2022-03-15 21:27:07,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 21:27:07,961 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:27:07,961 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:27:07,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-15 21:27:08,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:27:08,176 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:27:08,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:27:08,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1563550614, now seen corresponding path program 10 times [2022-03-15 21:27:08,177 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:27:08,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650484399] [2022-03-15 21:27:08,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:27:08,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:27:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:27:08,684 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:08,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:27:08,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650484399] [2022-03-15 21:27:08,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650484399] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:27:08,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049919376] [2022-03-15 21:27:08,685 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:27:08,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:27:08,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:27:08,686 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:27:08,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 21:27:08,735 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:27:08,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:27:08,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-15 21:27:08,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:27:09,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2022-03-15 21:27:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:09,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:27:10,179 INFO L353 Elim1Store]: treesize reduction 300, result has 44.5 percent of original size [2022-03-15 21:27:10,180 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 57 treesize of output 258 [2022-03-15 21:27:11,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:27:11,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:27:11,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:27:11,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:27:11,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:27:11,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:27:11,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:27:11,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:27:11,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:27:11,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:27:11,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:27:11,242 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:27:11,242 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:27:11,242 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:27:11,242 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:27:11,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:27:11,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:27:11,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:27:11,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:27:11,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:27:11,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:27:11,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:27:11,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:27:11,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:27:11,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:27:11,247 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 10 disjoint index pairs (out of 45 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 7 [2022-03-15 21:27:11,294 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:11,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049919376] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:27:11,295 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:27:11,295 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 38 [2022-03-15 21:27:11,295 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [443746271] [2022-03-15 21:27:11,295 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:27:11,298 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:27:11,474 INFO L252 McrAutomatonBuilder]: Finished intersection with 787 states and 2242 transitions. [2022-03-15 21:27:11,474 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:27:43,995 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 62 new interpolants: [408722#(and (or (<= n (+ i2 4)) (<= x1 (+ s12 s22 (select x (+ (- 1) n)) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n)))) (<= (+ 6 i2) n)) (or (<= n (+ i2 4)) (<= (+ 6 i2) n) (<= (+ s12 s22 (select x (+ (- 1) n)) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n))) x1))), 408735#(and (or (<= (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))) (not (= n (+ 2 i1)))) (or (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n)))))), 408717#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ s12 s22)) (not (= (+ i1 4) n)) (not (= i2 n))) (or (< (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)))) (not (= (+ i1 4) n)) (not (= i2 n)))), 408732#(and (or (not (= n (+ 2 i1))) (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))) (not (= n (+ 3 i2)))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 2 i1))) (not (= n (+ 3 i2))))), 408700#(and (or (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21)) (not (= i1 n)) (not (= (+ i2 1) n))) (or (<= (+ s11 s21) (+ s12 s22 (select x (+ i2 1)))) (not (= i1 n)) (not (= (+ i2 1) n)))), 408708#(and (or (not (= n (+ 2 i1))) (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))) (not (= (+ i2 1) n))) (or (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22 (select x (+ i2 1)))) (not (= (+ i2 1) n)))), 408694#(and (or (not (= i1 n)) (<= (+ s11 s21) (+ s12 s22))) (or (<= (+ s12 s22) (+ s11 s21)) (not (= i1 n)))), 408721#(and (or (not (= (+ i2 4) n)) (not (= i1 n)) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21))) (or (not (= (+ i2 4) n)) (not (= i1 n)) (<= (+ s11 s21) (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))))), 408750#(and (or (not (= (+ i2 4) n)) (not (= n (+ 5 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))))) (or (not (= (+ i2 4) n)) (not (= n (+ 5 i1))) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1)))))), 408723#(and (or (<= n (+ i2 4)) (<= (+ 6 i2) n) (<= (+ s12 s22 (select x (+ (- 1) n)) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n))) (+ s11 s21))) (or (<= n (+ i2 4)) (<= (+ 6 i2) n) (<= (+ s11 s21) (+ s12 s22 (select x (+ (- 1) n)) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n)))))), 408711#(and (or (not (= n (+ 3 i1))) (< (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) 1 (select x (+ 3 i1))))) (or (not (= n (+ 3 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22)))), 408727#(and (or (not (= n (+ 2 i2))) (not (= (+ i1 4) n)) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))))) (or (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)))) (not (= n (+ 2 i2))) (not (= (+ i1 4) n)))), 408737#(and (or (not (= (+ i2 4) n)) (not (= n (+ 3 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))))) (or (not (= (+ i2 4) n)) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))) (not (= n (+ 3 i1))))), 408701#(and (or (not (= n (+ i1 1))) (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ i1 1)))) (not (= (+ i2 1) n))) (or (not (= n (+ i1 1))) (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22 (select x (+ i2 1)))) (not (= (+ i2 1) n)))), 408698#(and (or (<= (+ s12 s22) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1))) (not (= i2 n))) (or (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22)) (not (= n (+ i1 1))) (not (= i2 n)))), 408724#(and (or (<= n (+ i2 4)) (not (= i1 n)) (<= (+ 6 i2) n) (<= (+ s11 s21) (+ s12 s22 (select x (+ (- 1) n)) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n))))) (or (<= n (+ i2 4)) (not (= i1 n)) (<= (+ 6 i2) n) (<= (+ s12 s22 (select x (+ (- 1) n)) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n))) (+ s11 s21)))), 408747#(and (or (not (= n (+ 5 i1))) (< (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)) (select x (+ 5 i1)))) (not (= (+ i2 1) n))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ s12 s22 (select x (+ i2 1)))) (not (= n (+ 5 i1))) (not (= (+ i2 1) n)))), 408714#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 3 i1))) (not (= n (+ 2 i2)))) (or (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))) (not (= n (+ 3 i1))) (not (= n (+ 2 i2))))), 408705#(and (or (not (= n (+ 2 i1))) (< x2 (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) 1))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) x2) (not (= n (+ 2 i1))))), 408696#(and (or (<= (+ s11 s21 (select x (+ i1 1))) x2) (not (= n (+ i1 1)))) (or (not (= n (+ i1 1))) (< x2 (+ s11 s21 (select x (+ i1 1)) 1)))), 408738#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 5 i2))) (not (= n (+ 3 i1)))) (or (not (= n (+ 5 i2))) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))) (not (= n (+ 3 i1))))), 408731#(and (or (<= (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n))) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1)))) (or (not (= n (+ i1 1))) (<= (+ s11 s21 (select x (+ i1 1))) (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n)))))), 408703#(and (or (not (= i1 n)) (not (= n (+ 2 i2))) (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21))) (or (not (= i1 n)) (<= (+ s11 s21) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 2 i2))))), 408745#(and (or (not (= n (+ 5 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ s12 s22))) (or (not (= n (+ 5 i1))) (< (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)) (select x (+ 5 i1)))))), 408739#(and (or (not (= n (+ 3 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n))))) (or (not (= n (+ 3 i1))) (<= (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))))), 408710#(and (or (< x2 (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) 1 (select x (+ 3 i1)))) (not (= n (+ 3 i1)))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) x2) (not (= n (+ 3 i1))))), 408715#(and (or (< x2 (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)))) (not (= (+ i1 4) n))) (or (not (= (+ i1 4) n)) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) x2))), 408752#(and (or (not (= n (+ 5 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n))))) (or (<= (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1)))) (not (= n (+ 5 i1))))), 408691#(and (< x2 (+ s11 s21 1)) (<= (+ s11 s21) x2)), 408719#(and (or (<= (+ s11 s21) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= i1 n)) (not (= n (+ 3 i2)))) (or (not (= i1 n)) (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21)) (not (= n (+ 3 i2))))), 408716#(and (or (< (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)))) (not (= (+ i1 4) n))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ s12 s22)) (not (= (+ i1 4) n)))), 408728#(and (or (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1))) (not (= n (+ 3 i2)))) (or (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ i1 1))) (not (= n (+ 3 i2))))), 408699#(and (or (<= (+ s11 s21) (+ s12 s22 (select x (+ i2 1)))) (not (= (+ i2 1) n))) (or (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21)) (not (= (+ i2 1) n)))), 408697#(and (or (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22)) (not (= n (+ i1 1)))) (or (<= (+ s12 s22) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1))))), 408749#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 5 i1))) (not (= n (+ 3 i2)))) (or (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1)))) (not (= n (+ 5 i1))) (not (= n (+ 3 i2))))), 408726#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ i2 1)))) (not (= (+ i1 4) n)) (not (= (+ i2 1) n))) (or (< (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)))) (not (= (+ i1 4) n)) (not (= (+ i2 1) n)))), 408712#(and (or (not (= n (+ 3 i1))) (not (= i2 n)) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22))) (or (not (= n (+ 3 i1))) (< (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) 1 (select x (+ 3 i1)))) (not (= i2 n)))), 408713#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ i2 1)))) (not (= n (+ 3 i1))) (not (= (+ i2 1) n))) (or (not (= n (+ 3 i1))) (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))) (not (= (+ i2 1) n)))), 408740#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= (+ i1 4) n)) (not (= n (+ 3 i2)))) (or (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)))) (not (= (+ i1 4) n)) (not (= n (+ 3 i2))))), 408718#(and (or (<= (+ s11 s21) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 3 i2)))) (or (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21)) (not (= n (+ 3 i2))))), 408729#(and (or (not (= (+ i2 4) n)) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1)))) (or (not (= (+ i2 4) n)) (not (= n (+ i1 1))) (<= (+ s11 s21 (select x (+ i1 1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))))), 408751#(and (or (not (= n (+ 5 i2))) (not (= n (+ 5 i1))) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))))) (or (not (= n (+ 5 i2))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 5 i1))))), 408704#(and (or (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ i1 1))) (not (= n (+ 2 i2)))) (or (not (= n (+ i1 1))) (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ 2 i2))))), 408725#(and (or (not (= i1 n)) (<= (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n))) (+ s11 s21))) (or (<= (+ s11 s21) (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n)))) (not (= i1 n)))), 408692#(and (or (not (= i2 n)) (<= (+ s11 s21) (+ s12 s22))) (or (<= (+ s12 s22) (+ s11 s21)) (not (= i2 n)))), 408702#(and (or (not (= n (+ 2 i2))) (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21))) (or (<= (+ s11 s21) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 2 i2))))), 408742#(and (or (not (= n (+ 5 i2))) (not (= (+ i1 4) n)) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))))) (or (not (= n (+ 5 i2))) (not (= (+ i1 4) n)) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))))), 408709#(and (or (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))) (not (= n (+ 2 i1))) (not (= n (+ 2 i2)))) (or (not (= n (+ 2 i1))) (not (= n (+ 2 i2))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))))), 408720#(and (or (<= (+ 5 i2) n) (<= n (+ 3 i2)) (<= (+ s11 s21) (+ s12 s22 (select x (+ (- 1) n)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n))))) (or (<= (+ 5 i2) n) (<= (+ s12 s22 (select x (+ (- 1) n)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n))) (+ s11 s21)) (<= n (+ 3 i2)))), 408730#(and (or (not (= n (+ 5 i2))) (not (= n (+ i1 1))) (<= (+ s11 s21 (select x (+ i1 1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))))) (or (not (= n (+ 5 i2))) (not (= n (+ i1 1))) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ i1 1)))))), 408695#(and (or (<= (+ s12 s22) (+ s11 s21)) (not (= i1 n)) (not (= i2 n))) (or (not (= i1 n)) (not (= i2 n)) (<= (+ s11 s21) (+ s12 s22)))), 408736#(and (or (not (= n (+ 3 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 3 i2)))) (or (not (= n (+ 3 i1))) (not (= n (+ 3 i2))) (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))))), 408693#(and (or (not (= i1 n)) (<= (+ s11 s21) x2)) (or (< x2 (+ s11 s21 1)) (not (= i1 n)))), 408733#(and (or (not (= (+ i2 4) n)) (not (= n (+ 2 i1))) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))))) (or (not (= (+ i2 4) n)) (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))))), 408744#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) x2) (not (= n (+ 5 i1)))) (or (< x2 (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)) (select x (+ 5 i1)))) (not (= n (+ 5 i1))))), 408734#(and (or (not (= n (+ 5 i2))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 2 i1)))) (or (not (= n (+ 5 i2))) (not (= n (+ 2 i1))) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))))), 408743#(and (or (not (= (+ i1 4) n)) (<= (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x n) (select x (+ (- 2) n)))) (not (= (+ i1 4) n)))), 408706#(and (or (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22))) (or (not (= n (+ 2 i1))) (<= (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))))), 408707#(and (or (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22)) (not (= i2 n))) (or (not (= n (+ 2 i1))) (not (= i2 n)) (<= (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))))), 408741#(and (or (not (= (+ i2 4) n)) (not (= (+ i1 4) n)) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))))) (or (not (= (+ i2 4) n)) (not (= (+ i1 4) n)) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))))), 408748#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 2 i2))) (not (= n (+ 5 i1)))) (or (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1)))) (not (= n (+ 2 i2))) (not (= n (+ 5 i1))))), 408746#(and (or (not (= n (+ 5 i1))) (not (= i2 n)) (< (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)) (select x (+ 5 i1))))) (or (not (= n (+ 5 i1))) (not (= i2 n)) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ s12 s22))))] [2022-03-15 21:27:43,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-03-15 21:27:43,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:27:43,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-03-15 21:27:43,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=9771, Unknown=0, NotChecked=0, Total=10302 [2022-03-15 21:27:43,996 INFO L87 Difference]: Start difference. First operand 20523 states and 95570 transitions. Second operand has 79 states, 78 states have (on average 5.743589743589744) internal successors, (448), 78 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) [2022-03-15 21:30:26,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:30:26,381 INFO L93 Difference]: Finished difference Result 41877 states and 186456 transitions. [2022-03-15 21:30:26,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2022-03-15 21:30:26,381 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 78 states have (on average 5.743589743589744) internal successors, (448), 78 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) Word has length 32 [2022-03-15 21:30:26,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:30:26,526 INFO L225 Difference]: With dead ends: 41877 [2022-03-15 21:30:26,526 INFO L226 Difference]: Without dead ends: 40903 [2022-03-15 21:30:26,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1061 GetRequests, 625 SyntacticMatches, 106 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36625 ImplicationChecksByTransitivity, 160.7s TimeCoverageRelationStatistics Valid=15471, Invalid=94421, Unknown=0, NotChecked=0, Total=109892 [2022-03-15 21:30:26,530 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 9093 mSDsluCounter, 10009 mSDsCounter, 0 mSdLazyCounter, 10858 mSolverCounterSat, 2114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9093 SdHoareTripleChecker+Valid, 2804 SdHoareTripleChecker+Invalid, 12972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2114 IncrementalHoareTripleChecker+Valid, 10858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:30:26,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9093 Valid, 2804 Invalid, 12972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2114 Valid, 10858 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2022-03-15 21:30:26,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40903 states. [2022-03-15 21:30:27,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40903 to 26576. [2022-03-15 21:30:27,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26576 states, 26575 states have (on average 4.676199435559736) internal successors, (124270), 26575 states have internal predecessors, (124270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:27,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26576 states to 26576 states and 124270 transitions. [2022-03-15 21:30:27,278 INFO L78 Accepts]: Start accepts. Automaton has 26576 states and 124270 transitions. Word has length 32 [2022-03-15 21:30:27,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:30:27,278 INFO L470 AbstractCegarLoop]: Abstraction has 26576 states and 124270 transitions. [2022-03-15 21:30:27,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 78 states have (on average 5.743589743589744) internal successors, (448), 78 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) [2022-03-15 21:30:27,278 INFO L276 IsEmpty]: Start isEmpty. Operand 26576 states and 124270 transitions. [2022-03-15 21:30:27,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 21:30:27,342 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:30:27,342 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:30:27,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 21:30:27,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:27,545 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:30:27,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:30:27,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1951443049, now seen corresponding path program 7 times [2022-03-15 21:30:27,546 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:30:27,546 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983659140] [2022-03-15 21:30:27,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:30:27,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:30:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:30:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:27,611 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:30:27,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983659140] [2022-03-15 21:30:27,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983659140] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:30:27,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088288256] [2022-03-15 21:30:27,611 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:30:27,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:27,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:30:27,622 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:30:27,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 21:30:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:30:27,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 21:30:27,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:30:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:28,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:30:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:28,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088288256] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:30:28,081 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:30:28,081 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14 [2022-03-15 21:30:28,081 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1128368904] [2022-03-15 21:30:28,081 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:30:28,085 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:30:28,221 INFO L252 McrAutomatonBuilder]: Finished intersection with 778 states and 2212 transitions. [2022-03-15 21:30:28,221 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:30:36,478 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 69 new interpolants: [504496#(or (<= n (+ i1 4)) (not (= i2 n))), 504477#(or (not (= n (+ 2 i2))) (not (= (+ i1 4) n))), 504501#(or (<= (+ i2 4) i1) (<= n (+ i2 1))), 504479#(or (not (= n (+ 2 i2))) (not (= n (+ 6 i1)))), 504481#(or (not (= i2 n)) (<= n (+ i1 1))), 504461#(or (not (= n (+ 2 i1))) (not (= (+ i2 1) n))), 504448#(not (= n (+ 3 i2))), 504455#(or (not (= n (+ i1 1))) (not (= i2 n))), 504463#(or (not (= n (+ 2 i1))) (not (= n (+ 3 i2)))), 504466#(not (= (+ i1 4) n)), 504492#(or (<= n i1) (not (= (+ i2 1) n))), 504469#(or (not (= n (+ 5 i1))) (not (= i2 n))), 504502#(or (not (= (+ i2 4) n)) (not (= n (+ 3 i1)))), 504445#(or (not (= i1 n)) (not (= (+ i2 1) n))), 504456#(or (not (= n (+ i1 1))) (not (= (+ i2 1) n))), 504497#(or (<= n (+ i1 4)) (not (= (+ i2 1) n))), 504489#(or (not (< i2 n)) (<= (+ i2 1) i1)), 504483#(or (<= n (+ 3 i1)) (not (= i2 n))), 504473#(not (= n (+ 6 i1))), 504508#(or (not (= n (+ 3 i2))) (not (= n (+ 6 i1)))), 504454#(not (= n (+ i1 1))), 504465#(or (not (= n (+ 3 i1))) (not (= i2 n))), 504462#(or (not (= n (+ 2 i1))) (not (= n (+ 2 i2)))), 504457#(or (not (= n (+ i1 1))) (not (= n (+ 2 i2)))), 504471#(or (not (= (+ i1 4) n)) (not (= (+ i2 1) n))), 504446#(not (= n (+ 2 i2))), 504453#(or (<= n (+ i2 1)) (<= (+ 6 i2) n)), 504499#(or (<= n (+ i2 1)) (<= (+ 5 i2) i1)), 504478#(or (not (= n (+ 2 i2))) (not (= n (+ 5 i1)))), 504484#(or (not (= n (+ 3 i1))) (not (= n (+ 3 i2)))), 504490#(or (not (= n (+ 5 i1))) (not (= n (+ 3 i2)))), 504449#(or (not (= i1 n)) (not (= n (+ 3 i2)))), 504450#(not (= (+ i2 4) n)), 504458#(or (not (= n (+ i1 1))) (not (= n (+ 3 i2)))), 504510#(or (<= n (+ 5 i1)) (not (= (+ i2 1) n))), 504475#(or (not (= n (+ 6 i1))) (not (= (+ i2 1) n))), 504474#(or (not (= i2 n)) (not (= n (+ 6 i1)))), 504467#(or (not (= (+ i1 4) n)) (not (= i2 n))), 504504#(or (not (= (+ i2 4) n)) (not (= (+ i1 4) n))), 504509#(or (<= n (+ 5 i1)) (not (= i2 n))), 504452#(or (<= (+ 5 i2) n) (not (< i2 n))), 504495#(or (<= n (+ 3 i1)) (not (= (+ i2 1) n))), 504451#(or (not (= (+ i2 4) n)) (not (= i1 n))), 504505#(or (<= n (+ i2 1)) (<= (+ 2 i2) i1)), 504507#(or (<= n (+ i2 1)) (<= (+ i2 1) i1)), 504444#(or (not (= i1 n)) (not (= i2 n))), 504493#(or (<= n (+ i1 1)) (not (= (+ i2 1) n))), 504459#(not (= n (+ 2 i1))), 504511#(or (not (= (+ i2 4) n)) (not (= n (+ 6 i1)))), 504506#(or (not (= (+ i2 4) n)) (not (= n (+ 5 i1)))), 504485#(or (not (= (+ i1 4) n)) (not (= n (+ 3 i2)))), 504447#(or (not (= i1 n)) (not (= n (+ 2 i2)))), 504486#(or (<= (+ i2 4) i1) (not (< i2 n))), 504498#(or (not (= (+ i2 4) n)) (not (= n (+ i1 1)))), 504476#(or (not (= n (+ 3 i1))) (not (= n (+ 2 i2)))), 504494#(or (<= n (+ 2 i1)) (not (= (+ i2 1) n))), 504470#(or (not (= n (+ 3 i1))) (not (= (+ i2 1) n))), 504468#(not (= n (+ 5 i1))), 504487#(or (not (< i2 n)) (<= (+ 3 i2) i1)), 504464#(not (= n (+ 3 i1))), 504500#(or (not (= (+ i2 4) n)) (not (= n (+ 2 i1)))), 504482#(or (<= n (+ 2 i1)) (not (= i2 n))), 504503#(or (<= n (+ i2 1)) (<= (+ 3 i2) i1)), 504460#(or (not (= n (+ 2 i1))) (not (= i2 n))), 504443#(not (= i1 n)), 504480#(or (<= n i1) (not (= i2 n))), 504488#(or (not (< i2 n)) (<= (+ 2 i2) i1)), 504491#(or (not (< i2 n)) (<= i2 i1)), 504472#(or (not (= n (+ 5 i1))) (not (= (+ i2 1) n)))] [2022-03-15 21:30:36,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-03-15 21:30:36,478 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:30:36,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-03-15 21:30:36,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1002, Invalid=5970, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 21:30:36,479 INFO L87 Difference]: Start difference. First operand 26576 states and 124270 transitions. Second operand has 80 states, 80 states have (on average 6.2125) internal successors, (497), 79 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) [2022-03-15 21:30:44,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:30:44,760 INFO L93 Difference]: Finished difference Result 45313 states and 202762 transitions. [2022-03-15 21:30:44,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2022-03-15 21:30:44,760 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 6.2125) internal successors, (497), 79 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) Word has length 32 [2022-03-15 21:30:44,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:30:44,929 INFO L225 Difference]: With dead ends: 45313 [2022-03-15 21:30:44,929 INFO L226 Difference]: Without dead ends: 44461 [2022-03-15 21:30:44,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 947 GetRequests, 735 SyntacticMatches, 2 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12150 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=10744, Invalid=33988, Unknown=0, NotChecked=0, Total=44732 [2022-03-15 21:30:44,931 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 6522 mSDsluCounter, 5637 mSDsCounter, 0 mSdLazyCounter, 6141 mSolverCounterSat, 1696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6522 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 7837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1696 IncrementalHoareTripleChecker+Valid, 6141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:30:44,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6522 Valid, 1537 Invalid, 7837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1696 Valid, 6141 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-03-15 21:30:44,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44461 states. [2022-03-15 21:30:45,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44461 to 31818. [2022-03-15 21:30:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31818 states, 31817 states have (on average 4.697268755696641) internal successors, (149453), 31817 states have internal predecessors, (149453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:46,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31818 states to 31818 states and 149453 transitions. [2022-03-15 21:30:46,107 INFO L78 Accepts]: Start accepts. Automaton has 31818 states and 149453 transitions. Word has length 32 [2022-03-15 21:30:46,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:30:46,107 INFO L470 AbstractCegarLoop]: Abstraction has 31818 states and 149453 transitions. [2022-03-15 21:30:46,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 6.2125) internal successors, (497), 79 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) [2022-03-15 21:30:46,108 INFO L276 IsEmpty]: Start isEmpty. Operand 31818 states and 149453 transitions. [2022-03-15 21:30:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 21:30:46,184 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:30:46,185 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:30:46,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-03-15 21:30:46,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:46,400 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:30:46,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:30:46,401 INFO L85 PathProgramCache]: Analyzing trace with hash -90487116, now seen corresponding path program 11 times [2022-03-15 21:30:46,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:30:46,402 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333777672] [2022-03-15 21:30:46,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:30:46,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:30:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:30:46,472 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:46,472 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:30:46,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333777672] [2022-03-15 21:30:46,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333777672] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:30:46,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990039037] [2022-03-15 21:30:46,473 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:30:46,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:46,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:30:46,474 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:30:46,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 21:30:46,513 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:30:46,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:30:46,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 21:30:46,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:30:46,564 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:46,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:30:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:46,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990039037] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:30:46,614 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:30:46,614 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 13 [2022-03-15 21:30:46,614 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1681685798] [2022-03-15 21:30:46,614 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:30:46,617 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:30:46,945 INFO L252 McrAutomatonBuilder]: Finished intersection with 871 states and 2502 transitions. [2022-03-15 21:30:46,945 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:30:52,965 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 47 new interpolants: [613952#(or (<= n (+ i2 4)) (not (= (+ i1 4) n))), 613930#(or (<= n i2) (not (= n (+ 2 i1)))), 613923#(not (= i1 n)), 613942#(or (<= n (+ 3 i2)) (not (= n (+ 3 i1)))), 613926#(not (= n (+ 3 i1))), 613944#(or (<= n (+ i2 4)) (not (= n (+ i1 1)))), 613961#(or (<= n (+ 2 i2)) (not (= n (+ 5 i1)))), 613960#(or (<= n (+ i2 1)) (not (= n (+ 5 i1)))), 613938#(or (<= n (+ 2 i2)) (not (= n (+ 3 i1)))), 613928#(or (<= n (+ i2 1)) (not (= i1 n))), 613933#(or (<= n (+ 2 i2)) (not (= i1 n))), 613946#(or (<= n (+ i2 4)) (not (= n (+ 3 i1)))), 613951#(or (<= n (+ 3 i2)) (not (= (+ i1 4) n))), 613925#(not (= n (+ 2 i1))), 613959#(or (<= n i2) (not (= n (+ 5 i1)))), 613937#(or (<= n (+ i2 1)) (not (= n (+ 3 i1)))), 613931#(or (not (= n (+ i1 1))) (<= n (+ i2 1))), 613934#(or (<= n (+ 2 i2)) (not (= n (+ i1 1)))), 613929#(or (<= n i2) (not (= n (+ i1 1)))), 613945#(or (<= n (+ i2 4)) (not (= n (+ 2 i1)))), 613967#(or (<= i1 (+ 2 i2)) (<= n (+ 2 i1))), 613947#(not (= (+ i1 4) n)), 613953#(or (not (= i1 n)) (<= n (+ 5 i2))), 613964#(or (<= n (+ 5 i2)) (not (= n (+ 5 i1)))), 613950#(or (<= n (+ 2 i2)) (not (= (+ i1 4) n))), 613956#(or (<= n (+ 5 i2)) (not (= n (+ 3 i1)))), 613943#(or (<= n (+ i2 4)) (not (= i1 n))), 613927#(or (<= n i2) (not (= i1 n))), 613965#(or (not (< i1 n)) (<= i1 (+ i2 4))), 613935#(or (<= n (+ 2 i2)) (not (= n (+ 2 i1)))), 613936#(or (<= n i2) (not (= n (+ 3 i1)))), 613969#(or (<= i1 i2) (<= n (+ i1 4))), 613955#(or (not (= n (+ 2 i1))) (<= n (+ 5 i2))), 613957#(or (<= n (+ 5 i2)) (not (= (+ i1 4) n))), 613963#(or (<= n (+ i2 4)) (not (= n (+ 5 i1)))), 613958#(not (= n (+ 5 i1))), 613949#(or (<= n (+ i2 1)) (not (= (+ i1 4) n))), 613924#(not (= n (+ i1 1))), 613948#(or (<= n i2) (not (= (+ i1 4) n))), 613962#(or (<= n (+ 3 i2)) (not (= n (+ 5 i1)))), 613941#(or (<= n (+ 3 i2)) (not (= n (+ 2 i1)))), 613968#(or (<= n (+ 3 i1)) (<= i1 (+ i2 1))), 613940#(or (<= n (+ 3 i2)) (not (= n (+ i1 1)))), 613932#(or (<= n (+ i2 1)) (not (= n (+ 2 i1)))), 613966#(or (<= i1 (+ 3 i2)) (<= n (+ i1 1))), 613939#(or (<= n (+ 3 i2)) (not (= i1 n))), 613954#(or (not (= n (+ i1 1))) (<= n (+ 5 i2)))] [2022-03-15 21:30:52,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 21:30:52,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:30:52,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 21:30:52,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=3153, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 21:30:52,966 INFO L87 Difference]: Start difference. First operand 31818 states and 149453 transitions. Second operand has 61 states, 61 states have (on average 6.524590163934426) internal successors, (398), 60 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) [2022-03-15 21:31:07,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:07,760 INFO L93 Difference]: Finished difference Result 100240 states and 458013 transitions. [2022-03-15 21:31:07,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 298 states. [2022-03-15 21:31:07,760 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 6.524590163934426) internal successors, (398), 60 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) Word has length 33 [2022-03-15 21:31:07,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:08,474 INFO L225 Difference]: With dead ends: 100240 [2022-03-15 21:31:08,475 INFO L226 Difference]: Without dead ends: 93227 [2022-03-15 21:31:08,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1203 GetRequests, 854 SyntacticMatches, 1 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53179 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=39795, Invalid=82355, Unknown=0, NotChecked=0, Total=122150 [2022-03-15 21:31:08,479 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 6799 mSDsluCounter, 3518 mSDsCounter, 0 mSdLazyCounter, 3768 mSolverCounterSat, 1850 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6799 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 5618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1850 IncrementalHoareTripleChecker+Valid, 3768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:08,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6799 Valid, 987 Invalid, 5618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1850 Valid, 3768 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 21:31:08,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93227 states. [2022-03-15 21:31:10,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93227 to 43326. [2022-03-15 21:31:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43326 states, 43325 states have (on average 4.732071552221581) internal successors, (205017), 43325 states have internal predecessors, (205017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43326 states to 43326 states and 205017 transitions. [2022-03-15 21:31:11,196 INFO L78 Accepts]: Start accepts. Automaton has 43326 states and 205017 transitions. Word has length 33 [2022-03-15 21:31:11,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:11,197 INFO L470 AbstractCegarLoop]: Abstraction has 43326 states and 205017 transitions. [2022-03-15 21:31:11,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 6.524590163934426) internal successors, (398), 60 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) [2022-03-15 21:31:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 43326 states and 205017 transitions. [2022-03-15 21:31:11,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 21:31:11,298 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:11,298 INFO L514 BasicCegarLoop]: trace histogram [7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:11,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 21:31:11,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:11,500 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:31:11,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:11,500 INFO L85 PathProgramCache]: Analyzing trace with hash -324196999, now seen corresponding path program 8 times [2022-03-15 21:31:11,501 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:11,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375881332] [2022-03-15 21:31:11,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:11,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:11,725 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:11,726 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:11,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375881332] [2022-03-15 21:31:11,726 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375881332] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:31:11,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245853793] [2022-03-15 21:31:11,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:31:11,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:11,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:31:11,727 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:31:11,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 21:31:11,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:31:11,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:31:11,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 21:31:11,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:31:11,823 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:11,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:31:11,896 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:11,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245853793] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:31:11,897 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:31:11,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 20 [2022-03-15 21:31:11,897 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [614066958] [2022-03-15 21:31:11,897 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:11,900 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:12,061 INFO L252 McrAutomatonBuilder]: Finished intersection with 853 states and 2442 transitions. [2022-03-15 21:31:12,062 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:20,680 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 45 new interpolants: [801661#(not (= n (+ 3 i2))), 801686#(or (<= n (+ 2 i1)) (not (= n (+ 3 i2)))), 801695#(or (not (= (+ i2 4) n)) (<= n (+ i1 4))), 801599#(<= n (+ 6 i1)), 801653#(not (= i2 n)), 801692#(or (not (= (+ i2 4) n)) (<= n (+ i1 1))), 801670#(or (<= (+ n 1) i1) (not (= (+ i2 1) n))), 801685#(or (not (= n (+ 3 i2))) (<= n (+ i1 1))), 801672#(or (<= n (+ i1 1)) (not (= (+ i2 1) n))), 801654#(or (<= (+ 3 n) i1) (not (= i2 n))), 801677#(or (not (= n (+ 2 i2))) (<= n i1)), 801684#(or (<= n i1) (not (= n (+ 3 i2)))), 801666#(or (not (= (+ i2 4) n)) (<= (+ 3 n) i1)), 801691#(or (not (= (+ i2 4) n)) (<= n i1)), 801671#(or (<= n i1) (not (= (+ i2 1) n))), 801595#(<= n (+ 5 i1)), 801687#(or (<= n (+ 3 i1)) (not (= n (+ 3 i2)))), 801680#(or (<= n (+ 3 i1)) (not (= n (+ 2 i2)))), 801678#(or (not (= n (+ 2 i2))) (<= n (+ i1 1))), 801663#(or (<= (+ 3 n) i1) (not (= (+ i2 1) n))), 801682#(or (not (= n (+ 3 i2))) (<= (+ 2 n) i1)), 801693#(or (not (= (+ i2 4) n)) (<= n (+ 2 i1))), 801675#(or (not (= n (+ 2 i2))) (<= (+ 2 n) i1)), 801668#(or (<= n (+ 3 i1)) (not (= i2 n))), 801665#(or (<= (+ 3 n) i1) (not (= n (+ 3 i2)))), 801689#(or (not (= (+ i2 4) n)) (<= (+ 2 n) i1)), 801674#(or (<= n (+ 3 i1)) (not (= (+ i2 1) n))), 801690#(or (not (= (+ i2 4) n)) (<= (+ n 1) i1)), 801662#(not (= (+ i2 4) n)), 801655#(or (not (= i2 n)) (<= (+ 2 n) i1)), 801664#(or (<= (+ 3 n) i1) (not (= n (+ 2 i2)))), 801667#(or (<= n (+ 2 i1)) (not (= i2 n))), 801688#(or (<= i2 (+ i1 1)) (not (= n (+ 3 i2)))), 801660#(not (= n (+ 2 i2))), 801659#(not (= (+ i2 1) n)), 801694#(or (not (= (+ i2 4) n)) (<= n (+ 3 i1))), 801676#(or (<= (+ n 1) i1) (not (= n (+ 2 i2)))), 801679#(or (not (= n (+ 2 i2))) (<= n (+ 2 i1))), 801657#(or (<= n i1) (not (= i2 n))), 801681#(or (not (= n (+ 2 i2))) (<= i2 (+ 2 i1))), 801669#(or (<= (+ 2 n) i1) (not (= (+ i2 1) n))), 801658#(or (not (= i2 n)) (<= n (+ i1 1))), 801683#(or (<= (+ n 1) i1) (not (= n (+ 3 i2)))), 801673#(or (<= n (+ 2 i1)) (not (= (+ i2 1) n))), 801656#(or (<= (+ n 1) i1) (not (= i2 n)))] [2022-03-15 21:31:20,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 21:31:20,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:20,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 21:31:20,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=586, Invalid=3446, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 21:31:20,681 INFO L87 Difference]: Start difference. First operand 43326 states and 205017 transitions. Second operand has 60 states, 60 states have (on average 6.666666666666667) internal successors, (400), 59 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) [2022-03-15 21:31:27,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:27,922 INFO L93 Difference]: Finished difference Result 152360 states and 697230 transitions. [2022-03-15 21:31:27,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2022-03-15 21:31:27,922 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 6.666666666666667) internal successors, (400), 59 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) Word has length 33 [2022-03-15 21:31:27,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:28,834 INFO L225 Difference]: With dead ends: 152360 [2022-03-15 21:31:28,834 INFO L226 Difference]: Without dead ends: 151167 [2022-03-15 21:31:28,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1027 GetRequests, 817 SyntacticMatches, 18 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12495 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=10384, Invalid=27058, Unknown=0, NotChecked=0, Total=37442 [2022-03-15 21:31:28,836 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 1559 mSDsluCounter, 4072 mSDsCounter, 0 mSdLazyCounter, 4778 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 5124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 4778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:28,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1559 Valid, 1003 Invalid, 5124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 4778 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 21:31:29,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151167 states. [2022-03-15 21:31:31,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151167 to 58233. [2022-03-15 21:31:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58233 states, 58232 states have (on average 4.722386316801758) internal successors, (274994), 58232 states have internal predecessors, (274994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:32,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58233 states to 58233 states and 274994 transitions. [2022-03-15 21:31:32,307 INFO L78 Accepts]: Start accepts. Automaton has 58233 states and 274994 transitions. Word has length 33 [2022-03-15 21:31:32,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:32,308 INFO L470 AbstractCegarLoop]: Abstraction has 58233 states and 274994 transitions. [2022-03-15 21:31:32,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 6.666666666666667) internal successors, (400), 59 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) [2022-03-15 21:31:32,308 INFO L276 IsEmpty]: Start isEmpty. Operand 58233 states and 274994 transitions. [2022-03-15 21:31:32,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 21:31:32,467 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:32,467 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:32,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-03-15 21:31:32,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 21:31:32,668 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err4INUSE_VIOLATION, thread1Err6INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:31:32,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:32,668 INFO L85 PathProgramCache]: Analyzing trace with hash 803411579, now seen corresponding path program 12 times [2022-03-15 21:31:32,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:32,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752171026] [2022-03-15 21:31:32,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:32,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:33,207 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:33,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:33,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752171026] [2022-03-15 21:31:33,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752171026] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:31:33,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719568454] [2022-03-15 21:31:33,207 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:31:33,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:33,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:31:33,208 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:31:33,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 21:31:33,251 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:31:33,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:31:33,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 89 conjunts are in the unsatisfiable core [2022-03-15 21:31:33,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:31:34,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:31:34,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:31:34,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:31:34,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:31:34,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:31:34,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:31:34,175 INFO L353 Elim1Store]: treesize reduction 40, result has 83.1 percent of original size [2022-03-15 21:31:34,175 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 89 treesize of output 241 [2022-03-15 21:31:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:35,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:31:36,442 INFO L353 Elim1Store]: treesize reduction 184, result has 45.4 percent of original size [2022-03-15 21:31:36,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 47 treesize of output 168 [2022-03-15 21:31:36,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:31:36,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:31:36,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:31:36,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:31:36,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:31:36,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:31:36,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:31:36,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:31:36,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:31:36,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:31:36,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:31:36,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:31:36,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:31:36,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:31:36,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:31:36,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:31:36,903 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 7 [2022-03-15 21:31:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:36,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719568454] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:31:36,955 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:31:36,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 46 [2022-03-15 21:31:36,955 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [4024198] [2022-03-15 21:31:36,955 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:36,958 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:37,210 INFO L252 McrAutomatonBuilder]: Finished intersection with 964 states and 2792 transitions. [2022-03-15 21:31:37,211 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:32:21,646 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 79 new interpolants: [1071047#(and (or (< x2 (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 6 i1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)) (select x (+ 5 i1)))) (not (= n (+ 6 i1)))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 6 i1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) x2) (not (= n (+ 6 i1))))), 1071069#(and (or (not (= n (+ 5 i1))) (< (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)) (select x (+ 5 i1)))) (not (= (+ i2 1) n))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ s12 s22 (select x (+ i2 1)))) (not (= n (+ 5 i1))) (not (= (+ i2 1) n)))), 1071096#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x (+ n (- 5))) (select x n) (select x (+ (- 2) n)))) (not (= (+ i1 4) n))) (or (<= (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x (+ n (- 5))) (select x n) (select x (+ (- 2) n))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)))) (not (= (+ i1 4) n)))), 1071073#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 2 i2))) (not (= n (+ 5 i1)))) (or (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1)))) (not (= n (+ 2 i2))) (not (= n (+ 5 i1))))), 1071048#(and (or (< (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 6 i1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)) (select x (+ 5 i1)))) (not (= n (+ 6 i1)))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 6 i1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ s12 s22)) (not (= n (+ 6 i1))))), 1071074#(and (or (not (= n (+ 2 i2))) (not (= n (+ 6 i1))) (< (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 6 i1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)) (select x (+ 5 i1))))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 6 i1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 2 i2))) (not (= n (+ 6 i1))))), 1071099#(and (or (not (= n (+ 5 i2))) (not (= n (+ 5 i1))) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))))) (or (not (= n (+ 5 i2))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 5 i1))))), 1071029#(and (or (not (= i1 n)) (<= (+ s11 s21) x2)) (or (< x2 (+ s11 s21 1)) (not (= i1 n)))), 1071055#(and (or (not (= i1 n)) (not (= n (+ 2 i2))) (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21))) (or (not (= i1 n)) (<= (+ s11 s21) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 2 i2))))), 1071085#(and (or (not (= n (+ 3 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 3 i2)))) (or (not (= n (+ 3 i1))) (not (= n (+ 3 i2))) (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))))), 1071081#(and (or (not (= n (+ i1 1))) (<= (+ 7 i2) n) (<= n (+ 5 i2)) (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22 (select x (+ (- 1) n)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n))))) (or (not (= n (+ i1 1))) (<= (+ 7 i2) n) (<= n (+ 5 i2)) (<= (+ s12 s22 (select x (+ (- 1) n)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n))) (+ s11 s21 (select x (+ i1 1)))))), 1071044#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ s12 s22)) (not (= (+ i1 4) n)) (not (= i2 n))) (or (< (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)))) (not (= (+ i1 4) n)) (not (= i2 n)))), 1071066#(and (or (not (= (+ i2 4) n)) (not (= n (+ 2 i1))) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))))) (or (not (= (+ i2 4) n)) (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))))), 1071079#(and (or (<= (+ s12 s22 (select x (+ (- 1) n)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n))) (+ s11 s21)) (<= (+ 7 i2) n) (not (= i1 n)) (<= n (+ 5 i2))) (or (<= (+ s11 s21) (+ s12 s22 (select x (+ (- 1) n)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n)))) (<= (+ 7 i2) n) (not (= i1 n)) (<= n (+ 5 i2)))), 1071101#(and (or (not (= n (+ 5 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x (+ n (- 5))) (select x n) (select x (+ (- 2) n))))) (or (<= (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x (+ n (- 5))) (select x n) (select x (+ (- 2) n))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1)))) (not (= n (+ 5 i1))))), 1071058#(and (or (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ i1 1))) (not (= n (+ 2 i2)))) (or (not (= n (+ i1 1))) (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ 2 i2))))), 1071036#(and (or (not (= n (+ 2 i1))) (< x2 (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) 1))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) x2) (not (= n (+ 2 i1))))), 1071046#(and (or (not (= n (+ 5 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ s12 s22))) (or (not (= n (+ 5 i1))) (< (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)) (select x (+ 5 i1)))))), 1071083#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22 (select x (+ (- 1) n)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n)))) (<= (+ 7 i2) n) (not (= n (+ 2 i1))) (<= n (+ 5 i2))) (or (<= (+ s12 s22 (select x (+ (- 1) n)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))) (<= (+ 7 i2) n) (not (= n (+ 2 i1))) (<= n (+ 5 i2)))), 1071039#(and (or (< x2 (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) 1 (select x (+ 3 i1)))) (not (= n (+ 3 i1)))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) x2) (not (= n (+ 3 i1))))), 1071087#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 5 i2))) (not (= n (+ 3 i1)))) (or (not (= n (+ 5 i2))) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))) (not (= n (+ 3 i1))))), 1071095#(and (or (not (= n (+ 3 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x (+ n (- 5))) (select x n) (select x (+ (- 2) n))))) (or (not (= n (+ 3 i1))) (<= (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x (+ n (- 5))) (select x n) (select x (+ (- 2) n))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))))), 1071037#(and (or (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22))) (or (not (= n (+ 2 i1))) (<= (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))))), 1071102#(and (or (not (= n (+ 3 i2))) (< (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 6 i1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)) (select x (+ 5 i1)))) (not (= n (+ 6 i1)))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 6 i1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 3 i2))) (not (= n (+ 6 i1))))), 1071078#(and (or (<= (+ 7 i2) n) (<= n (+ 5 i2)) (<= (+ s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n))) (+ s11 s21))) (or (<= (+ s11 s21) (+ s12 s22 (select x (+ (- 1) n)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n)))) (<= (+ 7 i2) n) (<= n (+ 5 i2)))), 1071031#(and (or (not (= i2 n)) (<= (+ s11 s21) (+ s12 s22))) (or (<= (+ s12 s22) (+ s11 s21)) (not (= i2 n)))), 1071093#(and (or (not (= n (+ i1 1))) (<= (+ s11 s21 (select x (+ i1 1))) (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x (+ n (- 5))) (select x n) (select x (+ (- 2) n))))) (or (not (= n (+ i1 1))) (<= (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x (+ n (- 5))) (select x n) (select x (+ (- 2) n))) (+ s11 s21 (select x (+ i1 1)))))), 1071088#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= (+ i1 4) n)) (not (= n (+ 3 i2)))) (or (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)))) (not (= (+ i1 4) n)) (not (= n (+ 3 i2))))), 1071045#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) x2) (not (= n (+ 5 i1)))) (or (< x2 (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)) (select x (+ 5 i1)))) (not (= n (+ 5 i1))))), 1071076#(and (or (<= n (+ i2 4)) (not (= i1 n)) (<= (+ 6 i2) n) (<= (+ s11 s21) (+ s12 s22 (select x (+ (- 1) n)) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n))))) (or (<= n (+ i2 4)) (not (= i1 n)) (<= (+ 6 i2) n) (<= (+ s12 s22 (select x (+ (- 1) n)) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n))) (+ s11 s21)))), 1071041#(and (or (not (= n (+ 3 i1))) (not (= i2 n)) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22))) (or (not (= n (+ 3 i1))) (< (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) 1 (select x (+ 3 i1)))) (not (= i2 n)))), 1071034#(and (or (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22)) (not (= n (+ i1 1)))) (or (<= (+ s12 s22) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1))))), 1071052#(and (or (not (= n (+ 2 i2))) (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21))) (or (<= (+ s11 s21) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 2 i2))))), 1071032#(and (or (<= (+ s12 s22) (+ s11 s21)) (not (= i1 n)) (not (= i2 n))) (or (not (= i1 n)) (not (= i2 n)) (<= (+ s11 s21) (+ s12 s22)))), 1071091#(and (or (not (= n (+ 3 i1))) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ 6 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))) (not (= n (+ 6 i2)))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ 6 i2)) (select x (+ i2 1)))) (not (= n (+ 3 i1))) (not (= n (+ 6 i2))))), 1071100#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ 6 i2)) (select x (+ i2 1)))) (not (= n (+ 5 i1))) (not (= n (+ 6 i2)))) (or (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ 6 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1)))) (not (= n (+ 5 i1))) (not (= n (+ 6 i2))))), 1071054#(and (or (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21)) (not (= i1 n)) (not (= (+ i2 1) n))) (or (<= (+ s11 s21) (+ s12 s22 (select x (+ i2 1)))) (not (= i1 n)) (not (= (+ i2 1) n)))), 1071080#(and (or (not (= n (+ 5 i2))) (not (= n (+ i1 1))) (<= (+ s11 s21 (select x (+ i1 1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))))) (or (not (= n (+ 5 i2))) (not (= n (+ i1 1))) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ i1 1)))))), 1071061#(and (or (not (= (+ i2 4) n)) (not (= i1 n)) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21))) (or (not (= (+ i2 4) n)) (not (= i1 n)) (<= (+ s11 s21) (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))))), 1071065#(and (or (not (= n (+ 2 i1))) (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))) (not (= n (+ 3 i2)))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 2 i1))) (not (= n (+ 3 i2))))), 1071086#(and (or (not (= (+ i2 4) n)) (not (= n (+ 3 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))))) (or (not (= (+ i2 4) n)) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))) (not (= n (+ 3 i1))))), 1071043#(and (or (< (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)))) (not (= (+ i1 4) n))) (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ s12 s22)) (not (= (+ i1 4) n)))), 1071064#(and (or (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))) (not (= n (+ 2 i1))) (not (= n (+ 2 i2)))) (or (not (= n (+ 2 i1))) (not (= n (+ 2 i2))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))))), 1071067#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ i2 1)))) (not (= n (+ 3 i1))) (not (= (+ i2 1) n))) (or (not (= n (+ 3 i1))) (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))) (not (= (+ i2 1) n)))), 1071059#(and (or (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1))) (not (= n (+ 3 i2)))) (or (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ i1 1))) (not (= n (+ 3 i2))))), 1071060#(and (or (<= (+ 5 i2) n) (<= n (+ 3 i2)) (<= (+ s11 s21) (+ s12 s22 (select x (+ (- 1) n)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n))))) (or (<= (+ 5 i2) n) (<= (+ s12 s22 (select x (+ (- 1) n)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n))) (+ s11 s21)) (<= n (+ 3 i2)))), 1071072#(and (or (not (= n (+ 2 i2))) (not (= (+ i1 4) n)) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))))) (or (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)))) (not (= n (+ 2 i2))) (not (= (+ i1 4) n)))), 1071094#(and (or (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x (+ n (- 5))) (select x n) (select x (+ (- 2) n))))) (or (not (= n (+ 2 i1))) (<= (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x (+ n (- 5))) (select x n) (select x (+ (- 2) n))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))))), 1071084#(and (or (not (= i1 n)) (<= (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x (+ n (- 5))) (select x n) (select x (+ (- 2) n))) (+ s11 s21))) (or (not (= i1 n)) (<= (+ s11 s21) (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x (+ n (- 5))) (select x n) (select x (+ (- 2) n)))))), 1071082#(and (or (not (= n (+ 5 i2))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 2 i1)))) (or (not (= n (+ 5 i2))) (not (= n (+ 2 i1))) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))))), 1071040#(and (or (not (= n (+ 3 i1))) (< (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) 1 (select x (+ 3 i1))))) (or (not (= n (+ 3 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22)))), 1071049#(and (or (not (= n (+ 5 i1))) (not (= i2 n)) (< (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)) (select x (+ 5 i1))))) (or (not (= n (+ 5 i1))) (not (= i2 n)) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ s12 s22)))), 1071057#(and (or (not (= n (+ i1 1))) (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ i1 1)))) (not (= (+ i2 1) n))) (or (not (= n (+ i1 1))) (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22 (select x (+ i2 1)))) (not (= (+ i2 1) n)))), 1071035#(and (or (<= (+ s12 s22) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1))) (not (= i2 n))) (or (<= (+ s11 s21 (select x (+ i1 1))) (+ s12 s22)) (not (= n (+ i1 1))) (not (= i2 n)))), 1071098#(and (or (not (= (+ i2 4) n)) (not (= n (+ 5 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))))) (or (not (= (+ i2 4) n)) (not (= n (+ 5 i1))) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1)))))), 1071038#(and (or (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22)) (not (= i2 n))) (or (not (= n (+ 2 i1))) (not (= i2 n)) (<= (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))))), 1071033#(and (or (<= (+ s11 s21 (select x (+ i1 1))) x2) (not (= n (+ i1 1)))) (or (not (= n (+ i1 1))) (< x2 (+ s11 s21 (select x (+ i1 1)) 1)))), 1071050#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 6 i1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ s12 s22)) (not (= i2 n)) (not (= n (+ 6 i1)))) (or (< (+ s12 s22) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 6 i1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)) (select x (+ 5 i1)))) (not (= i2 n)) (not (= n (+ 6 i1))))), 1071051#(and (or (<= (+ s11 s21) (+ s12 s22 (select x (+ i2 1)))) (not (= (+ i2 1) n))) (or (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21)) (not (= (+ i2 1) n)))), 1071063#(and (or (not (= n (+ 2 i1))) (<= (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)))) (not (= (+ i2 1) n))) (or (not (= n (+ 2 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1))) (+ s12 s22 (select x (+ i2 1)))) (not (= (+ i2 1) n)))), 1071104#(and (or (not (= n (+ 5 i2))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 6 i1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 6 i1)))) (or (not (= n (+ 5 i2))) (not (= n (+ 6 i1))) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 6 i1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1)))))), 1071053#(and (or (<= (+ s11 s21) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 3 i2)))) (or (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21)) (not (= n (+ 3 i2))))), 1071105#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 6 i1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ 6 i2)) (select x (+ i2 1)))) (not (= n (+ 6 i1))) (not (= n (+ 6 i2)))) (or (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ 6 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 6 i1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1)))) (not (= n (+ 6 i1))) (not (= n (+ 6 i2))))), 1071089#(and (or (not (= (+ i2 4) n)) (not (= (+ i1 4) n)) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))))) (or (not (= (+ i2 4) n)) (not (= (+ i1 4) n)) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))))), 1071092#(and (or (not (= (+ i1 4) n)) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ 6 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)))) (not (= n (+ 6 i2)))) (or (not (= (+ i1 4) n)) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ 6 i2)) (select x (+ i2 1)))) (not (= n (+ 6 i2))))), 1071106#(and (or (not (= n (+ 6 i1))) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 6 i1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x (+ n (- 5))) (select x n) (select x (+ (- 2) n))))) (or (<= (+ (select x (+ n (- 4))) s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x (+ n (- 5))) (select x n) (select x (+ (- 2) n))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 6 i1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1)))) (not (= n (+ 6 i1))))), 1071056#(and (or (<= (+ s11 s21) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= i1 n)) (not (= n (+ 3 i2)))) (or (not (= i1 n)) (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21)) (not (= n (+ 3 i2))))), 1071030#(and (or (not (= i1 n)) (<= (+ s11 s21) (+ s12 s22))) (or (<= (+ s12 s22) (+ s11 s21)) (not (= i1 n)))), 1071097#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 5 i1))) (not (= n (+ 3 i2)))) (or (<= (+ s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1)))) (not (= n (+ 5 i1))) (not (= n (+ 3 i2))))), 1071103#(and (or (not (= (+ i2 4) n)) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 6 i1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 6 i1)))) (or (not (= (+ i2 4) n)) (< (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 6 i1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)) (select x (+ 5 i1)))) (not (= n (+ 6 i1))))), 1071071#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1)))) (not (= n (+ 3 i1))) (not (= n (+ 2 i2)))) (or (<= (+ s12 s22 (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 3 i1)))) (not (= n (+ 3 i1))) (not (= n (+ 2 i2))))), 1071075#(and (or (<= n (+ i2 4)) (<= (+ 6 i2) n) (<= (+ s12 s22 (select x (+ (- 1) n)) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n))) (+ s11 s21))) (or (<= n (+ i2 4)) (<= (+ 6 i2) n) (<= (+ s11 s21) (+ s12 s22 (select x (+ (- 1) n)) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n)))))), 1071077#(and (or (<= x1 (+ s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n)))) (<= (+ 7 i2) n) (<= n (+ 5 i2))) (or (<= (+ s12 s22 (select x (+ (- 1) n)) (select x (+ n (- 3))) (select x (+ 2 i2)) (select x (+ i2 1)) (select x n) (select x (+ (- 2) n))) x1) (<= (+ 7 i2) n) (<= n (+ 5 i2)))), 1071062#(and (or (not (= (+ i2 4) n)) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ i1 1)))) (not (= n (+ i1 1)))) (or (not (= (+ i2 4) n)) (not (= n (+ i1 1))) (<= (+ s11 s21 (select x (+ i1 1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))))), 1071068#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ s12 s22 (select x (+ i2 1)))) (not (= (+ i1 4) n)) (not (= (+ i2 1) n))) (or (< (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)))) (not (= (+ i1 4) n)) (not (= (+ i2 1) n)))), 1071090#(and (or (not (= n (+ 5 i2))) (not (= (+ i1 4) n)) (<= (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))))) (or (not (= n (+ 5 i2))) (not (= (+ i1 4) n)) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) (+ (select x (+ i2 4)) s12 s22 (select x (+ 5 i2)) (select x (+ 3 i2)) (select x (+ 2 i2)) (select x (+ i2 1)))))), 1071070#(and (or (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 6 i1)) (select x (+ i1 4)) (select x (+ 3 i1)) (select x (+ 5 i1))) (+ s12 s22 (select x (+ i2 1)))) (not (= n (+ 6 i1))) (not (= (+ i2 1) n))) (or (< (+ s12 s22 (select x (+ i2 1))) (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ 6 i1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)) (select x (+ 5 i1)))) (not (= n (+ 6 i1))) (not (= (+ i2 1) n)))), 1071042#(and (or (< x2 (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) 1 (select x (+ 3 i1)))) (not (= (+ i1 4) n))) (or (not (= (+ i1 4) n)) (<= (+ s11 s21 (select x (+ 2 i1)) (select x (+ i1 1)) (select x (+ i1 4)) (select x (+ 3 i1))) x2))), 1071028#(and (< x2 (+ s11 s21 1)) (<= (+ s11 s21) x2))] [2022-03-15 21:32:21,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-03-15 21:32:21,647 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:32:21,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-03-15 21:32:21,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=15365, Unknown=0, NotChecked=0, Total=16002 [2022-03-15 21:32:21,648 INFO L87 Difference]: Start difference. First operand 58233 states and 274994 transitions. Second operand has 98 states, 97 states have (on average 5.752577319587629) internal successors, (558), 97 states have internal predecessors, (558), 0 states have call successors, (0), 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... [2022-03-15 21:34:47,894 WARN L244 SmtUtils]: Removed 45 from assertion stack [2022-03-15 21:34:47,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2022-03-15 21:34:47,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1155 GetRequests, 752 SyntacticMatches, 135 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22659 ImplicationChecksByTransitivity, 149.1s TimeCoverageRelationStatistics Valid=10383, Invalid=61709, Unknown=0, NotChecked=0, Total=72092 [2022-03-15 21:34:47,897 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 9657 mSDsluCounter, 11024 mSDsCounter, 0 mSdLazyCounter, 11502 mSolverCounterSat, 2633 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9657 SdHoareTripleChecker+Valid, 3363 SdHoareTripleChecker+Invalid, 14135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2633 IncrementalHoareTripleChecker+Valid, 11502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:34:47,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9657 Valid, 3363 Invalid, 14135 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2633 Valid, 11502 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2022-03-15 21:34:47,898 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (10 of 11 remaining) [2022-03-15 21:34:47,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 21:34:47,921 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 21:34:47,921 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 21:34:48,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-15 21:34:48,108 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (58233states) and FLOYD_HOARE automaton (currently 157 states, 98 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 302 for 1665ms.. [2022-03-15 21:34:48,109 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4INUSE_VIOLATION (9 of 11 remaining) [2022-03-15 21:34:48,109 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6INUSE_VIOLATION (8 of 11 remaining) [2022-03-15 21:34:48,109 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (7 of 11 remaining) [2022-03-15 21:34:48,109 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7INUSE_VIOLATION (6 of 11 remaining) [2022-03-15 21:34:48,109 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err0INUSE_VIOLATION (5 of 11 remaining) [2022-03-15 21:34:48,109 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err8INUSE_VIOLATION (4 of 11 remaining) [2022-03-15 21:34:48,109 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork1Err3INUSE_VIOLATION (3 of 11 remaining) [2022-03-15 21:34:48,109 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork1Err5INUSE_VIOLATION (2 of 11 remaining) [2022-03-15 21:34:48,109 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Thread1of1ForFork4Err1INUSE_VIOLATION (1 of 11 remaining) [2022-03-15 21:34:48,109 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Thread1of1ForFork4Err9INUSE_VIOLATION (0 of 11 remaining) [2022-03-15 21:34:48,111 INFO L732 BasicCegarLoop]: Path program histogram: [12, 8, 1, 1, 1, 1] [2022-03-15 21:34:48,112 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 21:34:48,112 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 21:34:48,114 INFO L202 PluginConnector]: Adding new model parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 09:34:48 BasicIcfg [2022-03-15 21:34:48,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 21:34:48,114 INFO L158 Benchmark]: Toolchain (without parser) took 756621.54ms. Allocated memory was 178.3MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 136.1MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-03-15 21:34:48,114 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 178.3MB. Free memory was 137.4MB in the beginning and 137.3MB in the end (delta: 72.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 21:34:48,114 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.33ms. Allocated memory is still 178.3MB. Free memory was 136.0MB in the beginning and 134.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:34:48,114 INFO L158 Benchmark]: Boogie Preprocessor took 15.40ms. Allocated memory is still 178.3MB. Free memory was 134.5MB in the beginning and 133.5MB in the end (delta: 996.3kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:34:48,114 INFO L158 Benchmark]: RCFGBuilder took 216.15ms. Allocated memory is still 178.3MB. Free memory was 133.4MB in the beginning and 122.6MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-15 21:34:48,114 INFO L158 Benchmark]: TraceAbstraction took 756367.58ms. Allocated memory was 178.3MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 122.1MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-03-15 21:34:48,115 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.09ms. Allocated memory is still 178.3MB. Free memory was 137.4MB in the beginning and 137.3MB in the end (delta: 72.6kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.33ms. Allocated memory is still 178.3MB. Free memory was 136.0MB in the beginning and 134.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.40ms. Allocated memory is still 178.3MB. Free memory was 134.5MB in the beginning and 133.5MB in the end (delta: 996.3kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 216.15ms. Allocated memory is still 178.3MB. Free memory was 133.4MB in the beginning and 122.6MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 756367.58ms. Allocated memory was 178.3MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 122.1MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 66 PlacesBefore, 56 PlacesAfterwards, 55 TransitionsBefore, 45 TransitionsAfterwards, 582 CoEnabledTransitionPairs, 2 FixpointIterations, 5 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1080 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1040, positive: 1036, positive conditional: 0, positive unconditional: 1036, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 253, positive: 251, positive conditional: 0, positive unconditional: 251, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1040, positive: 785, positive conditional: 0, positive unconditional: 785, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 253, unknown conditional: 0, unknown unconditional: 253] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 117, Positive conditional cache size: 0, Positive unconditional cache size: 117, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (58233states) and FLOYD_HOARE automaton (currently 157 states, 98 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 302 for 1665ms.. - TimeoutResultAtElement [Line: 50]: 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 (58233states) and FLOYD_HOARE automaton (currently 157 states, 98 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 302 for 1665ms.. - TimeoutResultAtElement [Line: 53]: 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 (58233states) and FLOYD_HOARE automaton (currently 157 states, 98 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 302 for 1665ms.. - TimeoutResultAtElement [Line: 102]: 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 (58233states) and FLOYD_HOARE automaton (currently 157 states, 98 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 302 for 1665ms.. - TimeoutResultAtElement [Line: 102]: 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 (58233states) and FLOYD_HOARE automaton (currently 157 states, 98 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 302 for 1665ms.. - TimeoutResultAtElement [Line: 87]: 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 (58233states) and FLOYD_HOARE automaton (currently 157 states, 98 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 302 for 1665ms.. - TimeoutResultAtElement [Line: 90]: 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 (58233states) and FLOYD_HOARE automaton (currently 157 states, 98 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 302 for 1665ms.. - TimeoutResultAtElement [Line: 50]: 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 (58233states) and FLOYD_HOARE automaton (currently 157 states, 98 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 302 for 1665ms.. - TimeoutResultAtElement [Line: 53]: 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 (58233states) and FLOYD_HOARE automaton (currently 157 states, 98 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 302 for 1665ms.. - TimeoutResultAtElement [Line: 90]: 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 (58233states) and FLOYD_HOARE automaton (currently 157 states, 98 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 302 for 1665ms.. - TimeoutResultAtElement [Line: 87]: 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 (58233states) and FLOYD_HOARE automaton (currently 157 states, 98 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 302 for 1665ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 76 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 756.3s, OverallIterations: 24, TraceHistogramMax: 7, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.8s, AutomataDifference: 517.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62705 SdHoareTripleChecker+Valid, 54.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62705 mSDsluCounter, 19386 SdHoareTripleChecker+Invalid, 45.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70436 mSDsCounter, 16001 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 79660 IncrementalHoareTripleChecker+Invalid, 95661 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16001 mSolverCounterUnsat, 748 mSDtfsCounter, 79660 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14899 GetRequests, 11242 SyntacticMatches, 624 SemanticMatches, 3032 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227504 ImplicationChecksByTransitivity, 488.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58233occurred in iteration=23, InterpolantAutomatonStates: 2050, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 257005 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 1275 NumberOfCodeBlocks, 1275 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 1812 ConstructedInterpolants, 34 QuantifiedInterpolants, 21228 SizeOfPredicates, 142 NumberOfNonLiveVariables, 3318 ConjunctsInSsa, 499 ConjunctsInUnsatCore, 66 InterpolantComputations, 3 PerfectInterpolantSequences, 497/1123 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