/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/popl20-more/buffer-series.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:56:35,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:56:35,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:56:35,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:56:35,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:56:35,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:56:35,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:56:35,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:56:35,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:56:35,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:56:35,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:56:35,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:56:35,138 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:56:35,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:56:35,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:56:35,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:56:35,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:56:35,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:56:35,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:56:35,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:56:35,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:56:35,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:56:35,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:56:35,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:56:35,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:56:35,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:56:35,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:56:35,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:56:35,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:56:35,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:56:35,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:56:35,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:56:35,161 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:56:35,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:56:35,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:56:35,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:56:35,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:56:35,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:56:35,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:56:35,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:56:35,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:56:35,165 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:56:35,187 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:56:35,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:56:35,188 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:56:35,188 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:56:35,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:56:35,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:56:35,189 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:56:35,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:56:35,189 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:56:35,189 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:56:35,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:56:35,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:56:35,190 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:56:35,190 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:56:35,190 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:56:35,190 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:56:35,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:56:35,191 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:56:35,191 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:56:35,191 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:56:35,191 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:56:35,191 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:56:35,191 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:56:35,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:56:35,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:56:35,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:56:35,192 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:56:35,192 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:56:35,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:56:35,192 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:56:35,192 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:56:35,192 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:56:35,192 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:56:35,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:56:35,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:56:35,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:56:35,400 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:56:35,400 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:56:35,401 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/buffer-series.wvr.bpl [2022-03-15 21:56:35,415 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/buffer-series.wvr.bpl' [2022-03-15 21:56:35,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:56:35,443 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:56:35,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:56:35,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:56:35,445 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:56:35,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:56:35" (1/1) ... [2022-03-15 21:56:35,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:56:35" (1/1) ... [2022-03-15 21:56:35,462 INFO L137 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:56:35,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:56:35,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:56:35,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:56:35,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:56:35,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:56:35" (1/1) ... [2022-03-15 21:56:35,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:56:35" (1/1) ... [2022-03-15 21:56:35,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:56:35" (1/1) ... [2022-03-15 21:56:35,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:56:35" (1/1) ... [2022-03-15 21:56:35,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:56:35" (1/1) ... [2022-03-15 21:56:35,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:56:35" (1/1) ... [2022-03-15 21:56:35,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:56:35" (1/1) ... [2022-03-15 21:56:35,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:56:35,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:56:35,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:56:35,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:56:35,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:56:35" (1/1) ... [2022-03-15 21:56:35,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:56:35,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:56:35,509 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:56:35,529 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:56:35,550 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:56:35,550 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:56:35,550 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:56:35,550 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:56:35,550 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:56:35,550 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:56:35,550 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:56:35,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:56:35,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:56:35,550 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 21:56:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 21:56:35,551 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 21:56:35,552 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2022-03-15 21:56:35,552 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 21:56:35,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 21:56:35,553 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:56:35,591 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:56:35,593 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:56:35,687 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:56:35,699 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:56:35,700 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 21:56:35,701 INFO L202 PluginConnector]: Adding new model buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:56:35 BoogieIcfgContainer [2022-03-15 21:56:35,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:56:35,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:56:35,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:56:35,708 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:56:35,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:56:35" (1/2) ... [2022-03-15 21:56:35,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330ebf8a and model type buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:56:35, skipping insertion in model container [2022-03-15 21:56:35,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:56:35" (2/2) ... [2022-03-15 21:56:35,713 INFO L111 eAbstractionObserver]: Analyzing ICFG buffer-series.wvr.bpl [2022-03-15 21:56:35,716 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:56:35,716 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:56:35,716 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:56:35,716 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:56:35,774 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-15 21:56:35,866 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:56:35,870 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:56:35,871 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 21:56:35,877 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:56:35,883 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 102 flow [2022-03-15 21:56:35,885 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 102 flow [2022-03-15 21:56:35,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 102 flow [2022-03-15 21:56:35,919 INFO L129 PetriNetUnfolder]: 4/31 cut-off events. [2022-03-15 21:56:35,919 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-03-15 21:56:35,922 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 53 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2022-03-15 21:56:35,924 INFO L116 LiptonReduction]: Number of co-enabled transitions 350 [2022-03-15 21:56:36,061 INFO L131 LiptonReduction]: Checked pairs total: 559 [2022-03-15 21:56:36,061 INFO L133 LiptonReduction]: Total number of compositions: 9 [2022-03-15 21:56:36,073 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 86 flow [2022-03-15 21:56:36,112 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 163 states, 162 states have (on average 3.765432098765432) internal successors, (610), 162 states have internal predecessors, (610), 0 states have call successors, (0), 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:56:36,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 162 states have (on average 3.765432098765432) internal successors, (610), 162 states have internal predecessors, (610), 0 states have call successors, (0), 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:56:36,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:56:36,125 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:36,125 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:56:36,126 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:56:36,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:36,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1791700969, now seen corresponding path program 1 times [2022-03-15 21:56:36,149 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:36,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653565134] [2022-03-15 21:56:36,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:36,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:36,259 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:56:36,260 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:36,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653565134] [2022-03-15 21:56:36,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653565134] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:56:36,260 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:56:36,260 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 21:56:36,261 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1391824829] [2022-03-15 21:56:36,262 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:36,286 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:36,319 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 98 transitions. [2022-03-15 21:56:36,319 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:56:36,887 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:56:36,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:56:36,888 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:56:36,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:56:36,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:56:36,903 INFO L87 Difference]: Start difference. First operand has 163 states, 162 states have (on average 3.765432098765432) internal successors, (610), 162 states have internal predecessors, (610), 0 states have call successors, (0), 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 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:36,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:36,951 INFO L93 Difference]: Finished difference Result 311 states and 1184 transitions. [2022-03-15 21:56:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:56:36,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 21:56:36,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:36,961 INFO L225 Difference]: With dead ends: 311 [2022-03-15 21:56:36,961 INFO L226 Difference]: Without dead ends: 296 [2022-03-15 21:56:36,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:56:36,964 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:36,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 9 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:56:36,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-03-15 21:56:36,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 221. [2022-03-15 21:56:36,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 3.8045454545454547) internal successors, (837), 220 states have internal predecessors, (837), 0 states have call successors, (0), 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:56:37,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 837 transitions. [2022-03-15 21:56:37,002 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 837 transitions. Word has length 14 [2022-03-15 21:56:37,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:56:37,002 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 837 transitions. [2022-03-15 21:56:37,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 837 transitions. [2022-03-15 21:56:37,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:56:37,004 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:37,004 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:56:37,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:56:37,005 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:56:37,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:37,005 INFO L85 PathProgramCache]: Analyzing trace with hash -237980391, now seen corresponding path program 1 times [2022-03-15 21:56:37,006 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:37,006 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097319099] [2022-03-15 21:56:37,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:37,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:37,037 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:56:37,038 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:37,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097319099] [2022-03-15 21:56:37,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097319099] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:56:37,038 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:56:37,038 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:56:37,039 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1007536731] [2022-03-15 21:56:37,039 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:37,040 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:37,048 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 196 transitions. [2022-03-15 21:56:37,048 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:56:37,970 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [1134#(or (< q1_front q1_back) (< i N)), 1135#(or (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (< i N)), 1136#(or (= q1_front q1_back) (< i N)), 1133#(< i N)] [2022-03-15 21:56:37,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:56:37,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:56:37,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:56:37,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:56:37,972 INFO L87 Difference]: Start difference. First operand 221 states and 837 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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:56:38,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:38,094 INFO L93 Difference]: Finished difference Result 443 states and 1536 transitions. [2022-03-15 21:56:38,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 21:56:38,095 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:56:38,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:38,098 INFO L225 Difference]: With dead ends: 443 [2022-03-15 21:56:38,098 INFO L226 Difference]: Without dead ends: 436 [2022-03-15 21:56:38,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:56:38,099 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 80 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:38,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 15 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:56:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-03-15 21:56:38,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 305. [2022-03-15 21:56:38,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 3.713815789473684) internal successors, (1129), 304 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:38,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 1129 transitions. [2022-03-15 21:56:38,112 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 1129 transitions. Word has length 16 [2022-03-15 21:56:38,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:56:38,113 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 1129 transitions. [2022-03-15 21:56:38,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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:56:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 1129 transitions. [2022-03-15 21:56:38,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:56:38,115 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:38,115 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:56:38,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 21:56:38,115 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:56:38,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:38,115 INFO L85 PathProgramCache]: Analyzing trace with hash 436556309, now seen corresponding path program 1 times [2022-03-15 21:56:38,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:38,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307253397] [2022-03-15 21:56:38,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:38,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:38,148 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:56:38,148 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:38,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307253397] [2022-03-15 21:56:38,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307253397] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:56:38,149 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:56:38,149 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:56:38,149 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1826976748] [2022-03-15 21:56:38,149 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:38,150 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:38,157 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 176 transitions. [2022-03-15 21:56:38,157 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:56:38,650 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2196#(< j N), 2197#(or (< j N) (= q2_back q2_front))] [2022-03-15 21:56:38,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:56:38,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:56:38,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:56:38,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 21:56:38,651 INFO L87 Difference]: Start difference. First operand 305 states and 1129 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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:56:38,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:38,729 INFO L93 Difference]: Finished difference Result 471 states and 1653 transitions. [2022-03-15 21:56:38,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:56:38,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:56:38,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:38,732 INFO L225 Difference]: With dead ends: 471 [2022-03-15 21:56:38,732 INFO L226 Difference]: Without dead ends: 455 [2022-03-15 21:56:38,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-15 21:56:38,733 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:38,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 12 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:56:38,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-03-15 21:56:38,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 430. [2022-03-15 21:56:38,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 3.6386946386946386) internal successors, (1561), 429 states have internal predecessors, (1561), 0 states have call successors, (0), 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:56:38,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1561 transitions. [2022-03-15 21:56:38,745 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1561 transitions. Word has length 16 [2022-03-15 21:56:38,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:56:38,745 INFO L470 AbstractCegarLoop]: Abstraction has 430 states and 1561 transitions. [2022-03-15 21:56:38,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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:56:38,746 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1561 transitions. [2022-03-15 21:56:38,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:56:38,748 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:38,748 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:56:38,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 21:56:38,748 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:56:38,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:38,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1538419362, now seen corresponding path program 1 times [2022-03-15 21:56:38,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:38,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16555597] [2022-03-15 21:56:38,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:38,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:56:38,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:38,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16555597] [2022-03-15 21:56:38,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16555597] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:56:38,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882610124] [2022-03-15 21:56:38,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:38,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:38,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:56:38,796 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:56:38,834 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:56:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:38,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 21:56:38,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:56:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:56:38,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:56:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:56:38,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882610124] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:56:38,955 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:56:38,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-03-15 21:56:38,955 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [528628553] [2022-03-15 21:56:38,955 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:38,956 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:38,980 INFO L252 McrAutomatonBuilder]: Finished intersection with 102 states and 236 transitions. [2022-03-15 21:56:38,980 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:56:39,358 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 8 treesize of output 6 [2022-03-15 21:56:39,460 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 8 treesize of output 6 [2022-03-15 21:56:40,014 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [3639#(< i N), 3642#(or (<= N i) (< (+ i 1) N)), 3641#(< (+ i 1) N), 3643#(or (<= (+ j 1) N) (< (+ i 1) N)), 3640#(or (<= (+ j 1) N) (< i N)), 3644#(or (<= N i) (< (+ i 1) N) (< j N))] [2022-03-15 21:56:40,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 21:56:40,015 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:56:40,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 21:56:40,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:56:40,016 INFO L87 Difference]: Start difference. First operand 430 states and 1561 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 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:56:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:40,271 INFO L93 Difference]: Finished difference Result 702 states and 2285 transitions. [2022-03-15 21:56:40,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 21:56:40,271 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:56:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:40,274 INFO L225 Difference]: With dead ends: 702 [2022-03-15 21:56:40,274 INFO L226 Difference]: Without dead ends: 621 [2022-03-15 21:56:40,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 90 SyntacticMatches, 20 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:56:40,275 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 88 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:40,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 1 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:56:40,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2022-03-15 21:56:40,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 501. [2022-03-15 21:56:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 3.466) internal successors, (1733), 500 states have internal predecessors, (1733), 0 states have call successors, (0), 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:56:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1733 transitions. [2022-03-15 21:56:40,286 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 1733 transitions. Word has length 18 [2022-03-15 21:56:40,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:56:40,287 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 1733 transitions. [2022-03-15 21:56:40,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 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:56:40,287 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 1733 transitions. [2022-03-15 21:56:40,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:56:40,288 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:40,288 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:56:40,307 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:56:40,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:40,489 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:56:40,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:40,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2081986343, now seen corresponding path program 1 times [2022-03-15 21:56:40,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:40,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097312970] [2022-03-15 21:56:40,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:40,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:40,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:56:40,510 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:40,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097312970] [2022-03-15 21:56:40,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097312970] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:56:40,510 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:56:40,510 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:56:40,510 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1420117306] [2022-03-15 21:56:40,510 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:40,512 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:40,519 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 195 transitions. [2022-03-15 21:56:40,519 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:56:40,941 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 10 treesize of output 8 [2022-03-15 21:56:41,028 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:56:41,049 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:56:41,082 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 10 treesize of output 8 [2022-03-15 21:56:41,111 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [5372#(or (<= N j) (< i N)), 5369#(< j N), 5370#(< i N), 5371#(or (< j N) (< i N))] [2022-03-15 21:56:41,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:56:41,111 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:56:41,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:56:41,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:56:41,112 INFO L87 Difference]: Start difference. First operand 501 states and 1733 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 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:56:41,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:41,271 INFO L93 Difference]: Finished difference Result 547 states and 1818 transitions. [2022-03-15 21:56:41,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 21:56:41,272 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:56:41,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:41,274 INFO L225 Difference]: With dead ends: 547 [2022-03-15 21:56:41,274 INFO L226 Difference]: Without dead ends: 532 [2022-03-15 21:56:41,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-03-15 21:56:41,275 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 91 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:41,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 1 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:56:41,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-03-15 21:56:41,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 412. [2022-03-15 21:56:41,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 3.435523114355231) internal successors, (1412), 411 states have internal predecessors, (1412), 0 states have call successors, (0), 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:56:41,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1412 transitions. [2022-03-15 21:56:41,287 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1412 transitions. Word has length 18 [2022-03-15 21:56:41,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:56:41,287 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 1412 transitions. [2022-03-15 21:56:41,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 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:56:41,287 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1412 transitions. [2022-03-15 21:56:41,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:56:41,289 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:41,289 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] [2022-03-15 21:56:41,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 21:56:41,289 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:56:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:41,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1057526178, now seen corresponding path program 1 times [2022-03-15 21:56:41,290 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:41,290 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558068537] [2022-03-15 21:56:41,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:41,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:56:41,338 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:41,338 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558068537] [2022-03-15 21:56:41,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558068537] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:56:41,338 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370492601] [2022-03-15 21:56:41,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:41,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:41,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:56:41,355 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:56:41,356 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:56:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:41,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 21:56:41,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:56:41,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:56:41,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 21:56:41,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370492601] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:56:41,420 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 21:56:41,420 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-03-15 21:56:41,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [729212674] [2022-03-15 21:56:41,421 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:41,423 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:41,440 INFO L252 McrAutomatonBuilder]: Finished intersection with 158 states and 388 transitions. [2022-03-15 21:56:41,440 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:56:41,867 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 9 treesize of output 7 [2022-03-15 21:56:42,311 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 9 treesize of output 7 [2022-03-15 21:56:42,408 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:56:42,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:56:42,409 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:56:42,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:56:42,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:56:42,409 INFO L87 Difference]: Start difference. First operand 412 states and 1412 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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:56:42,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:42,437 INFO L93 Difference]: Finished difference Result 532 states and 1840 transitions. [2022-03-15 21:56:42,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 21:56:42,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:56:42,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:42,440 INFO L225 Difference]: With dead ends: 532 [2022-03-15 21:56:42,440 INFO L226 Difference]: Without dead ends: 532 [2022-03-15 21:56:42,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:56:42,441 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:42,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 9 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:56:42,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-03-15 21:56:42,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 362. [2022-03-15 21:56:42,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 3.409972299168975) internal successors, (1231), 361 states have internal predecessors, (1231), 0 states have call successors, (0), 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:56:42,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 1231 transitions. [2022-03-15 21:56:42,450 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 1231 transitions. Word has length 20 [2022-03-15 21:56:42,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:56:42,450 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 1231 transitions. [2022-03-15 21:56:42,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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:56:42,450 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 1231 transitions. [2022-03-15 21:56:42,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:56:42,451 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:42,451 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] [2022-03-15 21:56:42,469 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:56:42,667 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,SelfDestructingSolverStorable5 [2022-03-15 21:56:42,668 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:56:42,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:42,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1968354338, now seen corresponding path program 1 times [2022-03-15 21:56:42,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:42,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380331974] [2022-03-15 21:56:42,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:42,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:56:42,704 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:42,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380331974] [2022-03-15 21:56:42,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380331974] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:56:42,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43832043] [2022-03-15 21:56:42,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:42,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:42,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:56:42,705 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:56:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:42,743 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:56:42,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 21:56:42,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:56:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:56:42,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 21:56:42,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43832043] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:56:42,785 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 21:56:42,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-03-15 21:56:42,785 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1611256223] [2022-03-15 21:56:42,785 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:42,787 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:42,813 INFO L252 McrAutomatonBuilder]: Finished intersection with 117 states and 263 transitions. [2022-03-15 21:56:42,813 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:56:43,315 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 8 treesize of output 6 [2022-03-15 21:56:43,436 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:56:43,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:56:43,437 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:56:43,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:56:43,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:56:43,437 INFO L87 Difference]: Start difference. First operand 362 states and 1231 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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:56:43,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:43,470 INFO L93 Difference]: Finished difference Result 540 states and 1842 transitions. [2022-03-15 21:56:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 21:56:43,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:56:43,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:43,473 INFO L225 Difference]: With dead ends: 540 [2022-03-15 21:56:43,473 INFO L226 Difference]: Without dead ends: 540 [2022-03-15 21:56:43,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:56:43,474 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:43,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 9 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:56:43,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-03-15 21:56:43,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 423. [2022-03-15 21:56:43,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 3.5) internal successors, (1477), 422 states have internal predecessors, (1477), 0 states have call successors, (0), 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:56:43,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1477 transitions. [2022-03-15 21:56:43,485 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1477 transitions. Word has length 20 [2022-03-15 21:56:43,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:56:43,485 INFO L470 AbstractCegarLoop]: Abstraction has 423 states and 1477 transitions. [2022-03-15 21:56:43,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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:56:43,485 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1477 transitions. [2022-03-15 21:56:43,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:56:43,486 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:43,486 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:56:43,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 21:56:43,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:43,705 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:56:43,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:43,705 INFO L85 PathProgramCache]: Analyzing trace with hash -325286663, now seen corresponding path program 2 times [2022-03-15 21:56:43,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:43,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627772274] [2022-03-15 21:56:43,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:43,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:43,754 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:56:43,754 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:43,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627772274] [2022-03-15 21:56:43,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627772274] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:56:43,754 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:56:43,755 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:56:43,755 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1255789285] [2022-03-15 21:56:43,755 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:43,756 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:43,766 INFO L252 McrAutomatonBuilder]: Finished intersection with 99 states and 224 transitions. [2022-03-15 21:56:43,766 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:56:44,221 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [9527#(<= q1_back q1_front), 9530#(and (or (not (< i N)) (< j N)) (or (< j N) (not (< q1_front q1_back)))), 9529#(and (not (< i N)) (not (< q1_front q1_back))), 9531#(and (or (= (+ (* (- 1) q1_front) q1_back) 0) (< j N)) (or (<= N i) (< j N))), 9528#(or (< j N) (<= q1_back q1_front)), 9524#(< j N), 9526#(or (< j N) (< i N)), 9525#(< i N)] [2022-03-15 21:56:44,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 21:56:44,222 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:56:44,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 21:56:44,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:56:44,223 INFO L87 Difference]: Start difference. First operand 423 states and 1477 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 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:56:44,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:44,352 INFO L93 Difference]: Finished difference Result 335 states and 1191 transitions. [2022-03-15 21:56:44,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 21:56:44,352 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:56:44,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:44,354 INFO L225 Difference]: With dead ends: 335 [2022-03-15 21:56:44,354 INFO L226 Difference]: Without dead ends: 330 [2022-03-15 21:56:44,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:56:44,354 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 135 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:44,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 1 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:56:44,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-03-15 21:56:44,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 317. [2022-03-15 21:56:44,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 3.607594936708861) internal successors, (1140), 316 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:56:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 1140 transitions. [2022-03-15 21:56:44,361 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 1140 transitions. Word has length 20 [2022-03-15 21:56:44,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:56:44,362 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 1140 transitions. [2022-03-15 21:56:44,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 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:56:44,362 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 1140 transitions. [2022-03-15 21:56:44,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:56:44,362 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:44,362 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:56:44,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 21:56:44,363 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:56:44,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:44,363 INFO L85 PathProgramCache]: Analyzing trace with hash 552255584, now seen corresponding path program 1 times [2022-03-15 21:56:44,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:44,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652367843] [2022-03-15 21:56:44,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:44,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:44,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:44,493 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:44,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652367843] [2022-03-15 21:56:44,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652367843] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:56:44,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134182426] [2022-03-15 21:56:44,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:44,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:44,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:56:44,494 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:56:44,495 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:56:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:44,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 21:56:44,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:56:44,607 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 16 treesize of output 12 [2022-03-15 21:56:44,631 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 14 treesize of output 10 [2022-03-15 21:56:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:44,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:56:44,754 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:56:44,754 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 32 treesize of output 34 [2022-03-15 21:56:44,811 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:56:44,812 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 31 treesize of output 33 [2022-03-15 21:56:44,823 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:56:44,823 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 29 treesize of output 31 [2022-03-15 21:56:44,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:44,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134182426] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:56:44,865 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:56:44,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-03-15 21:56:44,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [424218829] [2022-03-15 21:56:44,865 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:44,866 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:44,884 INFO L252 McrAutomatonBuilder]: Finished intersection with 147 states and 339 transitions. [2022-03-15 21:56:44,885 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:56:49,228 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [10670#(and (or (not (= (select q1 q1_back) (select f i))) (= q2_back q2_front)) (or (<= 0 total) (not (= (select q1 q1_back) (select f i)))) (or (not (= (select q1 q1_back) (select f i))) (= (select f j) (select q1 q1_front))) (or (<= total 0) (not (= (select q1 q1_back) (select f i))))), 10657#(and (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0)) (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)))), 10660#(and (or (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total))) (or (< q1_front q1_back) (<= (+ (select q2 q2_front) total) 0))), 10667#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) (select f i)))) (or (not (= (select q1 q1_back) (select f i))) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))))), 10662#(and (or (not (= (+ (select f j) (select q2 q2_back)) 0)) (<= (+ (select q2 q2_front) total) 0)) (or (not (= (+ (select f j) (select q2 q2_back)) 0)) (<= 0 (+ (select q2 q2_front) total)))), 10656#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1))) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0))), 10659#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (not (= (select q1 q1_back) (select f i))) (< q1_front q1_back) (<= q2_back q2_front) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) (select f i))) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front))), 10666#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) (select f i))) (< q1_front q1_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1))))), 10664#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (+ (select f j) (select q2 q2_back)) 0)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (+ (select f j) (select q2 q2_back)) 0)) (< (+ q1_front 1) q1_back) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front q1_back)))), 10661#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front q1_back)))), 10658#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 10669#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) (select f i))) (not (= (+ (select f j) (select q2 q2_back)) 0))) (or (not (= (select q1 q1_back) (select f i))) (not (= (+ (select f j) (select q2 q2_back)) 0)) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))))), 10668#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) (select f i))) (not (= (+ (select f j) (select q2 q2_back)) 0)) (< q1_front q1_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (= (+ (select f j) (select q2 q2_back)) 0)) (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1))))), 10665#(and (or (not (= (+ (select f j) (select q2 q2_back)) 0)) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front)))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (+ (select f j) (select q2 q2_back)) 0)))), 10663#(and (or (not (= (+ (select f j) (select q2 q2_back)) 0)) (< q1_front q1_back) (<= (+ (select q2 q2_front) total) 0)) (or (not (= (+ (select f j) (select q2 q2_back)) 0)) (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total)))), 10655#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back)))] [2022-03-15 21:56:49,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:56:49,228 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:56:49,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:56:49,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:56:49,229 INFO L87 Difference]: Start difference. First operand 317 states and 1140 transitions. Second operand has 24 states, 23 states have (on average 4.826086956521739) internal successors, (111), 23 states have internal predecessors, (111), 0 states have call successors, (0), 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:56:50,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:50,971 INFO L93 Difference]: Finished difference Result 1482 states and 5084 transitions. [2022-03-15 21:56:50,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 21:56:50,972 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.826086956521739) internal successors, (111), 23 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:56:50,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:50,978 INFO L225 Difference]: With dead ends: 1482 [2022-03-15 21:56:50,978 INFO L226 Difference]: Without dead ends: 1455 [2022-03-15 21:56:50,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 140 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=640, Invalid=2552, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 21:56:50,979 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 465 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:50,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [465 Valid, 52 Invalid, 1540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 21:56:50,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2022-03-15 21:56:50,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 516. [2022-03-15 21:56:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 3.7067961165048544) internal successors, (1909), 515 states have internal predecessors, (1909), 0 states have call successors, (0), 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:56:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1909 transitions. [2022-03-15 21:56:50,994 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 1909 transitions. Word has length 22 [2022-03-15 21:56:50,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:56:50,994 INFO L470 AbstractCegarLoop]: Abstraction has 516 states and 1909 transitions. [2022-03-15 21:56:50,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.826086956521739) internal successors, (111), 23 states have internal predecessors, (111), 0 states have call successors, (0), 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:56:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 1909 transitions. [2022-03-15 21:56:50,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:56:50,996 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:50,996 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:56:51,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-15 21:56:51,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:51,231 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:56:51,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:51,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1798397536, now seen corresponding path program 2 times [2022-03-15 21:56:51,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:51,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609096492] [2022-03-15 21:56:51,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:51,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:51,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:51,354 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:51,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609096492] [2022-03-15 21:56:51,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609096492] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:56:51,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147197603] [2022-03-15 21:56:51,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:56:51,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:51,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:56:51,356 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:56:51,363 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:56:51,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:56:51,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:56:51,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 21:56:51,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:56:51,453 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 16 treesize of output 12 [2022-03-15 21:56:51,483 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 19 treesize of output 15 [2022-03-15 21:56:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:51,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:56:51,569 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:56:51,569 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 32 treesize of output 34 [2022-03-15 21:56:51,643 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:56:51,643 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 31 treesize of output 33 [2022-03-15 21:56:51,647 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:56:51,647 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 29 treesize of output 31 [2022-03-15 21:56:51,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:51,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147197603] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:56:51,688 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:56:51,688 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-03-15 21:56:51,689 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [580362647] [2022-03-15 21:56:51,689 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:51,690 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:51,708 INFO L252 McrAutomatonBuilder]: Finished intersection with 150 states and 351 transitions. [2022-03-15 21:56:51,708 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:56:55,377 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [13383#(and (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (< 0 (+ total (select q1 q1_front) 1)) (not (< q1_front q1_back)))), 13389#(and (or (not (= (+ (select f j) (select q2 q2_back)) 0)) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front)))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (+ (select f j) (select q2 q2_back)) 0)))), 13387#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (not (= (select q1 q1_back) (select f i))) (< q1_front q1_back) (<= q2_back q2_front) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) (select f i))) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front))), 13388#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) (select f i)))) (or (not (= (select q1 q1_back) (select f i))) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))))), 13382#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 13386#(and (or (<= 0 (+ total (select q1 q1_front))) (not (= (select q1 q1_back) (select f i)))) (or (not (= (select q1 q1_back) (select f i))) (<= (+ total (select q1 q1_front)) 0))), 13391#(and (or (not (= (select q1 q1_back) (select f i))) (= q2_back q2_front)) (or (<= 0 total) (not (= (select q1 q1_back) (select f i)))) (or (not (= (select q1 q1_back) (select f i))) (= (select f j) (select q1 q1_front))) (or (<= total 0) (not (= (select q1 q1_back) (select f i))))), 13384#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 13385#(and (or (not (= (select q1 q1_back) (select f i))) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= (+ total (select q1 q1_front)) 0)) (or (not (= (select q1 q1_back) (select f i))) (< q1_front q1_back) (< 0 (+ total (select q1 q1_front) 1)) (not (< q1_front (+ q1_back 1))))), 13390#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) (select f i))) (not (= (+ (select f j) (select q2 q2_back)) 0))) (or (not (= (select q1 q1_back) (select f i))) (not (= (+ (select f j) (select q2 q2_back)) 0)) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front)))))] [2022-03-15 21:56:55,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 21:56:55,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:56:55,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 21:56:55,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2022-03-15 21:56:55,378 INFO L87 Difference]: Start difference. First operand 516 states and 1909 transitions. Second operand has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 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:56:56,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:56,694 INFO L93 Difference]: Finished difference Result 1668 states and 5792 transitions. [2022-03-15 21:56:56,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 21:56:56,695 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have 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:56:56,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:56,703 INFO L225 Difference]: With dead ends: 1668 [2022-03-15 21:56:56,703 INFO L226 Difference]: Without dead ends: 1650 [2022-03-15 21:56:56,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 150 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=401, Invalid=1491, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 21:56:56,704 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 426 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:56,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [426 Valid, 50 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:56:56,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2022-03-15 21:56:56,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 570. [2022-03-15 21:56:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 3.701230228471002) internal successors, (2106), 569 states have internal predecessors, (2106), 0 states have call successors, (0), 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:56:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 2106 transitions. [2022-03-15 21:56:56,724 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 2106 transitions. Word has length 22 [2022-03-15 21:56:56,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:56:56,724 INFO L470 AbstractCegarLoop]: Abstraction has 570 states and 2106 transitions. [2022-03-15 21:56:56,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 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:56:56,725 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 2106 transitions. [2022-03-15 21:56:56,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 21:56:56,726 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:56,727 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] [2022-03-15 21:56:56,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-15 21:56:56,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 21:56:56,958 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:56:56,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:56,959 INFO L85 PathProgramCache]: Analyzing trace with hash 496835682, now seen corresponding path program 3 times [2022-03-15 21:56:56,959 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:56,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030734037] [2022-03-15 21:56:56,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:56,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:57,011 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:56:57,011 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:57,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030734037] [2022-03-15 21:56:57,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030734037] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:56:57,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806261680] [2022-03-15 21:56:57,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:56:57,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:57,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:56:57,013 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:56:57,013 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:56:57,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:56:57,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:56:57,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 21:56:57,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:56:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:56:57,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:56:57,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:56:57,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806261680] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:56:57,095 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:56:57,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 6 [2022-03-15 21:56:57,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [498252556] [2022-03-15 21:56:57,096 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:57,097 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:57,123 INFO L252 McrAutomatonBuilder]: Finished intersection with 187 states and 441 transitions. [2022-03-15 21:56:57,123 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:56:58,209 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 10 treesize of output 8 [2022-03-15 21:56:58,354 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 10 treesize of output 8 [2022-03-15 21:56:58,363 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 10 treesize of output 8 [2022-03-15 21:56:58,447 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 10 treesize of output 8 [2022-03-15 21:56:58,590 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 8 treesize of output 6 [2022-03-15 21:56:58,639 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:56:58,715 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:56:58,747 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 8 treesize of output 6 [2022-03-15 21:56:58,856 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 10 treesize of output 8 [2022-03-15 21:56:58,863 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:56:58,903 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 10 treesize of output 8 [2022-03-15 21:56:58,913 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:56:58,984 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [16393#(< i N), 16391#(or (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (< i N)), 16396#(or (< i N) (<= q1_back (+ q1_front 1))), 16394#(or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= q1_back (+ q1_front 1))), 16399#(or (< (+ i 1) N) (not (< i N)) (<= q1_back q1_front)), 16398#(or (<= N i) (< (+ i 1) N) (< (+ q1_front 1) q1_back) (<= q1_back q1_front)), 16395#(or (<= q1_back q1_front) (< i N)), 16397#(or (< (+ i 1) N) (<= q1_back (+ q1_front 1))), 16392#(or (< (+ q1_front 2) q1_back) (< i N) (<= q1_back (+ q1_front 1))), 16390#(or (< q1_front q1_back) (< i N))] [2022-03-15 21:56:58,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:56:58,984 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:56:58,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:56:58,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-03-15 21:56:58,985 INFO L87 Difference]: Start difference. First operand 570 states and 2106 transitions. Second operand has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 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:56:59,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:59,243 INFO L93 Difference]: Finished difference Result 1375 states and 4977 transitions. [2022-03-15 21:56:59,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 21:56:59,244 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:56:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:59,249 INFO L225 Difference]: With dead ends: 1375 [2022-03-15 21:56:59,249 INFO L226 Difference]: Without dead ends: 1321 [2022-03-15 21:56:59,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 193 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:56:59,250 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 234 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:59,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 38 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:56:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2022-03-15 21:56:59,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 978. [2022-03-15 21:56:59,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.7645854657113613) internal successors, (3678), 977 states have internal predecessors, (3678), 0 states have call successors, (0), 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:56:59,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3678 transitions. [2022-03-15 21:56:59,272 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3678 transitions. Word has length 24 [2022-03-15 21:56:59,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:56:59,272 INFO L470 AbstractCegarLoop]: Abstraction has 978 states and 3678 transitions. [2022-03-15 21:56:59,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 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:56:59,272 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3678 transitions. [2022-03-15 21:56:59,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 21:56:59,276 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:59,276 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] [2022-03-15 21:56:59,292 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:56:59,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:59,492 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:56:59,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:59,492 INFO L85 PathProgramCache]: Analyzing trace with hash 318519198, now seen corresponding path program 4 times [2022-03-15 21:56:59,493 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:59,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136618092] [2022-03-15 21:56:59,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:59,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:59,525 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:56:59,525 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:59,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136618092] [2022-03-15 21:56:59,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136618092] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:56:59,525 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:56:59,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 21:56:59,526 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1528136325] [2022-03-15 21:56:59,526 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:59,528 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:59,548 INFO L252 McrAutomatonBuilder]: Finished intersection with 141 states and 321 transitions. [2022-03-15 21:56:59,548 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:56:59,987 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 9 treesize of output 7 [2022-03-15 21:57:00,287 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:57:00,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 21:57:00,287 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:57:00,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 21:57:00,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:57:00,288 INFO L87 Difference]: Start difference. First operand 978 states and 3678 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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:57:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:57:00,340 INFO L93 Difference]: Finished difference Result 1910 states and 7125 transitions. [2022-03-15 21:57:00,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 21:57:00,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:57:00,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:57:00,362 INFO L225 Difference]: With dead ends: 1910 [2022-03-15 21:57:00,362 INFO L226 Difference]: Without dead ends: 1824 [2022-03-15 21:57:00,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:57:00,363 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:57:00,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 16 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:57:00,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2022-03-15 21:57:00,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1663. [2022-03-15 21:57:00,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1662 states have (on average 3.8333333333333335) internal successors, (6371), 1662 states have internal predecessors, (6371), 0 states have call successors, (0), 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:57:00,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 6371 transitions. [2022-03-15 21:57:00,407 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 6371 transitions. Word has length 24 [2022-03-15 21:57:00,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:57:00,407 INFO L470 AbstractCegarLoop]: Abstraction has 1663 states and 6371 transitions. [2022-03-15 21:57:00,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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:57:00,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 6371 transitions. [2022-03-15 21:57:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:57:00,411 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:57:00,411 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:57:00,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 21:57:00,411 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:57:00,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:57:00,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1806428071, now seen corresponding path program 5 times [2022-03-15 21:57:00,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:57:00,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067986205] [2022-03-15 21:57:00,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:57:00,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:57:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:57:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:57:00,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:57:00,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067986205] [2022-03-15 21:57:00,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067986205] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:57:00,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812127216] [2022-03-15 21:57:00,445 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:57:00,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:00,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:57:00,452 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:57:00,453 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:57:00,480 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:57:00,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:57:00,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:57:00,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:57:00,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:57:00,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:57:00,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:57:00,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812127216] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:57:00,591 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:57:00,591 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-03-15 21:57:00,591 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1184710308] [2022-03-15 21:57:00,592 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:57:00,594 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:57:00,644 INFO L252 McrAutomatonBuilder]: Finished intersection with 207 states and 483 transitions. [2022-03-15 21:57:00,645 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:57:01,582 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 8 treesize of output 6 [2022-03-15 21:57:01,906 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:02,060 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 8 treesize of output 6 [2022-03-15 21:57:02,100 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:02,117 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 10 treesize of output 8 [2022-03-15 21:57:02,139 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:02,163 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:02,175 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:02,197 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:02,221 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:02,254 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:02,282 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:02,300 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:02,320 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:02,335 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:02,355 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:02,458 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 8 treesize of output 6 [2022-03-15 21:57:02,461 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:02,507 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 10 treesize of output 8 [2022-03-15 21:57:02,511 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:02,540 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 10 treesize of output 8 [2022-03-15 21:57:02,564 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:02,594 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:02,802 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 8 treesize of output 6 [2022-03-15 21:57:02,842 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 8 treesize of output 6 [2022-03-15 21:57:02,847 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [25150#(or (<= N i) (< (+ i 1) N)), 25157#(or (<= N j) (<= (+ 2 j) N) (< i N)), 25159#(or (<= N j) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N)), 25148#(or (< (+ i 1) N) (< j N)), 25158#(or (<= N j) (< (+ i 1) N) (<= (+ 2 j) N)), 25156#(or (<= N j) (<= (+ 2 j) N)), 25149#(or (< (+ i 1) N) (< (+ j 1) N)), 25144#(< i N), 25147#(< (+ i 1) N), 25151#(or (<= N i) (< (+ i 1) N) (< j N)), 25155#(or (<= N (+ i 1)) (< (+ 2 i) N) (< (+ j 1) N)), 25160#(or (<= N (+ i 1)) (<= N j) (< (+ 2 i) N) (<= (+ 2 j) N)), 25154#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j N)), 25146#(or (< (+ j 1) N) (< i N)), 25152#(or (<= N i) (< (+ i 1) N) (< (+ j 1) N)), 25145#(or (< j N) (< i N)), 25153#(or (<= N (+ i 1)) (< (+ 2 i) N))] [2022-03-15 21:57:02,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:57:02,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:57:02,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:57:02,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2022-03-15 21:57:02,847 INFO L87 Difference]: Start difference. First operand 1663 states and 6371 transitions. Second operand has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 22 states have internal predecessors, (128), 0 states have call successors, (0), 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:57:03,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:57:03,563 INFO L93 Difference]: Finished difference Result 5864 states and 21821 transitions. [2022-03-15 21:57:03,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 21:57:03,564 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 22 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have 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:57:03,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:57:03,598 INFO L225 Difference]: With dead ends: 5864 [2022-03-15 21:57:03,598 INFO L226 Difference]: Without dead ends: 5105 [2022-03-15 21:57:03,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 196 SyntacticMatches, 14 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=612, Invalid=2144, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 21:57:03,600 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 446 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:57:03,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [446 Valid, 1 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:57:03,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5105 states. [2022-03-15 21:57:03,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5105 to 3666. [2022-03-15 21:57:03,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3665 states have (on average 4.072032742155526) internal successors, (14924), 3665 states have internal predecessors, (14924), 0 states have call successors, (0), 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:57:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 14924 transitions. [2022-03-15 21:57:03,762 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 14924 transitions. Word has length 26 [2022-03-15 21:57:03,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:57:03,763 INFO L470 AbstractCegarLoop]: Abstraction has 3666 states and 14924 transitions. [2022-03-15 21:57:03,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 22 states have internal predecessors, (128), 0 states have call successors, (0), 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:57:03,764 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 14924 transitions. [2022-03-15 21:57:03,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:57:03,773 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:57:03,773 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:57:03,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-15 21:57:03,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:03,987 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:57:03,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:57:03,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1789966490, now seen corresponding path program 6 times [2022-03-15 21:57:03,989 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:57:03,989 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110219658] [2022-03-15 21:57:03,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:57:03,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:57:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:57:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:57:04,031 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:57:04,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110219658] [2022-03-15 21:57:04,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110219658] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:57:04,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387098035] [2022-03-15 21:57:04,031 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:57:04,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:04,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:57:04,032 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:57:04,033 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:57:04,058 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:57:04,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:57:04,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:57:04,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:57:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:57:04,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:57:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:57:04,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387098035] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:57:04,174 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:57:04,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-03-15 21:57:04,175 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1628006744] [2022-03-15 21:57:04,175 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:57:04,177 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:57:04,198 INFO L252 McrAutomatonBuilder]: Finished intersection with 153 states and 347 transitions. [2022-03-15 21:57:04,198 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:57:04,454 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:04,616 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:04,743 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 10 treesize of output 8 [2022-03-15 21:57:04,761 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:04,781 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:04,800 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:04,834 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:04,860 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:04,880 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:05,114 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 10 treesize of output 8 [2022-03-15 21:57:05,246 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 8 treesize of output 6 [2022-03-15 21:57:05,281 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 8 treesize of output 6 [2022-03-15 21:57:05,285 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:05,341 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [38570#(< i N), 38569#(< j N), 38574#(or (< (+ i 1) N) (<= N (+ j 1))), 38572#(or (<= N j) (< i N)), 38571#(or (< j N) (< i N)), 38575#(or (<= N i) (< (+ i 1) N) (<= N (+ j 1))), 38573#(or (<= N (+ j 1)) (< i N))] [2022-03-15 21:57:05,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 21:57:05,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:57:05,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 21:57:05,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-03-15 21:57:05,342 INFO L87 Difference]: Start difference. First operand 3666 states and 14924 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 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:57:05,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:57:05,613 INFO L93 Difference]: Finished difference Result 7043 states and 28044 transitions. [2022-03-15 21:57:05,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 21:57:05,616 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have 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:57:05,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:57:05,636 INFO L225 Difference]: With dead ends: 7043 [2022-03-15 21:57:05,636 INFO L226 Difference]: Without dead ends: 6922 [2022-03-15 21:57:05,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2022-03-15 21:57:05,637 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 284 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:57:05,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 1 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:57:05,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6922 states. [2022-03-15 21:57:05,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6922 to 5647. [2022-03-15 21:57:05,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5647 states, 5646 states have (on average 4.17375132837407) internal successors, (23565), 5646 states have internal predecessors, (23565), 0 states have call successors, (0), 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:57:05,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5647 states to 5647 states and 23565 transitions. [2022-03-15 21:57:05,771 INFO L78 Accepts]: Start accepts. Automaton has 5647 states and 23565 transitions. Word has length 26 [2022-03-15 21:57:05,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:57:05,771 INFO L470 AbstractCegarLoop]: Abstraction has 5647 states and 23565 transitions. [2022-03-15 21:57:05,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 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:57:05,772 INFO L276 IsEmpty]: Start isEmpty. Operand 5647 states and 23565 transitions. [2022-03-15 21:57:05,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:57:05,785 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:57:05,785 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:57:05,801 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:57:06,001 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,SelfDestructingSolverStorable13 [2022-03-15 21:57:06,001 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:57:06,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:57:06,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1299524028, now seen corresponding path program 7 times [2022-03-15 21:57:06,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:57:06,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357374526] [2022-03-15 21:57:06,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:57:06,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:57:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:57:06,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:57:06,023 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:57:06,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357374526] [2022-03-15 21:57:06,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357374526] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:57:06,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436910606] [2022-03-15 21:57:06,024 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:57:06,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:06,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:57:06,025 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:57:06,026 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:57:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:57:06,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:57:06,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:57:06,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:57:06,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:57:06,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:57:06,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436910606] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:57:06,183 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:57:06,183 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 8 [2022-03-15 21:57:06,183 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [579050412] [2022-03-15 21:57:06,183 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:57:06,185 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:57:06,208 INFO L252 McrAutomatonBuilder]: Finished intersection with 155 states and 350 transitions. [2022-03-15 21:57:06,208 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:57:06,329 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 10 treesize of output 8 [2022-03-15 21:57:06,422 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 10 treesize of output 8 [2022-03-15 21:57:06,561 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 10 treesize of output 8 [2022-03-15 21:57:06,820 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 8 treesize of output 6 [2022-03-15 21:57:06,850 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:06,883 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:06,900 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 10 treesize of output 8 [2022-03-15 21:57:06,902 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:06,981 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [57104#(< (+ i 1) N), 57101#(or (<= N (+ j 1)) (< i N)), 57098#(or (< j N) (< i N)), 57100#(or (<= N j) (< i N)), 57103#(or (<= N j) (<= i (+ j 1))), 57106#(or (<= N i) (<= i j)), 57105#(or (< (+ i 1) N) (< j N)), 57107#(or (<= N j) (<= i j)), 57096#(< j N), 57102#(<= i (+ j 1)), 57097#(< i N), 57099#(<= N (+ j 1))] [2022-03-15 21:57:06,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 21:57:06,982 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:57:06,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 21:57:06,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2022-03-15 21:57:06,982 INFO L87 Difference]: Start difference. First operand 5647 states and 23565 transitions. Second operand has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 16 states have internal predecessors, (100), 0 states have call successors, (0), 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:57:07,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:57:07,482 INFO L93 Difference]: Finished difference Result 8726 states and 35021 transitions. [2022-03-15 21:57:07,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 21:57:07,483 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 16 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have 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:57:07,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:57:07,507 INFO L225 Difference]: With dead ends: 8726 [2022-03-15 21:57:07,507 INFO L226 Difference]: Without dead ends: 8648 [2022-03-15 21:57:07,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 21:57:07,510 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 306 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:57:07,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 1 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:57:07,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8648 states. [2022-03-15 21:57:07,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8648 to 5987. [2022-03-15 21:57:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5987 states, 5986 states have (on average 4.211159371867692) internal successors, (25208), 5986 states have internal predecessors, (25208), 0 states have call successors, (0), 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:57:07,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5987 states to 5987 states and 25208 transitions. [2022-03-15 21:57:07,723 INFO L78 Accepts]: Start accepts. Automaton has 5987 states and 25208 transitions. Word has length 26 [2022-03-15 21:57:07,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:57:07,723 INFO L470 AbstractCegarLoop]: Abstraction has 5987 states and 25208 transitions. [2022-03-15 21:57:07,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 16 states have internal predecessors, (100), 0 states have call successors, (0), 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:57:07,724 INFO L276 IsEmpty]: Start isEmpty. Operand 5987 states and 25208 transitions. [2022-03-15 21:57:07,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 21:57:07,752 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:57:07,752 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:57:07,785 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:57:07,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 21:57:07,953 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:57:07,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:57:07,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1446283875, now seen corresponding path program 8 times [2022-03-15 21:57:07,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:57:07,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035018014] [2022-03-15 21:57:07,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:57:07,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:57:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:57:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 21:57:07,979 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:57:07,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035018014] [2022-03-15 21:57:07,979 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035018014] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:57:07,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572461060] [2022-03-15 21:57:07,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:57:07,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:07,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:57:07,980 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:57:07,995 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:57:08,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:57:08,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:57:08,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:57:08,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:57:08,062 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 21:57:08,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 21:57:08,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572461060] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:57:08,062 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 21:57:08,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-03-15 21:57:08,063 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1113601463] [2022-03-15 21:57:08,063 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:57:08,066 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:57:08,116 INFO L252 McrAutomatonBuilder]: Finished intersection with 251 states and 589 transitions. [2022-03-15 21:57:08,116 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:57:09,553 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 9 treesize of output 7 [2022-03-15 21:57:09,949 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 9 treesize of output 7 [2022-03-15 21:57:10,056 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 9 treesize of output 7 [2022-03-15 21:57:10,171 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 9 treesize of output 7 [2022-03-15 21:57:10,216 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 9 treesize of output 7 [2022-03-15 21:57:10,235 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [77927#(or (<= (+ q2_front 2) q2_back) (<= q2_back q2_front))] [2022-03-15 21:57:10,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:57:10,236 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:57:10,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:57:10,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 21:57:10,236 INFO L87 Difference]: Start difference. First operand 5987 states and 25208 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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:57:10,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:57:10,334 INFO L93 Difference]: Finished difference Result 8187 states and 34478 transitions. [2022-03-15 21:57:10,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:57:10,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have 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:57:10,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:57:10,355 INFO L225 Difference]: With dead ends: 8187 [2022-03-15 21:57:10,355 INFO L226 Difference]: Without dead ends: 8187 [2022-03-15 21:57:10,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 247 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:57:10,357 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:57:10,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 15 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:57:10,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8187 states. [2022-03-15 21:57:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8187 to 6338. [2022-03-15 21:57:10,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6338 states, 6337 states have (on average 4.2171374467413605) internal successors, (26724), 6337 states have internal predecessors, (26724), 0 states have call successors, (0), 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:57:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6338 states to 6338 states and 26724 transitions. [2022-03-15 21:57:10,489 INFO L78 Accepts]: Start accepts. Automaton has 6338 states and 26724 transitions. Word has length 28 [2022-03-15 21:57:10,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:57:10,489 INFO L470 AbstractCegarLoop]: Abstraction has 6338 states and 26724 transitions. [2022-03-15 21:57:10,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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:57:10,489 INFO L276 IsEmpty]: Start isEmpty. Operand 6338 states and 26724 transitions. [2022-03-15 21:57:10,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 21:57:10,503 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:57:10,503 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:57:10,522 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:57:10,719 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,SelfDestructingSolverStorable15 [2022-03-15 21:57:10,719 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:57:10,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:57:10,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1882834591, now seen corresponding path program 9 times [2022-03-15 21:57:10,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:57:10,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408227766] [2022-03-15 21:57:10,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:57:10,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:57:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:57:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:57:10,751 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:57:10,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408227766] [2022-03-15 21:57:10,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408227766] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:57:10,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992979584] [2022-03-15 21:57:10,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:57:10,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:10,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:57:10,752 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:57:10,753 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:57:10,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:57:10,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:57:10,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:57:10,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:57:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:57:10,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:57:10,868 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:57:10,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992979584] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:57:10,868 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:57:10,868 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-03-15 21:57:10,869 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1909064689] [2022-03-15 21:57:10,869 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:57:10,871 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:57:10,940 INFO L252 McrAutomatonBuilder]: Finished intersection with 169 states and 381 transitions. [2022-03-15 21:57:10,940 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:57:11,797 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 8 treesize of output 6 [2022-03-15 21:57:11,815 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:11,831 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 8 treesize of output 6 [2022-03-15 21:57:11,844 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 8 treesize of output 6 [2022-03-15 21:57:11,879 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 8 treesize of output 6 [2022-03-15 21:57:11,964 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 8 treesize of output 6 [2022-03-15 21:57:11,997 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:12,009 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 8 treesize of output 6 [2022-03-15 21:57:12,037 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:57:12,074 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [98961#(or (<= q1_back q1_front) (<= (+ q1_front 2) q1_back)), 98962#(or (<= (+ q1_back 1) q1_front) (<= (+ q1_front 1) q1_back)), 98963#(or (<= q1_front q1_back) (<= (+ q1_back 2) q1_front)), 98801#(<= q1_front q1_back)] [2022-03-15 21:57:12,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 21:57:12,075 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:57:12,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 21:57:12,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:57:12,076 INFO L87 Difference]: Start difference. First operand 6338 states and 26724 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 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:57:12,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:57:12,159 INFO L93 Difference]: Finished difference Result 9829 states and 41765 transitions. [2022-03-15 21:57:12,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:57:12,159 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:57:12,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:57:12,186 INFO L225 Difference]: With dead ends: 9829 [2022-03-15 21:57:12,186 INFO L226 Difference]: Without dead ends: 9829 [2022-03-15 21:57:12,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 183 SyntacticMatches, 9 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:57:12,187 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 127 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:57:12,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 21 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:57:12,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9829 states. [2022-03-15 21:57:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9829 to 8685. [2022-03-15 21:57:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8685 states, 8684 states have (on average 4.269115614923998) internal successors, (37073), 8684 states have internal predecessors, (37073), 0 states have call successors, (0), 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:57:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8685 states to 8685 states and 37073 transitions. [2022-03-15 21:57:12,399 INFO L78 Accepts]: Start accepts. Automaton has 8685 states and 37073 transitions. Word has length 28 [2022-03-15 21:57:12,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:57:12,399 INFO L470 AbstractCegarLoop]: Abstraction has 8685 states and 37073 transitions. [2022-03-15 21:57:12,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 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:57:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 8685 states and 37073 transitions. [2022-03-15 21:57:12,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 21:57:12,418 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:57:12,418 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:57:12,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-03-15 21:57:12,631 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,SelfDestructingSolverStorable16 [2022-03-15 21:57:12,631 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:57:12,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:57:12,632 INFO L85 PathProgramCache]: Analyzing trace with hash -175319710, now seen corresponding path program 10 times [2022-03-15 21:57:12,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:57:12,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403928374] [2022-03-15 21:57:12,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:57:12,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:57:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:57:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 21:57:12,678 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:57:12,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403928374] [2022-03-15 21:57:12,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403928374] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:57:12,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353122112] [2022-03-15 21:57:12,678 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:57:12,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:12,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:57:12,700 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:57:12,729 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:57:12,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:57:12,729 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:57:12,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:57:12,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:57:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:57:12,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:57:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:57:12,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353122112] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:57:12,817 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:57:12,817 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-03-15 21:57:12,817 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [544827561] [2022-03-15 21:57:12,817 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:57:12,819 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:57:12,845 INFO L252 McrAutomatonBuilder]: Finished intersection with 162 states and 353 transitions. [2022-03-15 21:57:12,845 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:57:13,647 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 8 treesize of output 6 [2022-03-15 21:57:13,674 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 8 treesize of output 6 [2022-03-15 21:57:13,828 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 8 treesize of output 6 [2022-03-15 21:57:13,985 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [126340#(<= q1_front q1_back), 126339#(or (<= q1_back q1_front) (<= (+ q1_front 2) q1_back))] [2022-03-15 21:57:13,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:57:13,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:57:13,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:57:13,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:57:13,986 INFO L87 Difference]: Start difference. First operand 8685 states and 37073 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 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:57:14,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:57:14,151 INFO L93 Difference]: Finished difference Result 13904 states and 59553 transitions. [2022-03-15 21:57:14,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:57:14,151 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:57:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:57:14,198 INFO L225 Difference]: With dead ends: 13904 [2022-03-15 21:57:14,198 INFO L226 Difference]: Without dead ends: 13904 [2022-03-15 21:57:14,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:57:14,198 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 54 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:57:14,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 35 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:57:14,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13904 states. [2022-03-15 21:57:14,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13904 to 10433. [2022-03-15 21:57:14,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10433 states, 10432 states have (on average 4.274252300613497) internal successors, (44589), 10432 states have internal predecessors, (44589), 0 states have call successors, (0), 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:57:14,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10433 states to 10433 states and 44589 transitions. [2022-03-15 21:57:14,431 INFO L78 Accepts]: Start accepts. Automaton has 10433 states and 44589 transitions. Word has length 28 [2022-03-15 21:57:14,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:57:14,431 INFO L470 AbstractCegarLoop]: Abstraction has 10433 states and 44589 transitions. [2022-03-15 21:57:14,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 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:57:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 10433 states and 44589 transitions. [2022-03-15 21:57:14,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:57:14,453 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:57:14,453 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:57:14,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-15 21:57:14,667 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,SelfDestructingSolverStorable17 [2022-03-15 21:57:14,668 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:57:14,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:57:14,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1771117471, now seen corresponding path program 11 times [2022-03-15 21:57:14,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:57:14,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251696989] [2022-03-15 21:57:14,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:57:14,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:57:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:57:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:15,089 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:57:15,089 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251696989] [2022-03-15 21:57:15,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251696989] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:57:15,089 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034997237] [2022-03-15 21:57:15,089 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:57:15,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:15,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:57:15,090 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:57:15,091 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:57:15,127 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:57:15,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:57:15,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-15 21:57:15,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:57:15,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:57:15,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:57:15,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:57:15,429 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:57:15,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 50 [2022-03-15 21:57:15,722 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 37 treesize of output 29 [2022-03-15 21:57:15,771 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:15,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:57:16,130 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:57:16,130 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 47 treesize of output 71 [2022-03-15 21:57:16,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:57:16,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:57:16,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:57:16,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:57:16,453 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 45 treesize of output 33 [2022-03-15 21:57:16,479 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:57:16,479 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 20 treesize of output 45 [2022-03-15 21:57:16,585 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:16,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034997237] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:57:16,585 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:57:16,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 35 [2022-03-15 21:57:16,586 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [985136001] [2022-03-15 21:57:16,586 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:57:16,588 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:57:16,624 INFO L252 McrAutomatonBuilder]: Finished intersection with 195 states and 447 transitions. [2022-03-15 21:57:16,624 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:57:37,190 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 54 new interpolants: [161352#(and (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (= (+ q2_front 1) q2_back) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< (+ q1_front 1) q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ (- 1) N))) (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< (+ q1_front 1) q1_back)))), 161334#(and (or (< (+ 2 j) N) (<= total (select f (+ (- 1) N))) (< i N)) (or (<= (+ 2 j) N) (< i N)) (or (< i N) (= q2_back q2_front)) (or (<= (select f (+ (- 1) N)) total) (< (+ 2 j) N) (< i N))), 161348#(and (or (<= total (select f j)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= (select f j) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (= (select f (+ (- 1) N)) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 161353#(and (or (<= q2_back (+ q2_front 1)) (< i N)) (or (<= (+ 2 j) N) (< i N)) (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (< i N)) (or (<= (+ q2_front 1) q2_back) (< i N)) (or (= (select f j) (select q1 q1_front)) (< i N)) (or (<= total 0) (< i N)) (or (<= 0 total) (< i N)) (or (= (+ (select q2 q2_front) (select f j)) 0) (< i N))), 161372#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= (+ 2 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (<= total 0) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= q2_back q2_front) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back)) (or (<= N (+ i 1)) (<= 0 total) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))))), 161347#(and (or (< (+ 2 j) N) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (= (+ q2_front 1) (+ q2_back 1)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< j N)) (<= (+ (select q2 q2_front) total (select q1 q1_front)) (select f (+ (- 1) N))) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back)))), 161344#(and (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= total (+ (select f j) (select f (+ (- 1) N)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 161363#(and (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (= (+ q2_front 1) (+ q2_back 1)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ (- 1) N))) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back)))), 161374#(and (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (<= total 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (= q2_back q2_front)) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N))), 161360#(and (or (< (+ i 1) N) (= (select f j) (select q1 q1_front))) (or (<= total 0) (< (+ i 1) N)) (or (< (+ i 1) N) (<= (+ 2 j) N)) (or (< (+ i 1) N) (= q2_back q2_front)) (or (<= 0 total) (< (+ i 1) N)) (or (< (+ 2 j) N) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))))), 161327#(and (or (< 0 (+ total 1)) (< i N)) (or (<= total 0) (< i N))), 161355#(and (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= 0 total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= total 0) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (= (select f j) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 161356#(and (or (= (select f j) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= total 0) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= 0 total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 161323#(and (or (<= (+ j 1) N) (<= total 0) (< q1_front q1_back) (< i N)) (or (<= (+ j 1) N) (< q1_front q1_back) (< 0 (+ total 1)) (< i N))), 161328#(and (or (<= (+ j 1) N) (< 0 (+ total 1)) (< i N)) (or (<= (+ j 1) N) (<= total 0) (< i N))), 161335#(and (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< i N)) (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0) (< i N))), 161329#(and (or (<= (+ 2 j) N) (< 0 (+ total 1)) (< i N)) (or (<= total 0) (<= (+ 2 j) N) (< i N))), 161340#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) total)) (< i N)) (or (< (+ 2 j) N) (<= (+ (select q2 q2_front) total) (select f (+ (- 1) N))) (< q1_front q1_back) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) total) (< i N)) (or (= (+ q2_front 1) q2_back) (< q1_front q1_back) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= total (+ (select f j) (select f (+ (- 1) N)))) (< i N))), 161322#(and (or (<= total 0) (< q1_front q1_back) (< i N)) (or (< q1_front q1_back) (< 0 (+ total 1)) (< i N))), 161365#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ (- 1) N))) (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 161359#(and (or (<= (+ 2 j) N) (< i N)) (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (< i N)) (or (= (select f j) (select q1 q1_front)) (< i N)) (or (<= total 0) (< i N)) (or (<= 0 total) (< i N)) (or (< i N) (= q2_back q2_front))), 161333#(and (or (= (+ (select q2 q2_front) (select f j)) 0) (< i N) (= q2_back q2_front)) (or (<= (+ 2 j) N) (<= (select f j) total) (< i N) (not (= (+ (select q2 q2_front) (select f j)) 0))) (or (<= total (select f j)) (<= (+ 2 j) N) (< i N) (not (= (+ (select q2 q2_front) (select f j)) 0)))), 161332#(and (or (<= (+ 2 j) N) (<= 0 (+ (select q2 q2_front) total)) (< i N)) (or (<= (+ 2 j) N) (<= (+ (select q2 q2_front) total) 0) (< i N))), 161354#(and (or (< (+ i 1) N) (<= q2_back (+ q2_front 1))) (or (= (+ (select q2 q2_front) (select f j)) 0) (< (+ i 1) N)) (or (< (+ i 1) N) (<= (+ q2_front 1) q2_back)) (or (< (+ i 1) N) (= (select f j) (select q1 q1_front))) (or (<= total 0) (< (+ i 1) N)) (or (< (+ i 1) N) (<= (+ 2 j) N)) (or (<= 0 total) (< (+ i 1) N)) (or (< (+ 2 j) N) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))))), 161342#(and (or (< (+ 2 j) N) (<= (+ total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (= (+ q2_front 1) q2_back) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= (+ (select q2 q2_front) total (select q1 q1_front)) (select f (+ (- 1) N))) (< i N) (not (< q1_front q1_back)))), 161339#(and (or (< q1_front q1_back) (< i N) (= q2_back q2_front)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= total (select f (+ (- 1) N))) (< i N)) (or (<= (+ 2 j) N) (< q1_front q1_back) (< i N)) (or (<= (select f (+ (- 1) N)) total) (< (+ 2 j) N) (< q1_front q1_back) (< i N))), 161326#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< j N)) (or (<= q2_back q2_front) (< j N) (<= (+ (select q2 q2_front) total) 0))), 161324#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (< 0 (+ total 1)) (< i N)) (or (<= total 0) (<= (+ 2 j) N) (< q1_front q1_back) (< i N))), 161369#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= q2_back (+ q2_front 1))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (= (+ (select q2 q2_front) (select f j)) 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ q2_front 1) q2_back)) (or (<= N (+ i 1)) (<= total 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N))), 161345#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< q1_front q1_back) (= (+ q2_front 1) (+ q2_back 1)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= total (+ (select f j) (select f (+ (- 1) N)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 161357#(and (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (= (+ q2_front 1) (+ q2_back 1)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ (- 1) N))) (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back)))), 161362#(and (or (<= 0 total) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (<= total 0) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select f j) (select q1 q1_front))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) (select f i))) (= (+ (select q2 q2_front) (select f j)) 0) (<= N i) (< (+ i 1) N)) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= q2_back (+ q2_front 1)))), 161337#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (<= (+ (select q2 q2_front) total) 0) (< i N)) (or (<= (+ 2 j) N) (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total)) (< i N))), 161325#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1))) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0))), 161351#(and (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ (- 1) N))) (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (= (+ q2_front 1) (+ q2_back 1)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back)))), 161364#(and (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select f j) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back)) (or (<= 0 total) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))))), 161373#(and (or (<= 0 total) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (<= total 0) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select f j) (select q1 q1_front))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= q2_back q2_front))), 161338#(and (or (= (+ (select q2 q2_front) (select f j)) 0) (< q1_front q1_back) (< i N) (= q2_back q2_front)) (or (<= (+ 2 j) N) (< q1_front q1_back) (<= (select f j) total) (< i N) (not (= (+ (select q2 q2_front) (select f j)) 0))) (or (<= total (select f j)) (<= (+ 2 j) N) (< q1_front q1_back) (< i N) (not (= (+ (select q2 q2_front) (select f j)) 0)))), 161343#(and (or (<= q2_back (+ q2_front 1)) (< i N)) (or (<= (+ 2 j) N) (< i N)) (or (<= total (select f j)) (< i N)) (or (<= (+ q2_front 1) q2_back) (< i N)) (or (= (+ (select q2 q2_front) (select f j)) 0) (< i N)) (or (<= (select f j) total) (< i N)) (or (< (+ 2 j) N) (= (select f (+ (- 1) N)) (select q1 q1_front)) (< i N))), 161358#(and (or (<= 0 total) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= total 0) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ i 1) N) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ i 1) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ i 1) N) (= (select f j) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 161341#(and (or (<= q2_back (+ q2_front 1)) (< i N)) (or (<= (+ 2 j) N) (< i N)) (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) total) (< i N)) (or (<= (+ q2_front 1) q2_back) (< i N)) (or (< (+ 2 j) N) (<= total (+ (select f j) (select f (+ (- 1) N)))) (< i N)) (or (< (+ 2 j) N) (= (+ (select q2 q2_front) (select f j)) 0) (< i N))), 161371#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (= (+ (select q2 q2_front) (select f j)) 0) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (+ q2_front 1) q2_back)) (or (<= N (+ i 1)) (<= 0 total) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= (+ 2 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= q2_back (+ q2_front 1))) (or (<= N (+ i 1)) (<= total 0) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))))), 161349#(and (or (<= total (select f j)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= (select f j) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (= (select f (+ (- 1) N)) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 161375#(and (or (<= N (+ i 1)) (<= 0 total) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= (+ 2 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (<= N (+ i 1)) (<= total 0) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))))), 161366#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ (- 1) N))) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (+ q2_front 1) q2_back) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< q1_front (+ q1_back 1)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 161367#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (= (+ q2_front 1) (+ q2_back 1)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ (- 1) N))) (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back)))), 161350#(and (or (< (+ q1_front 2) q1_back) (= (+ q2_front 1) q2_back) (< i N) (not (< (+ q1_front 1) q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ (- 1) N))) (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (< i N) (not (< (+ q1_front 1) q1_back)))), 161336#(and (or (<= (+ j 1) N) (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< i N)) (or (<= (+ j 1) N) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0) (< i N))), 161370#(and (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (<= total 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back)) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))))), 161368#(and (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (= (+ q2_front 1) (+ q2_back 1)) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< q1_front (+ q1_back 1)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front (+ q1_back 1))))), 161330#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< i N)) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0) (< i N))), 161361#(and (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (select f (+ (- 1) N)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (= (+ q2_front 1) q2_back) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ (- 1) N))) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 161331#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< j N) (< i N)) (or (<= q2_back q2_front) (< j N) (<= (+ (select q2 q2_front) total) 0) (< i N))), 161346#(and (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (<= total (+ (select f j) (select f (+ (- 1) N)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)))] [2022-03-15 21:57:37,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-03-15 21:57:37,193 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:57:37,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-03-15 21:57:37,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=817, Invalid=7373, Unknown=0, NotChecked=0, Total=8190 [2022-03-15 21:57:37,195 INFO L87 Difference]: Start difference. First operand 10433 states and 44589 transitions. Second operand has 70 states, 69 states have (on average 3.608695652173913) internal successors, (249), 69 states have internal predecessors, (249), 0 states have call successors, (0), 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:59:15,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:59:15,449 INFO L93 Difference]: Finished difference Result 33799 states and 132521 transitions. [2022-03-15 21:59:15,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 481 states. [2022-03-15 21:59:15,449 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 3.608695652173913) internal successors, (249), 69 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have 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:59:15,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:59:15,550 INFO L225 Difference]: With dead ends: 33799 [2022-03-15 21:59:15,550 INFO L226 Difference]: Without dead ends: 33712 [2022-03-15 21:59:15,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 129 SyntacticMatches, 18 SemanticMatches, 543 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124551 ImplicationChecksByTransitivity, 91.7s TimeCoverageRelationStatistics Valid=33228, Invalid=263252, Unknown=0, NotChecked=0, Total=296480 [2022-03-15 21:59:15,568 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 3377 mSDsluCounter, 3189 mSDsCounter, 0 mSdLazyCounter, 15298 mSolverCounterSat, 1942 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3377 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 17240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1942 IncrementalHoareTripleChecker+Valid, 15298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:59:15,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3377 Valid, 1 Invalid, 17240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1942 Valid, 15298 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2022-03-15 21:59:15,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33712 states. [2022-03-15 21:59:15,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33712 to 10703. [2022-03-15 21:59:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10703 states, 10702 states have (on average 4.268267613530181) internal successors, (45679), 10702 states have internal predecessors, (45679), 0 states have call successors, (0), 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:59:15,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10703 states to 10703 states and 45679 transitions. [2022-03-15 21:59:15,928 INFO L78 Accepts]: Start accepts. Automaton has 10703 states and 45679 transitions. Word has length 30 [2022-03-15 21:59:15,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:59:15,928 INFO L470 AbstractCegarLoop]: Abstraction has 10703 states and 45679 transitions. [2022-03-15 21:59:15,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 3.608695652173913) internal successors, (249), 69 states have internal predecessors, (249), 0 states have call successors, (0), 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:59:15,929 INFO L276 IsEmpty]: Start isEmpty. Operand 10703 states and 45679 transitions. [2022-03-15 21:59:15,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:59:15,951 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:59:15,951 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:59:15,967 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:59:16,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:59:16,167 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:59:16,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:59:16,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1338767845, now seen corresponding path program 12 times [2022-03-15 21:59:16,169 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:59:16,169 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599009488] [2022-03-15 21:59:16,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:59:16,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:59:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:59:16,524 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:59:16,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:59:16,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599009488] [2022-03-15 21:59:16,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599009488] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:59:16,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624412581] [2022-03-15 21:59:16,525 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:59:16,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:59:16,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:59:16,526 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:59:16,526 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:59:16,558 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:59:16,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:59:16,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 21:59:16,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:59:17,090 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 21:59:17,090 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 32 treesize of output 16 [2022-03-15 21:59:17,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:59:17,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:59:17,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-03-15 21:59:17,298 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:59:17,298 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 15 treesize of output 20 [2022-03-15 21:59:17,370 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:59:17,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:59:17,712 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:59:17,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 56 [2022-03-15 21:59:17,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:59:17,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:59:17,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:59:17,948 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:59:17,948 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 62 [2022-03-15 21:59:17,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:59:17,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:59:17,967 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:59:17,967 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 80 [2022-03-15 21:59:18,269 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:59:18,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624412581] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:59:18,270 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:59:18,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2022-03-15 21:59:18,270 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1316696763] [2022-03-15 21:59:18,270 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:59:18,273 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:59:18,314 INFO L252 McrAutomatonBuilder]: Finished intersection with 217 states and 506 transitions. [2022-03-15 21:59:18,314 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:59:44,369 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 63 new interpolants: [217745#(and (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= q2_back (+ q2_front 1)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (+ q2_front 1) q2_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f j)) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (<= (select f j) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 217713#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< j N) (< i N)) (or (<= q2_back q2_front) (< j N) (<= (+ (select q2 q2_front) total) 0) (< i N))), 217755#(and (or (= (select f j) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= total 0) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= 0 total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 217730#(and (or (< (+ q1_front 2) q1_back) (<= (+ 3 j) N) (< i N) (not (< (+ q1_front 1) q1_back)) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ q2_front 1) q2_back) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= q2_back (+ q2_front 1)) (< i N) (not (< (+ q1_front 1) q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (< (+ q1_front 2) q1_back) (<= (+ 3 j) N) (< i N) (not (< (+ q1_front 1) q1_back)))), 217761#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= (+ 2 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (<= total 0) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= q2_back q2_front) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back)) (or (<= N (+ i 1)) (<= 0 total) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))))), 217750#(and (or (< (+ i 1) N) (<= q2_back (+ q2_front 1))) (or (= (+ (select q2 q2_front) (select f j)) 0) (< (+ i 1) N)) (or (< (+ i 1) N) (<= (+ q2_front 1) q2_back)) (or (< (+ i 1) N) (= (select f j) (select q1 q1_front))) (or (<= total 0) (< (+ i 1) N)) (or (< (+ i 1) N) (<= (+ 2 j) N)) (or (<= 0 total) (< (+ i 1) N)) (or (< (+ 2 j) N) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))))), 217704#(and (or (<= total 0) (< q1_front q1_back) (< i N)) (or (< q1_front q1_back) (< 0 (+ total 1)) (< i N))), 217734#(and (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< q1_front q1_back)))), 217737#(and (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back))) (or (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (<= (+ total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back) (not (< q1_front q1_back)))), 217731#(and (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= q2_back (+ q2_front 1)) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ q2_front 1) q2_back) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f j)) (<= (+ 2 j) N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (<= (select f j) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< (+ q1_front 1) q1_back)))), 217719#(and (or (<= q2_back (+ q2_front 1)) (< i N)) (or (<= (+ 2 j) N) (< i N)) (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) total) (< i N)) (or (<= (+ q2_front 1) q2_back) (< i N)) (or (< (+ 2 j) N) (<= total (+ (select f j) (select f (+ (- 1) N)))) (< i N)) (or (< (+ 2 j) N) (= (+ (select q2 q2_front) (select f j)) 0) (< i N))), 217720#(and (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< i N)) (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0) (< i N))), 217764#(and (or (<= 0 total) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (<= total 0) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select f j) (select q1 q1_front))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= q2_back q2_front))), 217739#(and (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (<= total (+ (select f j) (select f (+ (- 1) N)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 217721#(and (or (<= (+ j 1) N) (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< i N)) (or (<= (+ j 1) N) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0) (< i N))), 217754#(and (or (<= total (select f j)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= (select f j) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (= (select f (+ (- 1) N)) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 217753#(and (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= 0 total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= total 0) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (= (select f j) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 217723#(and (or (= (+ (select q2 q2_front) (select f j)) 0) (< q1_front q1_back) (< i N) (= q2_back q2_front)) (or (<= (+ 2 j) N) (< q1_front q1_back) (<= (select f j) total) (< i N) (not (= (+ (select q2 q2_front) (select f j)) 0))) (or (<= total (select f j)) (<= (+ 2 j) N) (< q1_front q1_back) (< i N) (not (= (+ (select q2 q2_front) (select f j)) 0)))), 217724#(and (or (<= (+ (select q2 q2_front) total) (select f j)) (<= (+ 2 j) N) (< q1_front q1_back) (< i N)) (or (<= (+ 2 j) N) (< q1_front q1_back) (<= (select f j) (+ (select q2 q2_front) total)) (< i N)) (or (< q1_front q1_back) (<= (+ q2_front 1) q2_back) (< i N)) (or (< q1_front q1_back) (<= q2_back (+ q2_front 1)) (< i N))), 217743#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 217748#(and (or (<= q2_back (+ q2_front 1)) (< i N)) (or (<= (+ 2 j) N) (< i N)) (or (<= total (select f j)) (< i N)) (or (<= (+ q2_front 1) q2_back) (< i N)) (or (= (+ (select q2 q2_front) (select f j)) 0) (< i N)) (or (<= (select f j) total) (< i N)) (or (< (+ 2 j) N) (= (select f (+ (- 1) N)) (select q1 q1_front)) (< i N))), 217760#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (= (+ (select q2 q2_front) (select f j)) 0) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (+ q2_front 1) q2_back)) (or (<= N (+ i 1)) (<= 0 total) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= (+ 2 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= q2_back (+ q2_front 1))) (or (<= N (+ i 1)) (<= total 0) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))))), 217728#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (< i N)) (or (< q1_front q1_back) (<= (+ 3 j) N) (<= (select f (+ j 1)) (+ (select q2 q2_front) total)) (< i N)) (or (< q1_front q1_back) (<= (+ 3 j) N) (<= (+ (select q2 q2_front) total) (select f (+ j 1))) (< i N)) (or (< q1_front q1_back) (<= (+ q2_front 1) q2_back) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) total) (< i N)) (or (< q1_front q1_back) (<= q2_back (+ q2_front 1)) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= total (+ (select f j) (select f (+ (- 1) N)))) (< i N))), 217705#(and (or (<= (+ j 1) N) (<= total 0) (< q1_front q1_back) (< i N)) (or (<= (+ j 1) N) (< q1_front q1_back) (< 0 (+ total 1)) (< i N))), 217746#(and (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= q2_back (+ q2_front 1)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (+ q2_front 1) q2_back) (not (< q1_front (+ q1_back 1)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< q1_front (+ q1_back 1)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 217717#(and (or (not (= (+ (select q2 q2_front) (select f (+ j 1))) 0)) (<= (select f (+ j 1)) total) (<= (+ 3 j) N)) (or (not (= (+ (select q2 q2_front) (select f (+ j 1))) 0)) (<= total (select f (+ j 1))) (<= (+ 3 j) N)) (or (= (+ (select q2 q2_front) (select f (+ j 1))) 0) (= q2_back q2_front))), 217736#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< q1_front q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= total (+ (select f j) (select f (+ (- 1) N)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< q1_front q1_back) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 217718#(and (or (not (= (+ (select q2 q2_front) (select f (+ j 1))) 0)) (<= total (select f (+ j 1))) (<= (+ 3 j) N) (< i N)) (or (< i N) (= (+ (select q2 q2_front) (select f (+ j 1))) 0) (= q2_back q2_front)) (or (not (= (+ (select q2 q2_front) (select f (+ j 1))) 0)) (<= (select f (+ j 1)) total) (<= (+ 3 j) N) (< i N))), 217738#(and (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back)))), 217762#(and (or (<= (+ 2 j) N) (< i N)) (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (< i N)) (or (= (select f j) (select q1 q1_front)) (< i N)) (or (<= total 0) (< i N)) (or (<= 0 total) (< i N)) (or (< i N) (= q2_back q2_front))), 217722#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (<= (+ (select q2 q2_front) total) 0) (< i N)) (or (<= (+ 2 j) N) (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total)) (< i N))), 217706#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (< 0 (+ total 1)) (< i N)) (or (<= total 0) (<= (+ 2 j) N) (< q1_front q1_back) (< i N))), 217727#(and (or (< q1_front q1_back) (< i N) (= (+ (select q2 q2_front) (select f (+ j 1))) 0) (= q2_back q2_front)) (or (not (= (+ (select q2 q2_front) (select f (+ j 1))) 0)) (<= (select f (+ j 1)) total) (< q1_front q1_back) (<= (+ 3 j) N) (< i N)) (or (not (= (+ (select q2 q2_front) (select f (+ j 1))) 0)) (<= total (select f (+ j 1))) (< q1_front q1_back) (<= (+ 3 j) N) (< i N))), 217759#(and (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (<= total 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back)) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))))), 217740#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back) (not (< (+ q1_front 1) q1_back)))), 217757#(and (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select f j) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back)) (or (<= 0 total) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))))), 217733#(and (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (<= (select f j) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f j)) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back)))), 217712#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< i N)) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0) (< i N))), 217752#(and (or (<= total (select f j)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= (select f j) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (= (select f (+ (- 1) N)) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 217758#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= q2_back (+ q2_front 1))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (= (+ (select q2 q2_front) (select f j)) 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ q2_front 1) q2_back)) (or (<= N (+ i 1)) (<= total 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N))), 217709#(and (or (<= (+ 2 j) N) (< 0 (+ total 1)) (< i N)) (or (<= total 0) (<= (+ 2 j) N) (< i N))), 217715#(and (or (= (+ (select q2 q2_front) (select f j)) 0) (< i N) (= q2_back q2_front)) (or (<= (+ 2 j) N) (<= (select f j) total) (< i N) (not (= (+ (select q2 q2_front) (select f j)) 0))) (or (<= total (select f j)) (<= (+ 2 j) N) (< i N) (not (= (+ (select q2 q2_front) (select f j)) 0)))), 217732#(and (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= q2_back (+ q2_front 1)) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ q2_front 1) q2_back) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 3 j) N) (not (< (+ q1_front 1) q1_back)) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 3 j) N) (not (< (+ q1_front 1) q1_back)))), 217765#(and (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (<= total 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (= q2_back q2_front)) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N))), 217726#(and (or (< (+ q1_front 2) q1_back) (<= (+ q2_front 1) q2_back) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f j)) (<= (+ 2 j) N) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= q2_back (+ q2_front 1)) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (<= (select f j) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< i N) (not (< (+ q1_front 1) q1_back)))), 217716#(and (or (<= (+ 2 j) N) (<= (select f j) (+ (select q2 q2_front) total)) (< i N)) (or (<= q2_back (+ q2_front 1)) (< i N)) (or (<= (+ (select q2 q2_front) total) (select f j)) (<= (+ 2 j) N) (< i N)) (or (<= (+ q2_front 1) q2_back) (< i N))), 217707#(and (or (< 0 (+ total 1)) (< i N)) (or (<= total 0) (< i N))), 217766#(and (or (<= N (+ i 1)) (<= 0 total) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= (+ 2 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (<= N (+ i 1)) (<= total 0) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))))), 217751#(and (or (<= 0 total) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (<= total 0) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select f j) (select q1 q1_front))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) (select f i))) (= (+ (select q2 q2_front) (select f j)) 0) (<= N i) (< (+ i 1) N)) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= q2_back (+ q2_front 1)))), 217747#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= q2_back q2_front) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front (+ q1_back 1))))), 217711#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< j N)) (or (<= q2_back q2_front) (< j N) (<= (+ (select q2 q2_front) total) 0))), 217725#(and (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= (select f j) (+ (select q2 q2_front) total (select q1 q1_front))) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= (+ (select q2 q2_front) total (select q1 q1_front)) (select f j)) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (< i N) (not (< q1_front q1_back)))), 217714#(and (or (<= (+ 2 j) N) (<= 0 (+ (select q2 q2_front) total)) (< i N)) (or (<= (+ 2 j) N) (<= (+ (select q2 q2_front) total) 0) (< i N))), 217763#(and (or (< (+ i 1) N) (= (select f j) (select q1 q1_front))) (or (<= total 0) (< (+ i 1) N)) (or (< (+ i 1) N) (<= (+ 2 j) N)) (or (< (+ i 1) N) (= q2_back q2_front)) (or (<= 0 total) (< (+ i 1) N)) (or (< (+ 2 j) N) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))))), 217708#(and (or (<= (+ j 1) N) (< 0 (+ total 1)) (< i N)) (or (<= (+ j 1) N) (<= total 0) (< i N))), 217742#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (<= (select f j) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f j)) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 217729#(and (or (< (+ 2 j) N) (<= (+ total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (select f (+ j 1)) (+ (select q2 q2_front) total (select q1 q1_front))) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (+ (select q2 q2_front) total (select q1 q1_front)) (select f (+ j 1))) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (< i N) (not (< q1_front q1_back)))), 217710#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1))) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0))), 217735#(and (or (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= total (+ (select f j) (select f (+ (- 1) N)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 217756#(and (or (<= 0 total) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= total 0) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ i 1) N) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ i 1) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ i 1) N) (= (select f j) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 217741#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back)))), 217749#(and (or (<= q2_back (+ q2_front 1)) (< i N)) (or (<= (+ 2 j) N) (< i N)) (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (< i N)) (or (<= (+ q2_front 1) q2_back) (< i N)) (or (= (select f j) (select q1 q1_front)) (< i N)) (or (<= total 0) (< i N)) (or (<= 0 total) (< i N)) (or (= (+ (select q2 q2_front) (select f j)) 0) (< i N))), 217744#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))))] [2022-03-15 21:59:44,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-03-15 21:59:44,370 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:59:44,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-03-15 21:59:44,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1095, Invalid=9617, Unknown=0, NotChecked=0, Total=10712 [2022-03-15 21:59:44,371 INFO L87 Difference]: Start difference. First operand 10703 states and 45679 transitions. Second operand has 79 states, 78 states have (on average 3.576923076923077) internal successors, (279), 78 states have internal predecessors, (279), 0 states have call successors, (0), 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 22:03:44,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:44,798 INFO L93 Difference]: Finished difference Result 49057 states and 196880 transitions. [2022-03-15 22:03:44,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 869 states. [2022-03-15 22:03:44,798 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 78 states have (on average 3.576923076923077) internal successors, (279), 78 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have 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 22:03:44,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:45,017 INFO L225 Difference]: With dead ends: 49057 [2022-03-15 22:03:45,017 INFO L226 Difference]: Without dead ends: 48925 [2022-03-15 22:03:45,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1098 GetRequests, 133 SyntacticMatches, 23 SemanticMatches, 942 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410339 ImplicationChecksByTransitivity, 228.1s TimeCoverageRelationStatistics Valid=86578, Invalid=803614, Unknown=0, NotChecked=0, Total=890192 [2022-03-15 22:03:45,078 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 5945 mSDsluCounter, 3498 mSDsCounter, 0 mSdLazyCounter, 17912 mSolverCounterSat, 4051 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5945 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 21963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4051 IncrementalHoareTripleChecker+Valid, 17912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:45,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5945 Valid, 1 Invalid, 21963 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4051 Valid, 17912 Invalid, 0 Unknown, 0 Unchecked, 13.5s Time] [2022-03-15 22:03:45,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48925 states. [2022-03-15 22:03:45,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48925 to 10873. [2022-03-15 22:03:45,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10873 states, 10872 states have (on average 4.271891096394407) internal successors, (46444), 10872 states have internal predecessors, (46444), 0 states have call successors, (0), 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 22:03:45,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10873 states to 10873 states and 46444 transitions. [2022-03-15 22:03:45,775 INFO L78 Accepts]: Start accepts. Automaton has 10873 states and 46444 transitions. Word has length 30 [2022-03-15 22:03:45,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:45,775 INFO L470 AbstractCegarLoop]: Abstraction has 10873 states and 46444 transitions. [2022-03-15 22:03:45,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 78 states have (on average 3.576923076923077) internal successors, (279), 78 states have internal predecessors, (279), 0 states have call successors, (0), 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 22:03:45,775 INFO L276 IsEmpty]: Start isEmpty. Operand 10873 states and 46444 transitions. [2022-03-15 22:03:45,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 22:03:45,796 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:45,797 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:45,813 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 22:03:46,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:46,012 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 22:03:46,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:46,012 INFO L85 PathProgramCache]: Analyzing trace with hash 486247649, now seen corresponding path program 13 times [2022-03-15 22:03:46,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:46,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267288758] [2022-03-15 22:03:46,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:46,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:46,387 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:46,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267288758] [2022-03-15 22:03:46,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267288758] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:46,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513391485] [2022-03-15 22:03:46,387 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:03:46,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:46,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:46,389 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 22:03:46,389 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 22:03:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:46,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 22:03:46,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:46,653 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:03:46,654 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 28 treesize of output 16 [2022-03-15 22:03:46,730 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 30 treesize of output 22 [2022-03-15 22:03:46,764 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 13 treesize of output 9 [2022-03-15 22:03:46,788 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:46,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:46,983 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:03:46,983 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 44 treesize of output 68 [2022-03-15 22:03:47,159 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:03:47,160 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 45 treesize of output 69 [2022-03-15 22:03:47,187 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:03:47,187 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 67 treesize of output 85 [2022-03-15 22:03:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:47,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513391485] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:47,711 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:47,712 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 31 [2022-03-15 22:03:47,712 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [461084955] [2022-03-15 22:03:47,712 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:47,715 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:47,767 INFO L252 McrAutomatonBuilder]: Finished intersection with 227 states and 527 transitions. [2022-03-15 22:03:47,767 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:18,470 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 66 new interpolants: [290470#(and (or (<= (+ 2 j) N) (< 0 (+ total 1)) (< i N)) (or (<= total 0) (<= (+ 2 j) N) (< i N))), 290521#(and (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= (+ 2 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= q2_back q2_front) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back)) (or (<= N (+ i 1)) (< (+ 2 j) N) (<= total 0) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))))), 290468#(and (or (< 0 (+ total 1)) (< i N)) (or (<= total 0) (< i N))), 290487#(and (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (<= total (+ (select f j) (select f (+ (- 1) N)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 290516#(and (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 290488#(and (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (< (+ q1_front 1) q1_back)))), 290504#(and (or (<= 0 total) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ q2_front 1) q2_back)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (= (+ (select q2 q2_front) (select f j)) 0) (<= N i) (< (+ i 1) N)) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N)))) (or (< (+ 2 j) N) (<= total 0) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= q2_back (+ q2_front 1)))), 290514#(and (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (<= total 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 j) N) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back)) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select q1 q1_back) (select f (+ i 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))))), 290501#(and (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back)))), 290511#(and (or (<= 0 total) (< (+ 2 j) N) (< (+ i 1) N)) (or (= (+ q2_back (* (- 1) q2_front)) 0) (< (+ i 1) N)) (or (< (+ 2 j) N) (<= total 0) (< (+ i 1) N)) (or (< (+ i 1) N) (<= (+ 2 j) N)) (or (< (+ 2 j) N) (< (+ i 1) N) (= (select f j) (select q1 q1_front))) (or (< (+ 2 j) N) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))))), 290457#(and (or (<= total 0) (< q1_front q1_back) (< i N)) (or (< q1_front q1_back) (< 0 (+ total 1)) (< i N))), 290477#(and (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= total (+ (select f j) (select f (+ (- 1) N)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 290482#(and (or (<= (+ 2 j) N) (<= (select f j) (+ (select q2 q2_front) total)) (< i N)) (or (<= (+ 2 j) N) (<= q2_back (+ q2_front 1)) (< i N)) (or (<= (+ (select q2 q2_front) total) (select f j)) (<= (+ 2 j) N) (< i N)) (or (<= (+ 2 j) N) (<= (+ q2_front 1) q2_back) (< i N))), 290500#(and (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< q1_front q1_back)))), 290462#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< j N)) (or (<= q2_back q2_front) (< j N) (<= (+ (select q2 q2_front) total) 0))), 290474#(and (or (<= 0 (+ (select q2 q2_front) total (select q2 (+ q2_front 1)))) (<= (+ 2 j) N) (< i N)) (or (<= (+ 2 j) N) (< i N) (<= (+ (select q2 q2_front) total (select q2 (+ q2_front 1))) 0))), 290466#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (< i N) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (< q1_front q1_back)))), 290497#(and (or (< (+ 2 j) N) (<= total 0) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (< (+ 2 j) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= 0 total) (< (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 290472#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< j N) (< i N)) (or (<= q2_back q2_front) (< j N) (<= (+ (select q2 q2_front) total) 0) (< i N))), 290476#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (< i N)) (or (< q1_front q1_back) (<= (+ 3 j) N) (<= (select f (+ j 1)) (+ (select q2 q2_front) total)) (< i N)) (or (< q1_front q1_back) (<= (+ 3 j) N) (<= (+ (select q2 q2_front) total) (select f (+ j 1))) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= q2_back (+ q2_front 1)) (< i N)) (or (< q1_front q1_back) (<= (+ 3 j) N) (<= (+ q2_front 1) q2_back) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) total) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= total (+ (select f j) (select f (+ (- 1) N)))) (< i N))), 290494#(and (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (= (select f (+ (- 1) N)) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= (select f j) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= total (select f j)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 290495#(and (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= 0 total) (< (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= total 0) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back))), 290507#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (<= (select f j) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f j)) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back)))), 290479#(and (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= (select f j) (+ (select q2 q2_front) total (select q1 q1_front))) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= (+ (select q2 q2_front) total (select q1 q1_front)) (select f j)) (< i N) (not (< q1_front q1_back)))), 290491#(and (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back)) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back) (not (< (+ q1_front 1) q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= q2_back q2_front) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< (+ q1_front 1) q1_back)))), 290510#(and (or (<= 0 total) (< (+ 2 j) N) (< i N)) (or (<= (+ 2 j) N) (< i N)) (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (< i N)) (or (< (+ 2 j) N) (= (select f j) (select q1 q1_front)) (< i N)) (or (< (+ 2 j) N) (<= total 0) (< i N)) (or (= (+ q2_back (* (- 1) q2_front)) 0) (< i N))), 290506#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (< q1_front q1_back))) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 290502#(and (or (< (+ 2 j) N) (< (+ i 1) N) (<= q2_back (+ q2_front 1))) (or (< (+ 2 j) N) (< (+ i 1) N) (<= (+ q2_front 1) q2_back)) (or (<= 0 total) (< (+ 2 j) N) (< (+ i 1) N)) (or (< (+ 2 j) N) (= (+ (select q2 q2_front) (select f j)) 0) (< (+ i 1) N)) (or (< (+ 2 j) N) (<= total 0) (< (+ i 1) N)) (or (< (+ i 1) N) (<= (+ 2 j) N)) (or (< (+ 2 j) N) (< (+ i 1) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0)) (or (< (+ 2 j) N) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))))), 290489#(and (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f j)) (<= (+ 2 j) N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (<= (+ q2_front 1) q2_back) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (<= q2_back (+ q2_front 1)) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (<= (select f j) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< (+ q1_front 1) q1_back)))), 290469#(and (or (<= (+ j 1) N) (< 0 (+ total 1)) (< i N)) (or (<= (+ j 1) N) (<= total 0) (< i N))), 290519#(and (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (+ q2_front 1) q2_back)) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= (+ 2 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (= (+ (select q2 q2_front) (select f j)) 0) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (<= total 0) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= q2_back (+ q2_front 1))) (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))))), 290461#(and (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< i N)) (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0) (< i N))), 290493#(and (or (<= 0 total) (< (+ 2 j) N) (< i N)) (or (<= (+ 2 j) N) (< i N)) (or (< (+ 2 j) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (< i N)) (or (< (+ 2 j) N) (<= (+ q2_front 1) q2_back) (< i N)) (or (< (+ 2 j) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0) (< i N)) (or (< (+ 2 j) N) (<= total 0) (< i N)) (or (< (+ 2 j) N) (<= q2_back (+ q2_front 1)) (< i N)) (or (< (+ 2 j) N) (= (+ (select q2 q2_front) (select f j)) 0) (< i N))), 290522#(and (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (<= (+ 2 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (= (+ q2_back (* (- 1) q2_front)) 0) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (<= total 0) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1))))) (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (< (+ 2 i) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))))), 290460#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1))) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0))), 290520#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back) (not (< q1_front (+ q1_back 1))))), 290508#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 290465#(and (or (<= 0 (+ (select q2 q2_front) total (select q2 (+ q2_front 1)))) (<= (+ 2 j) N) (< q1_front q1_back) (< i N)) (or (<= (+ 2 j) N) (< q1_front q1_back) (< i N) (<= (+ (select q2 q2_front) total (select q2 (+ q2_front 1))) 0))), 290478#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (< q1_front q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (< (+ 2 j) N) (< q1_front q1_back) (<= total (+ (select f j) (select f (+ (- 1) N)))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 290480#(and (or (< (+ 2 j) N) (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (< i N) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (<= (+ total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (select f (+ j 1)) (+ (select q2 q2_front) total (select q1 q1_front))) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (+ q2_front 1) q2_back) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (+ (select q2 q2_front) total (select q1 q1_front)) (select f (+ j 1))) (< i N) (not (< q1_front q1_back)))), 290481#(and (or (< (+ 2 j) N) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (<= (+ (select q2 q2_front) total (select q1 q1_front)) (select f (+ j 1))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back))) (or (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= (select f (+ j 1)) (+ (select q2 q2_front) total (select q1 q1_front))) (< i N) (not (< q1_front q1_back)))), 290505#(and (or (<= 0 total) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (<= total 0) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))))), 290515#(and (or (<= N (+ i 1)) (< (+ 2 j) N) (<= total 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (select f j) (select q1 q1_front)) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 j) N) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (= (+ q2_back (* (- 1) q2_front)) 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N))), 290473#(and (or (<= (+ 2 j) N) (<= 0 (+ (select q2 q2_front) total)) (< i N)) (or (<= (+ 2 j) N) (<= (+ (select q2 q2_front) total) 0) (< i N))), 290499#(and (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (<= (select f j) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f j)) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 290509#(and (or (<= N (+ i 1)) (< (+ 2 j) N) (<= total 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (<= 0 total) (< (+ 2 j) N) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (= (+ (select q2 q2_front) (select f j)) 0) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (= (select q1 q1_back) (select f (+ i 1))))) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= q2_back (+ q2_front 1))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N)) (or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ q2_front 1) q2_back))), 290513#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (< (+ 2 j) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= (+ 2 j) N) (< (+ q1_front 1) q1_back) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back) (not (< q1_front q1_back))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 q1_back) (select f (+ i 1)))) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (not (< q1_front q1_back)))), 290471#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< i N)) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0) (< i N))), 290496#(and (or (< (+ 2 j) N) (<= (select f j) total) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back)) (or (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (= (select f (+ (- 1) N)) (select q1 q1_front)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N)) (or (< (+ 2 j) N) (<= total (select f j)) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N))), 290458#(and (or (<= (+ j 1) N) (<= total 0) (< q1_front q1_back) (< i N)) (or (<= (+ j 1) N) (< q1_front q1_back) (< 0 (+ total 1)) (< i N))), 290498#(and (or (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (< q1_front q1_back))) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) (select f i))) (< (+ i 1) N) (<= (+ 2 j) N) (not (< i N)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 290467#(and (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (< i N) (not (< (+ q1_front 1) q1_back)))), 290459#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (< 0 (+ total 1)) (< i N)) (or (<= total 0) (<= (+ 2 j) N) (< q1_front q1_back) (< i N))), 290485#(and (or (< (+ q1_front 2) q1_back) (<= (+ 3 j) N) (<= (+ q2_front 1) q2_back) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 3 j) N) (< i N) (not (< (+ q1_front 1) q1_back)) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 3 j) N) (<= q2_back (+ q2_front 1)) (< i N) (not (< (+ q1_front 1) q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (< (+ q1_front 2) q1_back) (<= (+ 3 j) N) (< i N) (not (< (+ q1_front 1) q1_back)))), 290483#(and (or (<= (+ 2 j) N) (< i N)) (or (< (+ 2 j) N) (<= (+ (select f j) (select f (+ (- 1) N))) total) (< i N)) (or (< (+ 2 j) N) (<= (+ q2_front 1) q2_back) (< i N)) (or (< (+ 2 j) N) (<= total (+ (select f j) (select f (+ (- 1) N)))) (< i N)) (or (< (+ 2 j) N) (<= q2_back (+ q2_front 1)) (< i N)) (or (< (+ 2 j) N) (= (+ (select q2 q2_front) (select f j)) 0) (< i N))), 290463#(and (or (<= (+ j 1) N) (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)) (< i N)) (or (<= (+ j 1) N) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0) (< i N))), 290475#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (<= (+ q2_front 1) q2_back) (< i N)) (or (<= (+ (select q2 q2_front) total) (select f j)) (<= (+ 2 j) N) (< q1_front q1_back) (< i N)) (or (<= (+ 2 j) N) (< q1_front q1_back) (<= (select f j) (+ (select q2 q2_front) total)) (< i N)) (or (<= (+ 2 j) N) (< q1_front q1_back) (<= q2_back (+ q2_front 1)) (< i N))), 290490#(and (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 2 j) N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 3 j) N) (<= (+ q2_front 1) q2_back) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 3 j) N) (<= q2_back (+ q2_front 1)) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 3 j) N) (not (< (+ q1_front 1) q1_back)) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= (+ 3 j) N) (not (< (+ q1_front 1) q1_back)))), 290486#(and (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (< (+ q1_front 2) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (<= q2_front q2_back) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= q2_back q2_front) (<= (+ 3 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ 2 j) N) (< (+ q1_front 2) q1_back) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (< i N) (not (< (+ q1_front 1) q1_back)))), 290503#(and (or (< (+ 2 j) N) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N))) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ i 1) N) (<= (+ 2 j) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (< (+ i 1) N) (<= q2_back q2_front) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (< (+ i 1) N) (= (+ (select f j) (* (- 1) (select q1 q1_front))) 0) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (<= 0 total) (< (+ 2 j) N) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back)))) (or (< (+ 2 j) N) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))) (<= q2_front q2_back)) (or (< (+ 2 j) N) (<= total 0) (< (+ i 1) N) (not (< j N)) (not (= (- (select f j)) (select q2 q2_back))))), 290464#(and (or (<= (+ 2 j) N) (< q1_front q1_back) (<= (+ (select q2 q2_front) total) 0) (< i N)) (or (<= (+ 2 j) N) (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total)) (< i N))), 290492#(and (or (< (+ 2 j) N) (<= total (select f j)) (< i N)) (or (<= (+ 2 j) N) (< i N)) (or (< (+ 2 j) N) (<= (+ q2_front 1) q2_back) (< i N)) (or (< (+ 2 j) N) (<= (select f j) total) (< i N)) (or (< (+ 2 j) N) (<= q2_back (+ q2_front 1)) (< i N)) (or (< (+ 2 j) N) (= (+ (select q2 q2_front) (select f j)) 0) (< i N)) (or (< (+ 2 j) N) (= (select f (+ (- 1) N)) (select q1 q1_front)) (< i N))), 290512#(and (or (<= 0 total) (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (= (+ q2_back (* (- 1) q2_front)) 0) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (<= (+ 2 j) N)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select q1 (+ q1_front 1)) (select f (+ (- 1) N)))) (or (< (+ 2 j) N) (<= total 0) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N)) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (<= N i) (< (+ i 1) N) (= (select f j) (select q1 q1_front)))), 290484#(and (or (< (+ q1_front 2) q1_back) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f j)) (<= (+ 2 j) N) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (<= q2_back (+ q2_front 1)) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (<= (select f j) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< i N) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ 2 j) N) (<= (+ q2_front 1) q2_back) (< i N) (not (< (+ q1_front 1) q1_back)))), 290517#(and (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= q2_back (+ q2_front 1)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (+ q2_front 1) q2_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f j)) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (<= (select f j) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 290518#(and (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (+ q2_front 1) q2_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= q2_back (+ q2_front 1)) (not (< q1_front (+ q1_back 1)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (+ (select f j) (select f (+ (- 1) N)))) (not (< q1_front (+ q1_back 1)))) (or (< (+ 2 j) N) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select f j) (select f (+ (- 1) N))) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (<= (select f (+ j 1)) (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) (select f (+ j 1))) (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< q1_front q1_back) (<= (+ 3 j) N) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) (select f i))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 j) N) (< q1_front q1_back) (not (= (select f (+ i 1)) (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))))] [2022-03-15 22:04:18,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-03-15 22:04:18,471 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:18,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-03-15 22:04:18,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=998, Invalid=8704, Unknown=0, NotChecked=0, Total=9702 [2022-03-15 22:04:18,472 INFO L87 Difference]: Start difference. First operand 10873 states and 46444 transitions. Second operand has 82 states, 81 states have (on average 3.5185185185185186) internal successors, (285), 81 states have internal predecessors, (285), 0 states have call successors, (0), 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 22:10:49,064 WARN L244 SmtUtils]: Removed 43 from assertion stack [2022-03-15 22:10:49,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1142 states. [2022-03-15 22:10:49,090 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:10:49,090 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 22:10:49,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1388 GetRequests, 142 SyntacticMatches, 29 SemanticMatches, 1216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702419 ImplicationChecksByTransitivity, 378.4s TimeCoverageRelationStatistics Valid=155407, Invalid=1326899, Unknown=0, NotChecked=0, Total=1482306 [2022-03-15 22:10:49,151 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 6417 mSDsluCounter, 3659 mSDsCounter, 0 mSdLazyCounter, 17351 mSolverCounterSat, 4780 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6417 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 22131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4780 IncrementalHoareTripleChecker+Valid, 17351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:10:49,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6417 Valid, 1 Invalid, 22131 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4780 Valid, 17351 Invalid, 0 Unknown, 0 Unchecked, 13.5s Time] [2022-03-15 22:10:49,152 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (4 of 5 remaining) [2022-03-15 22:10:49,168 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 22:10:49,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:10:49,367 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (10873states) and FLOYD_HOARE automaton (currently 1142 states, 82 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 146 for 105ms.. [2022-03-15 22:10:49,369 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 5 remaining) [2022-03-15 22:10:49,369 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 5 remaining) [2022-03-15 22:10:49,369 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 5 remaining) [2022-03-15 22:10:49,369 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATION (0 of 5 remaining) [2022-03-15 22:10:49,370 INFO L732 BasicCegarLoop]: Path program histogram: [13, 2, 1, 1, 1, 1, 1, 1] [2022-03-15 22:10:49,372 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:10:49,372 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:10:49,373 INFO L202 PluginConnector]: Adding new model buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:10:49 BasicIcfg [2022-03-15 22:10:49,373 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:10:49,373 INFO L158 Benchmark]: Toolchain (without parser) took 853930.09ms. Allocated memory was 180.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 142.2MB in the beginning and 637.9MB in the end (delta: -495.7MB). Peak memory consumption was 602.9MB. Max. memory is 8.0GB. [2022-03-15 22:10:49,373 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 180.4MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:10:49,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.01ms. Allocated memory is still 180.4MB. Free memory was 142.2MB in the beginning and 140.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 22:10:49,374 INFO L158 Benchmark]: Boogie Preprocessor took 20.38ms. Allocated memory is still 180.4MB. Free memory was 140.6MB in the beginning and 139.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:10:49,374 INFO L158 Benchmark]: RCFGBuilder took 215.18ms. Allocated memory is still 180.4MB. Free memory was 139.6MB in the beginning and 129.0MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-15 22:10:49,374 INFO L158 Benchmark]: TraceAbstraction took 853670.80ms. Allocated memory was 180.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 128.5MB in the beginning and 637.9MB in the end (delta: -509.5MB). Peak memory consumption was 589.3MB. Max. memory is 8.0GB. [2022-03-15 22:10:49,374 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.10ms. Allocated memory is still 180.4MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.01ms. Allocated memory is still 180.4MB. Free memory was 142.2MB in the beginning and 140.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.38ms. Allocated memory is still 180.4MB. Free memory was 140.6MB in the beginning and 139.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 215.18ms. Allocated memory is still 180.4MB. Free memory was 139.6MB in the beginning and 129.0MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 853670.80ms. Allocated memory was 180.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 128.5MB in the beginning and 637.9MB in the end (delta: -509.5MB). Peak memory consumption was 589.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 44 PlacesBefore, 36 PlacesAfterwards, 35 TransitionsBefore, 27 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 559 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 347, positive: 319, positive conditional: 0, positive unconditional: 319, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 159, positive: 148, positive conditional: 0, positive unconditional: 148, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 347, positive: 171, positive conditional: 0, positive unconditional: 171, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 159, unknown conditional: 0, unknown unconditional: 159] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - 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: 82]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (10873states) and FLOYD_HOARE automaton (currently 1142 states, 82 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 146 for 105ms.. - TimeoutResultAtElement [Line: 73]: 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 (10873states) and FLOYD_HOARE automaton (currently 1142 states, 82 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 146 for 105ms.. - TimeoutResultAtElement [Line: 73]: 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 (10873states) and FLOYD_HOARE automaton (currently 1142 states, 82 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 146 for 105ms.. - TimeoutResultAtElement [Line: 74]: 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 (10873states) and FLOYD_HOARE automaton (currently 1142 states, 82 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 146 for 105ms.. - TimeoutResultAtElement [Line: 75]: 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 (10873states) and FLOYD_HOARE automaton (currently 1142 states, 82 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 146 for 105ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 54 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 853.5s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.2s, AutomataDifference: 736.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18598 SdHoareTripleChecker+Valid, 39.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18598 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 34.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12858 mSDsCounter, 11526 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56927 IncrementalHoareTripleChecker+Invalid, 68453 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11526 mSolverCounterUnsat, 101 mSDtfsCounter, 56927 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5959 GetRequests, 2776 SyntacticMatches, 154 SemanticMatches, 3028 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1240658 ImplicationChecksByTransitivity, 701.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10873occurred in iteration=20, InterpolantAutomatonStates: 1606, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 76194 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 864 NumberOfCodeBlocks, 864 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 1126 ConstructedInterpolants, 44 QuantifiedInterpolants, 12102 SizeOfPredicates, 74 NumberOfNonLiveVariables, 1448 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 48 InterpolantComputations, 9 PerfectInterpolantSequences, 207/423 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