/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/simple-array-sum.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:38:46,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:38:46,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:38:46,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:38:46,757 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:38:46,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:38:46,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:38:46,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:38:46,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:38:46,768 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:38:46,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:38:46,770 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:38:46,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:38:46,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:38:46,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:38:46,773 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:38:46,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:38:46,774 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:38:46,782 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:38:46,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:38:46,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:38:46,793 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:38:46,794 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:38:46,795 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:38:46,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:38:46,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:38:46,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:38:46,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:38:46,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:38:46,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:38:46,800 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:38:46,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:38:46,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:38:46,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:38:46,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:38:46,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:38:46,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:38:46,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:38:46,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:38:46,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:38:46,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:38:46,808 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:38:46,825 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:38:46,826 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:38:46,826 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:38:46,827 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:38:46,827 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:38:46,827 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:38:46,827 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:38:46,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:38:46,828 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:38:46,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:38:46,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:38:46,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:38:46,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:38:46,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:38:46,828 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:38:46,828 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:38:46,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:38:46,829 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:38:46,829 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:38:46,829 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:38:46,829 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:38:46,829 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:38:46,829 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:38:46,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:38:46,830 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:38:46,830 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:38:46,830 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:38:46,830 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:38:46,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:38:46,830 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:38:46,830 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:38:46,830 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:38:46,830 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:38:47,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:38:47,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:38:47,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:38:47,021 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:38:47,022 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:38:47,022 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl [2022-03-15 21:38:47,023 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl' [2022-03-15 21:38:47,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:38:47,049 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:38:47,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:38:47,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:38:47,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:38:47,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:38:47" (1/1) ... [2022-03-15 21:38:47,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:38:47" (1/1) ... [2022-03-15 21:38:47,068 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:38:47,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:38:47,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:38:47,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:38:47,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:38:47,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:38:47" (1/1) ... [2022-03-15 21:38:47,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:38:47" (1/1) ... [2022-03-15 21:38:47,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:38:47" (1/1) ... [2022-03-15 21:38:47,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:38:47" (1/1) ... [2022-03-15 21:38:47,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:38:47" (1/1) ... [2022-03-15 21:38:47,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:38:47" (1/1) ... [2022-03-15 21:38:47,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:38:47" (1/1) ... [2022-03-15 21:38:47,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:38:47,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:38:47,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:38:47,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:38:47,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:38:47" (1/1) ... [2022-03-15 21:38:47,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:38:47,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:38:47,120 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:38:47,139 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:38:47,160 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:38:47,161 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:38:47,161 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:38:47,161 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:38:47,161 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:38:47,161 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:38:47,161 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:38:47,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:38:47,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:38:47,162 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 21:38:47,163 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 21:38:47,163 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 21:38:47,164 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:38:47,212 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:38:47,214 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:38:47,314 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:38:47,337 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:38:47,337 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 21:38:47,339 INFO L202 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:38:47 BoogieIcfgContainer [2022-03-15 21:38:47,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:38:47,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:38:47,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:38:47,347 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:38:47,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:38:47" (1/2) ... [2022-03-15 21:38:47,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3272a789 and model type simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:38:47, skipping insertion in model container [2022-03-15 21:38:47,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:38:47" (2/2) ... [2022-03-15 21:38:47,351 INFO L111 eAbstractionObserver]: Analyzing ICFG simple-array-sum.wvr.bpl [2022-03-15 21:38:47,356 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:38:47,356 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:38:47,357 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:38:47,357 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:38:47,411 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 21:38:47,462 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:38:47,475 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:38:47,476 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 21:38:47,489 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:38:47,498 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 82 flow [2022-03-15 21:38:47,501 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 82 flow [2022-03-15 21:38:47,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 82 flow [2022-03-15 21:38:47,521 INFO L129 PetriNetUnfolder]: 4/26 cut-off events. [2022-03-15 21:38:47,521 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 21:38:47,527 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2022-03-15 21:38:47,528 INFO L116 LiptonReduction]: Number of co-enabled transitions 184 [2022-03-15 21:38:47,719 INFO L131 LiptonReduction]: Checked pairs total: 178 [2022-03-15 21:38:47,719 INFO L133 LiptonReduction]: Total number of compositions: 11 [2022-03-15 21:38:47,724 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 20 transitions, 64 flow [2022-03-15 21:38:47,737 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 31 states, 30 states have (on average 2.9) internal successors, (87), 30 states have internal predecessors, (87), 0 states have call successors, (0), 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:38:47,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 30 states have (on average 2.9) internal successors, (87), 30 states have internal predecessors, (87), 0 states have call successors, (0), 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:38:47,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 21:38:47,743 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:38:47,744 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:38:47,744 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:38:47,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:38:47,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1948247448, now seen corresponding path program 1 times [2022-03-15 21:38:47,762 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:38:47,763 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008793177] [2022-03-15 21:38:47,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:38:47,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:38:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:38:48,109 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:38:48,109 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:38:48,109 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008793177] [2022-03-15 21:38:48,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008793177] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:38:48,110 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:38:48,110 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 21:38:48,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [243835894] [2022-03-15 21:38:48,112 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:38:48,115 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:38:48,143 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 21:38:48,144 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:38:48,836 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [104#(and (or (= asum 0) (< i N)) (or (<= N 0) (< i N)) (or (= csum (+ N asum)) (< i N)) (or (<= 0 N) (< i N)))] [2022-03-15 21:38:48,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 21:38:48,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:38:48,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 21:38:48,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:38:48,866 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 2.9) internal successors, (87), 30 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:48,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:38:48,939 INFO L93 Difference]: Finished difference Result 59 states and 171 transitions. [2022-03-15 21:38:48,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 21:38:48,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 21:38:48,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:38:48,951 INFO L225 Difference]: With dead ends: 59 [2022-03-15 21:38:48,951 INFO L226 Difference]: Without dead ends: 53 [2022-03-15 21:38:48,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:38:48,959 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:38:48,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:38:48,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-03-15 21:38:48,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2022-03-15 21:38:48,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 3.022222222222222) internal successors, (136), 45 states have internal predecessors, (136), 0 states have call successors, (0), 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:38:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 136 transitions. [2022-03-15 21:38:48,996 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 136 transitions. Word has length 11 [2022-03-15 21:38:48,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:38:48,997 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 136 transitions. [2022-03-15 21:38:48,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:48,997 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 136 transitions. [2022-03-15 21:38:48,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 21:38:48,998 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:38:48,998 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:38:48,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:38:48,999 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:38:48,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:38:49,000 INFO L85 PathProgramCache]: Analyzing trace with hash -175336723, now seen corresponding path program 1 times [2022-03-15 21:38:49,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:38:49,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620948072] [2022-03-15 21:38:49,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:38:49,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:38:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:38:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:49,031 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:38:49,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620948072] [2022-03-15 21:38:49,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620948072] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:38:49,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978157217] [2022-03-15 21:38:49,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:38:49,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:38:49,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:38:49,034 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:38:49,065 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:38:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:38:49,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 21:38:49,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:38:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:49,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:38:49,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:49,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978157217] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:38:49,139 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:38:49,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-03-15 21:38:49,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1547915627] [2022-03-15 21:38:49,140 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:38:49,142 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:38:49,144 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 21:38:49,145 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:38:49,440 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [329#(or (<= N i) (< (+ i 1) N)), 328#(or (< k N) (< i N)), 327#(< i N), 330#(or (<= N i) (< (+ i 1) N) (< k N))] [2022-03-15 21:38:49,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:38:49,441 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:38:49,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:38:49,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:38:49,442 INFO L87 Difference]: Start difference. First operand 46 states and 136 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:49,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:38:49,684 INFO L93 Difference]: Finished difference Result 145 states and 414 transitions. [2022-03-15 21:38:49,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 21:38:49,685 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 21:38:49,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:38:49,690 INFO L225 Difference]: With dead ends: 145 [2022-03-15 21:38:49,690 INFO L226 Difference]: Without dead ends: 145 [2022-03-15 21:38:49,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-03-15 21:38:49,693 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 65 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:38:49,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 0 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:38:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-03-15 21:38:49,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 83. [2022-03-15 21:38:49,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 3.268292682926829) internal successors, (268), 82 states have internal predecessors, (268), 0 states have call successors, (0), 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:38:49,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 268 transitions. [2022-03-15 21:38:49,716 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 268 transitions. Word has length 12 [2022-03-15 21:38:49,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:38:49,717 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 268 transitions. [2022-03-15 21:38:49,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:49,717 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 268 transitions. [2022-03-15 21:38:49,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 21:38:49,718 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:38:49,718 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:38:49,747 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:38:49,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:38:49,944 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:38:49,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:38:49,944 INFO L85 PathProgramCache]: Analyzing trace with hash 711270534, now seen corresponding path program 1 times [2022-03-15 21:38:49,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:38:49,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883610785] [2022-03-15 21:38:49,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:38:49,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:38:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:38:49,979 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:38:49,980 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:38:49,980 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883610785] [2022-03-15 21:38:49,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883610785] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:38:49,980 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505831494] [2022-03-15 21:38:49,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:38:49,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:38:49,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:38:49,982 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:38:49,984 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:38:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:38:50,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 21:38:50,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:38:50,052 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:38:50,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:38:50,082 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:38:50,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505831494] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:38:50,082 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:38:50,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-03-15 21:38:50,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1159316200] [2022-03-15 21:38:50,083 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:38:50,084 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:38:50,090 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 79 transitions. [2022-03-15 21:38:50,090 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:38:50,517 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [729#(< i N), 730#(or (<= (+ l 1) N) (< i N)), 732#(or (<= N i) (< (+ i 1) N) (< l N)), 731#(or (<= N i) (< (+ i 1) N))] [2022-03-15 21:38:50,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:38:50,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:38:50,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:38:50,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:38:50,520 INFO L87 Difference]: Start difference. First operand 83 states and 268 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 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:38:50,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:38:50,715 INFO L93 Difference]: Finished difference Result 180 states and 549 transitions. [2022-03-15 21:38:50,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 21:38:50,716 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 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 13 [2022-03-15 21:38:50,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:38:50,717 INFO L225 Difference]: With dead ends: 180 [2022-03-15 21:38:50,717 INFO L226 Difference]: Without dead ends: 180 [2022-03-15 21:38:50,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:38:50,719 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:38:50,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:38:50,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-03-15 21:38:50,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 112. [2022-03-15 21:38:50,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 3.2972972972972974) internal successors, (366), 111 states have internal predecessors, (366), 0 states have call successors, (0), 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:38:50,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 366 transitions. [2022-03-15 21:38:50,731 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 366 transitions. Word has length 13 [2022-03-15 21:38:50,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:38:50,732 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 366 transitions. [2022-03-15 21:38:50,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 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:38:50,732 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 366 transitions. [2022-03-15 21:38:50,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 21:38:50,736 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:38:50,736 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:38:50,759 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:38:50,936 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,SelfDestructingSolverStorable2 [2022-03-15 21:38:50,937 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:38:50,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:38:50,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1600517744, now seen corresponding path program 2 times [2022-03-15 21:38:50,939 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:38:50,939 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813556355] [2022-03-15 21:38:50,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:38:50,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:38:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:38:50,985 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:38:50,986 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:38:50,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813556355] [2022-03-15 21:38:50,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813556355] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:38:50,987 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:38:50,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 21:38:50,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [149656729] [2022-03-15 21:38:50,987 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:38:50,988 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:38:50,992 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 68 transitions. [2022-03-15 21:38:50,992 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:38:51,227 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [1159#(or (<= N i) (< k N)), 1157#(< k N), 1160#(and (or (< k N) (<= N l)) (or (< k N) (= (+ l (* (- 1) i)) 0))), 1156#(< l N), 1158#(or (< k N) (< l N))] [2022-03-15 21:38:51,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 21:38:51,228 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:38:51,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 21:38:51,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-15 21:38:51,229 INFO L87 Difference]: Start difference. First operand 112 states and 366 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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:38:51,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:38:51,412 INFO L93 Difference]: Finished difference Result 85 states and 254 transitions. [2022-03-15 21:38:51,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 21:38:51,413 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 21:38:51,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:38:51,413 INFO L225 Difference]: With dead ends: 85 [2022-03-15 21:38:51,413 INFO L226 Difference]: Without dead ends: 73 [2022-03-15 21:38:51,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:38:51,415 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:38:51,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 0 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:38:51,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-03-15 21:38:51,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2022-03-15 21:38:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 3.208955223880597) internal successors, (215), 67 states have internal predecessors, (215), 0 states have call successors, (0), 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:38:51,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 215 transitions. [2022-03-15 21:38:51,420 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 215 transitions. Word has length 13 [2022-03-15 21:38:51,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:38:51,420 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 215 transitions. [2022-03-15 21:38:51,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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:38:51,421 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 215 transitions. [2022-03-15 21:38:51,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:38:51,421 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:38:51,421 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:38:51,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 21:38:51,422 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:38:51,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:38:51,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1057341352, now seen corresponding path program 1 times [2022-03-15 21:38:51,427 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:38:51,428 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808296160] [2022-03-15 21:38:51,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:38:51,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:38:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:38:51,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:51,570 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:38:51,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808296160] [2022-03-15 21:38:51,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808296160] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:38:51,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972937402] [2022-03-15 21:38:51,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:38:51,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:38:51,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:38:51,576 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:38:51,584 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:38:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:38:51,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 21:38:51,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:38:51,750 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 18 treesize of output 14 [2022-03-15 21:38:51,756 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2022-03-15 21:38:51,822 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 21:38:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:51,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:38:51,924 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 29 treesize of output 27 [2022-03-15 21:38:51,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:38:51,981 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:38:51,982 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 30 treesize of output 31 [2022-03-15 21:38:52,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:52,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972937402] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:38:52,057 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:38:52,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-03-15 21:38:52,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1244604095] [2022-03-15 21:38:52,057 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:38:52,058 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:38:52,065 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 108 transitions. [2022-03-15 21:38:52,065 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:38:54,392 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [1503#(and (or (< (+ l 1) N) (not (< l N)) (< (+ (select C l) csum) (+ N asum 1))) (or (< (+ l 1) N) (<= (+ N asum) (+ (select C l) csum)) (<= N l))), 1509#(and (or (not (< k N)) (<= (+ N asum) (+ csum (select A k) 1)) (< (+ k 1) N) (not (= l k)) (< i N)) (or (not (< k N)) (<= (+ csum (select A k) 1) (+ N asum)) (< (+ k 1) N) (not (= l k)) (< i N)) (or (not (< k N)) (= l k) (<= (+ (select C l) csum) (+ N asum)) (< (+ k 1) N) (< i N)) (or (not (< k N)) (= l k) (<= (+ N asum) (+ (select C l) csum)) (< (+ k 1) N) (< i N))), 1496#(and (or (<= (+ N asum) csum) (< l N)) (or (< l N) (< csum (+ N asum 1)))), 1511#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ csum (select A k) 1) (+ (select A i) N asum))) (or (< (+ i 1) N) (<= (+ (select A i) N asum) (+ csum (select A k) 1)) (not (< i N))) (or (= l k) (< (+ i 1) N) (not (< i N)))), 1495#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select C l) csum) (+ (select A i) N asum))) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) (+ (select C l) csum)))), 1498#(and (or (< (+ l 1) N) (<= (+ N asum) (+ (select C l) csum))) (or (< (+ l 1) N) (< (+ (select C l) csum) (+ N asum 1)))), 1497#(and (or (< k N) (<= (+ N asum) csum) (< l N)) (or (< k N) (< l N) (< csum (+ N asum 1)))), 1501#(and (or (< k N) (<= (+ N asum) csum) (< i N)) (or (< k N) (< i N) (< csum (+ N asum 1)))), 1505#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) csum) (< k N)) (or (< (+ i 1) N) (not (< i N)) (< k N) (< csum (+ (select A i) N asum 1)))), 1491#(and (or (< k N) (<= (+ N asum) csum)) (or (< k N) (< csum (+ N asum 1)))), 1502#(and (or (< k N) (<= (+ N asum) (+ (select C l) csum)) (< i N)) (or (<= (+ (select C l) csum) (+ N asum)) (< k N) (< i N))), 1506#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (<= (+ (select A i) N asum) (+ (select C l) csum))) (or (< (+ i 1) N) (not (< i N)) (< k N) (<= (+ (select C l) csum) (+ (select A i) N asum)))), 1510#(and (or (not (< k N)) (< (+ i 1) N) (and (<= (+ (select C l) csum) (+ (select A i) N asum)) (not (= l k))) (not (< i N)) (and (= l k) (<= (+ csum (select A k) 1) (+ (select A i) N asum))) (< (+ k 1) N)) (or (not (< k N)) (< (+ i 1) N) (not (< i N)) (and (not (= l k)) (<= (+ (select A i) N asum) (+ (select C l) csum))) (< (+ k 1) N) (and (= l k) (<= (+ (select A i) N asum) (+ csum (select A k) 1))))), 1494#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) csum)) (or (< (+ i 1) N) (not (< i N)) (< csum (+ (select A i) N asum 1)))), 1499#(and (or (< (+ l 1) N) (< (+ (select C l) csum) (+ N asum 1)) (< k N)) (or (< (+ l 1) N) (< k N) (<= (+ N asum) (+ (select C l) csum)))), 1493#(and (or (<= (+ (select C l) csum) (+ N asum)) (< i N)) (or (<= (+ N asum) (+ (select C l) csum)) (< i N))), 1492#(and (or (<= (+ N asum) csum) (< i N)) (or (< i N) (< csum (+ N asum 1)))), 1483#(or (and (= l k) (<= (+ N asum) (+ csum (select A k) 1)) (<= (+ csum (select A k) 1) (+ N asum))) (< i N)), 1504#(and (or (< (+ l 1) N) (< k N) (<= (+ N asum) (+ (select C l) csum)) (<= N l)) (or (< (+ l 1) N) (not (< l N)) (< (+ (select C l) csum) (+ N asum 1)) (< k N))), 1507#(and (or (not (< k N)) (< (+ l 1) N) (<= (+ N asum) (+ csum (select A k) 1)) (< (+ k 1) N) (<= N l)) (or (not (< k N)) (< (+ l 1) N) (not (< l N)) (< (+ csum (select A k)) (+ N asum)) (< (+ k 1) N))), 1508#(and (or (and (= l k) (<= (+ N asum) (+ csum (select A k) 1))) (not (< k N)) (< (+ k 1) N) (and (<= (+ N asum) (+ (select C l) csum)) (not (= l k)))) (or (not (< k N)) (and (<= (+ (select C l) csum) (+ N asum)) (not (= l k))) (< (+ k 1) N) (and (= l k) (<= (+ csum (select A k) 1) (+ N asum))))), 1500#(and (or (<= (+ (select C l) csum) (+ N asum)) (< k N)) (or (< k N) (<= (+ N asum) (+ (select C l) csum))))] [2022-03-15 21:38:54,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 21:38:54,393 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:38:54,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 21:38:54,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 21:38:54,394 INFO L87 Difference]: Start difference. First operand 68 states and 215 transitions. Second operand has 29 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 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:39:11,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:39:11,817 INFO L93 Difference]: Finished difference Result 1069 states and 3352 transitions. [2022-03-15 21:39:11,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2022-03-15 21:39:11,818 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:39:11,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:39:11,824 INFO L225 Difference]: With dead ends: 1069 [2022-03-15 21:39:11,824 INFO L226 Difference]: Without dead ends: 987 [2022-03-15 21:39:11,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16823 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=5150, Invalid=39582, Unknown=0, NotChecked=0, Total=44732 [2022-03-15 21:39:11,834 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1047 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 2934 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 2934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:39:11,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1047 Valid, 0 Invalid, 3119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 2934 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 21:39:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2022-03-15 21:39:11,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 166. [2022-03-15 21:39:11,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 3.6484848484848484) internal successors, (602), 165 states have internal predecessors, (602), 0 states have call successors, (0), 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:39:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 602 transitions. [2022-03-15 21:39:11,854 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 602 transitions. Word has length 15 [2022-03-15 21:39:11,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:39:11,854 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 602 transitions. [2022-03-15 21:39:11,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 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:39:11,855 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 602 transitions. [2022-03-15 21:39:11,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:39:11,856 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:39:11,856 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:39:11,883 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:39:12,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:12,076 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:39:12,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:39:12,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1489249960, now seen corresponding path program 2 times [2022-03-15 21:39:12,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:39:12,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374169605] [2022-03-15 21:39:12,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:39:12,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:39:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:12,105 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:39:12,105 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:39:12,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374169605] [2022-03-15 21:39:12,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374169605] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:39:12,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766499703] [2022-03-15 21:39:12,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:39:12,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:12,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:39:12,107 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:39:12,112 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:39:12,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:39:12,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:39:12,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 21:39:12,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:39:12,158 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:39:12,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 21:39:12,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766499703] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:39:12,159 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 21:39:12,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2022-03-15 21:39:12,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1317780566] [2022-03-15 21:39:12,159 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:39:12,160 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:39:12,164 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 77 transitions. [2022-03-15 21:39:12,165 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:39:12,325 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:39:12,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:39:12,325 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:39:12,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:39:12,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:39:12,326 INFO L87 Difference]: Start difference. First operand 166 states and 602 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:12,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:39:12,345 INFO L93 Difference]: Finished difference Result 162 states and 557 transitions. [2022-03-15 21:39:12,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:39:12,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:39:12,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:39:12,346 INFO L225 Difference]: With dead ends: 162 [2022-03-15 21:39:12,346 INFO L226 Difference]: Without dead ends: 151 [2022-03-15 21:39:12,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:39:12,347 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:39:12,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 0 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:39:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-03-15 21:39:12,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 141. [2022-03-15 21:39:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 3.35) internal successors, (469), 140 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:12,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 469 transitions. [2022-03-15 21:39:12,354 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 469 transitions. Word has length 15 [2022-03-15 21:39:12,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:39:12,354 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 469 transitions. [2022-03-15 21:39:12,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 469 transitions. [2022-03-15 21:39:12,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:39:12,355 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:39:12,356 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:39:12,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 21:39:12,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:12,572 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:39:12,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:39:12,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1448152319, now seen corresponding path program 3 times [2022-03-15 21:39:12,573 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:39:12,573 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570624500] [2022-03-15 21:39:12,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:39:12,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:39:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:12,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:39:12,628 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:39:12,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570624500] [2022-03-15 21:39:12,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570624500] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:39:12,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705155424] [2022-03-15 21:39:12,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:39:12,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:12,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:39:12,631 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:39:12,632 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:39:12,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:39:12,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:39:12,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:39:12,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:39:12,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:39:12,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:39:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:39:12,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705155424] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:39:12,730 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:39:12,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-03-15 21:39:12,731 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1975893532] [2022-03-15 21:39:12,731 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:39:12,733 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:39:12,740 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 21:39:12,740 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:39:13,403 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [3860#(or (<= (+ 2 k) N) (<= N k)), 3862#(or (<= N i) (< (+ i 1) N) (<= N k) (< (+ k 1) N)), 3856#(or (<= N i) (< (+ i 1) N)), 3857#(or (<= N (+ i 1)) (< (+ 2 i) N)), 3859#(or (<= N i) (< (+ i 1) N) (< k N)), 3865#(<= N i), 3861#(or (<= (+ 2 k) N) (<= N k) (< i N)), 3864#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 3855#(< i N), 3866#(<= N (+ i 1)), 3867#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k) (< (+ k 1) N)), 3858#(or (< k N) (< i N)), 3863#(or (<= (+ k 1) i) (<= N k))] [2022-03-15 21:39:13,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 21:39:13,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:39:13,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 21:39:13,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2022-03-15 21:39:13,404 INFO L87 Difference]: Start difference. First operand 141 states and 469 transitions. Second operand has 19 states, 19 states have (on average 4.052631578947368) internal successors, (77), 18 states have internal predecessors, (77), 0 states have call successors, (0), 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:39:13,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:39:13,898 INFO L93 Difference]: Finished difference Result 380 states and 1237 transitions. [2022-03-15 21:39:13,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 21:39:13,898 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.052631578947368) internal successors, (77), 18 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:39:13,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:39:13,901 INFO L225 Difference]: With dead ends: 380 [2022-03-15 21:39:13,901 INFO L226 Difference]: Without dead ends: 377 [2022-03-15 21:39:13,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=332, Invalid=1074, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 21:39:13,902 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 296 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:39:13,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 0 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:39:13,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-03-15 21:39:13,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 235. [2022-03-15 21:39:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 3.551282051282051) internal successors, (831), 234 states have internal predecessors, (831), 0 states have call successors, (0), 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:39:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 831 transitions. [2022-03-15 21:39:13,913 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 831 transitions. Word has length 16 [2022-03-15 21:39:13,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:39:13,914 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 831 transitions. [2022-03-15 21:39:13,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.052631578947368) internal successors, (77), 18 states have internal predecessors, (77), 0 states have call successors, (0), 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:39:13,914 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 831 transitions. [2022-03-15 21:39:13,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:39:13,916 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:39:13,916 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:39:13,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 21:39:14,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:14,131 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:39:14,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:39:14,131 INFO L85 PathProgramCache]: Analyzing trace with hash -405589318, now seen corresponding path program 4 times [2022-03-15 21:39:14,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:39:14,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303213513] [2022-03-15 21:39:14,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:39:14,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:39:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:39:14,184 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:39:14,184 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303213513] [2022-03-15 21:39:14,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303213513] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:39:14,184 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304155383] [2022-03-15 21:39:14,184 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:39:14,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:14,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:39:14,186 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:39:14,187 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:39:14,213 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:39:14,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:39:14,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:39:14,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:39:14,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:39:14,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:39:14,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:39:14,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304155383] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:39:14,282 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:39:14,282 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-03-15 21:39:14,282 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1970156863] [2022-03-15 21:39:14,283 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:39:14,284 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:39:14,291 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 158 transitions. [2022-03-15 21:39:14,291 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:39:15,210 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [4863#(or (<= N (+ i 1)) (< (+ 2 i) N)), 4868#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 l) N)), 4867#(or (<= (+ 2 l) N) (<= N l)), 4861#(or (<= (+ 2 l) N) (< i N)), 4864#(or (<= N i) (< (+ i 1) N) (< l N)), 4866#(or (<= N i) (< (+ i 1) N) (<= (+ 2 l) N)), 4860#(or (<= (+ l 1) N) (< i N)), 4859#(< i N), 4865#(or (<= N (+ i 1)) (< (+ 2 i) N) (< l N)), 4862#(or (<= N i) (< (+ i 1) N))] [2022-03-15 21:39:15,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:39:15,211 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:39:15,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:39:15,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-03-15 21:39:15,212 INFO L87 Difference]: Start difference. First operand 235 states and 831 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 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:39:15,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:39:15,678 INFO L93 Difference]: Finished difference Result 613 states and 2253 transitions. [2022-03-15 21:39:15,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 21:39:15,679 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:39:15,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:39:15,683 INFO L225 Difference]: With dead ends: 613 [2022-03-15 21:39:15,683 INFO L226 Difference]: Without dead ends: 608 [2022-03-15 21:39:15,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 75 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=1037, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 21:39:15,685 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 127 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:39:15,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 0 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:39:15,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-03-15 21:39:15,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 445. [2022-03-15 21:39:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 3.9662162162162162) internal successors, (1761), 444 states have internal predecessors, (1761), 0 states have call successors, (0), 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:39:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1761 transitions. [2022-03-15 21:39:15,701 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1761 transitions. Word has length 17 [2022-03-15 21:39:15,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:39:15,701 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 1761 transitions. [2022-03-15 21:39:15,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 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:39:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1761 transitions. [2022-03-15 21:39:15,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:39:15,703 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:39:15,704 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:39:15,724 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:39:15,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:15,920 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:39:15,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:39:15,920 INFO L85 PathProgramCache]: Analyzing trace with hash 113685418, now seen corresponding path program 5 times [2022-03-15 21:39:15,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:39:15,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024283367] [2022-03-15 21:39:15,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:39:15,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:39:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:15,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:39:15,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:39:15,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024283367] [2022-03-15 21:39:15,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024283367] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:39:15,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706576451] [2022-03-15 21:39:15,966 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:39:15,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:15,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:39:15,967 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:39:15,998 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:39:16,005 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:39:16,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:39:16,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:39:16,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:39:16,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:39:16,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:39:16,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:39:16,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706576451] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:39:16,077 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:39:16,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-03-15 21:39:16,077 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1322906488] [2022-03-15 21:39:16,077 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:39:16,078 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:39:16,083 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 148 transitions. [2022-03-15 21:39:16,084 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:39:16,716 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [6525#(or (<= N i) (< (+ i 1) N) (<= N l)), 6519#(or (< (+ l 1) N) (<= N l)), 6526#(or (<= N (+ l 1)) (<= N i) (< (+ i 1) N)), 6522#(or (<= N l) (< i N)), 6523#(or (<= N (+ l 1)) (< i N)), 6517#(< l N), 6518#(< (+ l 1) N), 6524#(or (<= N i) (< (+ i 1) N)), 6520#(or (< (+ 2 l) N) (<= N (+ l 1))), 6521#(< i N)] [2022-03-15 21:39:16,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:39:16,717 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:39:16,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:39:16,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-03-15 21:39:16,717 INFO L87 Difference]: Start difference. First operand 445 states and 1761 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 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:39:17,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:39:17,216 INFO L93 Difference]: Finished difference Result 756 states and 2670 transitions. [2022-03-15 21:39:17,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 21:39:17,216 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 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 17 [2022-03-15 21:39:17,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:39:17,220 INFO L225 Difference]: With dead ends: 756 [2022-03-15 21:39:17,220 INFO L226 Difference]: Without dead ends: 704 [2022-03-15 21:39:17,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=1068, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 21:39:17,221 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 175 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:39:17,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 0 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:39:17,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-03-15 21:39:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 472. [2022-03-15 21:39:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 3.7643312101910826) internal successors, (1773), 471 states have internal predecessors, (1773), 0 states have call successors, (0), 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:39:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1773 transitions. [2022-03-15 21:39:17,238 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1773 transitions. Word has length 17 [2022-03-15 21:39:17,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:39:17,238 INFO L470 AbstractCegarLoop]: Abstraction has 472 states and 1773 transitions. [2022-03-15 21:39:17,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 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:39:17,239 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1773 transitions. [2022-03-15 21:39:17,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:39:17,240 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:39:17,240 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:39:17,258 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:39:17,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:17,451 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:39:17,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:39:17,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1370896696, now seen corresponding path program 6 times [2022-03-15 21:39:17,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:39:17,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207252424] [2022-03-15 21:39:17,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:39:17,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:39:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:39:17,488 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:39:17,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207252424] [2022-03-15 21:39:17,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207252424] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:39:17,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780909028] [2022-03-15 21:39:17,488 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:39:17,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:17,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:39:17,489 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:39:17,490 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:39:17,516 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:39:17,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:39:17,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:39:17,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:39:17,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:39:17,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:39:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:39:17,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780909028] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:39:17,567 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:39:17,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-03-15 21:39:17,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2000932164] [2022-03-15 21:39:17,568 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:39:17,569 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:39:17,574 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 138 transitions. [2022-03-15 21:39:17,574 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:39:18,261 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [8367#(< k N), 8384#(or (<= N i) (< (+ i 1) N) (<= (+ N 1) k)), 8370#(or (<= N (+ 2 k)) (< (+ 3 k) N)), 8379#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N) (< (+ 2 k) N)), 8375#(or (<= N k) (< (+ k 1) N) (< i N)), 8385#(or (<= N i) (< (+ i 1) N) (<= N k)), 8383#(or (<= N (+ k 1)) (< i N)), 8374#(or (<= N i) (< (+ i 1) N) (< k N)), 8382#(or (<= N k) (< i N)), 8368#(or (<= N k) (< (+ k 1) N)), 8381#(or (<= (+ N 1) k) (< i N)), 8372#(or (<= N i) (< (+ i 1) N)), 8376#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 8373#(or (< k N) (< i N)), 8378#(or (<= N i) (< (+ i 1) N) (<= N k) (< (+ k 1) N)), 8369#(or (<= N (+ k 1)) (< (+ 2 k) N)), 8371#(< i N), 8380#(or (<= N i) (< (+ i 1) N) (<= N (+ 2 k)) (< (+ 3 k) N)), 8377#(or (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)), 8386#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N))] [2022-03-15 21:39:18,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:39:18,261 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:39:18,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:39:18,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:39:18,262 INFO L87 Difference]: Start difference. First operand 472 states and 1773 transitions. Second operand has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 26 states have internal predecessors, (88), 0 states have call successors, (0), 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:39:18,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:39:18,908 INFO L93 Difference]: Finished difference Result 884 states and 3094 transitions. [2022-03-15 21:39:18,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 21:39:18,908 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 26 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:39:18,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:39:18,913 INFO L225 Difference]: With dead ends: 884 [2022-03-15 21:39:18,913 INFO L226 Difference]: Without dead ends: 859 [2022-03-15 21:39:18,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=478, Invalid=1592, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 21:39:18,915 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 447 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:39:18,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [447 Valid, 0 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:39:18,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2022-03-15 21:39:18,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 647. [2022-03-15 21:39:18,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 3.763157894736842) internal successors, (2431), 646 states have internal predecessors, (2431), 0 states have call successors, (0), 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:39:18,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 2431 transitions. [2022-03-15 21:39:18,937 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 2431 transitions. Word has length 17 [2022-03-15 21:39:18,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:39:18,937 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 2431 transitions. [2022-03-15 21:39:18,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 26 states have internal predecessors, (88), 0 states have call successors, (0), 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:39:18,938 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 2431 transitions. [2022-03-15 21:39:18,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:39:18,940 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:39:18,940 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:39:18,963 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:39:19,163 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,SelfDestructingSolverStorable9 [2022-03-15 21:39:19,163 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:39:19,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:39:19,164 INFO L85 PathProgramCache]: Analyzing trace with hash 63851647, now seen corresponding path program 7 times [2022-03-15 21:39:19,165 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:39:19,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842456726] [2022-03-15 21:39:19,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:39:19,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:39:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:19,196 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:39:19,196 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:39:19,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842456726] [2022-03-15 21:39:19,196 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842456726] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:39:19,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678636131] [2022-03-15 21:39:19,197 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:39:19,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:19,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:39:19,198 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:39:19,198 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:39:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:19,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:39:19,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:39:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:39:19,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:39:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:39:19,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678636131] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:39:19,305 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:39:19,305 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-03-15 21:39:19,305 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [229547470] [2022-03-15 21:39:19,305 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:39:19,306 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:39:19,313 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 193 transitions. [2022-03-15 21:39:19,313 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:39:20,428 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [10717#(or (<= (+ 2 l) N) (<= N k) (< (+ k 1) N)), 10716#(or (<= N (+ k 1)) (<= (+ 2 l) N) (< (+ 2 k) N) (<= N l)), 10713#(or (<= (+ 2 l) N) (< k N)), 10715#(or (<= (+ 2 l) N) (<= N k) (< (+ k 1) N) (<= N l)), 10714#(or (<= (+ 2 l) N) (< k N) (<= N l)), 10710#(or (<= (+ 2 l) N) (<= N l)), 10712#(or (< k N) (< l N)), 10711#(< k N), 10718#(or (<= N (+ k 1)) (<= (+ 2 l) N) (< (+ 2 k) N))] [2022-03-15 21:39:20,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 21:39:20,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:39:20,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 21:39:20,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:39:20,429 INFO L87 Difference]: Start difference. First operand 647 states and 2431 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 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:39:20,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:39:20,779 INFO L93 Difference]: Finished difference Result 1690 states and 6145 transitions. [2022-03-15 21:39:20,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 21:39:20,780 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have 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:39:20,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:39:20,788 INFO L225 Difference]: With dead ends: 1690 [2022-03-15 21:39:20,788 INFO L226 Difference]: Without dead ends: 1678 [2022-03-15 21:39:20,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 86 SyntacticMatches, 13 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2022-03-15 21:39:20,789 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:39:20,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:39:20,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2022-03-15 21:39:20,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 968. [2022-03-15 21:39:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 967 states have (on average 4.005170630816959) internal successors, (3873), 967 states have internal predecessors, (3873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:20,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 3873 transitions. [2022-03-15 21:39:20,821 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 3873 transitions. Word has length 18 [2022-03-15 21:39:20,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:39:20,821 INFO L470 AbstractCegarLoop]: Abstraction has 968 states and 3873 transitions. [2022-03-15 21:39:20,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 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:39:20,822 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 3873 transitions. [2022-03-15 21:39:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:39:20,824 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:39:20,824 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:39:20,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-15 21:39:21,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:21,035 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:39:21,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:39:21,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1156853987, now seen corresponding path program 8 times [2022-03-15 21:39:21,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:39:21,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511733024] [2022-03-15 21:39:21,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:39:21,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:39:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:21,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:39:21,070 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:39:21,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511733024] [2022-03-15 21:39:21,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511733024] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:39:21,071 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190378719] [2022-03-15 21:39:21,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:39:21,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:21,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:39:21,072 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:39:21,080 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:39:21,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:39:21,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:39:21,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:39:21,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:39:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:39:21,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:39:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:39:21,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190378719] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:39:21,158 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:39:21,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2022-03-15 21:39:21,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1261703609] [2022-03-15 21:39:21,158 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:39:21,159 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:39:21,165 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 144 transitions. [2022-03-15 21:39:21,165 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:39:21,742 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [14479#(< k N), 14483#(or (<= N k) (< (+ k 1) N) (< l N)), 14485#(or (< (+ l 1) N) (<= N k) (< (+ k 1) N)), 14481#(< l N), 14480#(or (<= N k) (< (+ k 1) N)), 14484#(or (<= N k) (< l N)), 14487#(or (< (+ l 1) N) (not (< l N)) (not (< l p)) (<= N k) (< (+ k 1) N)), 14488#(or (< (+ l 1) N) (not (< l N)) (not (< l p)) (<= N k)), 14486#(or (< (+ l 1) N) (<= N k)), 14482#(or (< k N) (< l N))] [2022-03-15 21:39:21,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:39:21,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:39:21,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:39:21,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:39:21,743 INFO L87 Difference]: Start difference. First operand 968 states and 3873 transitions. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 0 states have call successors, (0), 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:39:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:39:21,859 INFO L93 Difference]: Finished difference Result 1023 states and 3729 transitions. [2022-03-15 21:39:21,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:39:21,859 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have 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:39:21,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:39:21,864 INFO L225 Difference]: With dead ends: 1023 [2022-03-15 21:39:21,865 INFO L226 Difference]: Without dead ends: 967 [2022-03-15 21:39:21,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2022-03-15 21:39:21,866 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:39:21,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:39:21,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2022-03-15 21:39:21,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 737. [2022-03-15 21:39:21,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 736 states have (on average 3.671195652173913) internal successors, (2702), 736 states have internal predecessors, (2702), 0 states have call successors, (0), 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:39:21,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 2702 transitions. [2022-03-15 21:39:21,891 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 2702 transitions. Word has length 18 [2022-03-15 21:39:21,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:39:21,891 INFO L470 AbstractCegarLoop]: Abstraction has 737 states and 2702 transitions. [2022-03-15 21:39:21,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 0 states have call successors, (0), 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:39:21,891 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 2702 transitions. [2022-03-15 21:39:21,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:39:21,893 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:39:21,894 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:39:21,918 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:39:22,118 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,SelfDestructingSolverStorable11 [2022-03-15 21:39:22,119 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:39:22,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:39:22,119 INFO L85 PathProgramCache]: Analyzing trace with hash -617835124, now seen corresponding path program 9 times [2022-03-15 21:39:22,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:39:22,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275841554] [2022-03-15 21:39:22,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:39:22,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:39:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:22,351 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:22,351 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:39:22,351 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275841554] [2022-03-15 21:39:22,351 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275841554] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:39:22,351 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466890101] [2022-03-15 21:39:22,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:39:22,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:22,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:39:22,352 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:39:22,353 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:39:22,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:39:22,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:39:22,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 21:39:22,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:39:22,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-03-15 21:39:22,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 21:39:22,509 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 21:39:22,614 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 24 treesize of output 16 [2022-03-15 21:39:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:22,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:39:22,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:39:22,813 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 1898 treesize of output 1802 [2022-03-15 21:39:23,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:39:23,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:39:23,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:39:23,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:39:23,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:39:23,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:39:23,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:39:23,909 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:39:23,909 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 22 treesize of output 41 [2022-03-15 21:39:23,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:39:23,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:39:23,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:39:23,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:39:23,946 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 22 treesize of output 5 [2022-03-15 21:39:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:23,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466890101] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:39:23,994 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:39:23,994 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-03-15 21:39:23,994 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1515234513] [2022-03-15 21:39:23,994 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:39:23,996 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:39:24,003 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 208 transitions. [2022-03-15 21:39:24,004 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:39:30,866 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 48 new interpolants: [17157#(and (or (< (+ i 1) N) (<= (+ 2 l) N) (not (< i N)) (<= (+ (select A i) N asum) (+ (select C l) csum))) (or (< (+ (select C l) csum) (+ (select A i) N asum 1)) (< (+ i 1) N) (<= (+ 2 l) N) (not (< i N)))), 17174#(and (or (= csum 0) (< i N)) (or (<= (+ l 1) k) (< i N)) (or (<= (+ (select C l) (select A k) 1) (+ N asum)) (< i N)) (or (<= (+ N asum) (+ (select C l) (select A k) 1)) (< i N))), 17169#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 l) N) (< k N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) csum (select C (+ l 1)))) (< k N) (<= (+ 3 l) N)) (or (< (+ 2 l) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (= csum 0)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ (select C l) csum (select C (+ l 1))) (+ (select A i) N asum (select A (+ i 1)) 1)) (< k N) (<= (+ 3 l) N))), 17165#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) csum) (< k N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< csum (+ (select A i) N asum (select A (+ i 1)) 1)) (< k N))), 17163#(and (or (< (+ l 1) N) (< (+ i 1) N) (not (< i N)) (< k N) (<= (+ (select A i) N asum) (+ (select C l) csum))) (or (< (+ (select C l) csum) (+ (select A i) N asum 1)) (< (+ i 1) N) (<= (+ 2 l) N) (not (< i N)) (< k N))), 17179#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select A (+ k 1)) 2 (select A k)))) (or (= l k) (not (< (+ i 1) N)) (< (+ 2 i) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= csum 0)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) 2 (select A k)) (+ (select A i) N asum (select A (+ i 1)))))), 17161#(and (or (<= (+ l 1) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) csum) (< k N)) (or (<= (+ l 1) N) (< (+ i 1) N) (not (< i N)) (< k N) (< csum (+ (select A i) N asum 1)))), 17139#(and (or (<= (+ 2 l) N) (< (+ (select C l) csum) (+ N asum 1)) (< i N)) (or (<= (+ 2 l) N) (<= (+ N asum) (+ (select C l) csum)) (< i N))), 17160#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) csum) (< k N)) (or (< (+ i 1) N) (not (< i N)) (< k N) (< csum (+ (select A i) N asum 1)))), 17162#(and (or (< (+ 2 l) N) (< (+ i 1) N) (not (< i N)) (= csum 0)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) (+ (select C l) csum (select C (+ l 1)))) (<= (+ 3 l) N)) (or (< (+ i 1) N) (<= (+ 2 l) N) (not (< i N))) (or (< (+ i 1) N) (< (+ (select C l) csum (select C (+ l 1))) (+ (select A i) N asum 1)) (not (< i N)) (<= (+ 3 l) N))), 17173#(and (or (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (<= (+ 2 l) N) (< (+ 2 k) N)) (or (< (+ 2 l) N) (< (+ (select A (+ k 1)) csum (select A k) 1) (+ (select A i) N asum (select A (+ i 1)))) (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N)) (or (< (+ 2 l) N) (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (= csum 0)) (or (< (+ 2 l) N) (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select A (+ k 1)) 2 (select A k))) (< (+ 2 k) N))), 17133#(and (or (< k N) (<= (+ N asum) csum) (< l N)) (or (< k N) (< l N) (< csum (+ N asum 1)))), 17147#(and (or (< (+ (select C l) csum (select C (+ l 1))) (+ N asum 1)) (< k N) (<= (+ 3 l) N) (< i N)) (or (<= (+ 2 l) N) (< k N) (< i N)) (or (<= (+ N asum) (+ (select C l) csum (select C (+ l 1)))) (< k N) (<= (+ 3 l) N) (< i N)) (or (< (+ 2 l) N) (< k N) (= csum 0) (< i N))), 17177#(and (or (<= (+ N asum) (+ (select A (+ k 1)) 2 (select A k))) (< i N)) (or (= csum 0) (< i N)) (or (< i N) (<= (+ (select A (+ k 1)) 2 (select A k)) (+ N asum))) (or (= l k) (< i N))), 17155#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< csum (+ (select A i) N asum (select A (+ i 1)) 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) csum))), 17153#(and (or (< (+ 2 l) N) (not (< (+ k 1) N)) (< (+ 2 k) N) (< (+ (select A (+ k 1)) csum (select A k) 1) (+ N asum)) (< i N)) (or (< (+ 2 l) N) (not (< (+ k 1) N)) (< (+ 2 k) N) (<= (+ N asum) (+ (select A (+ k 1)) 2 (select A k))) (< i N)) (or (not (< (+ k 1) N)) (<= (+ 2 l) N) (< (+ 2 k) N) (< i N)) (or (< (+ 2 l) N) (not (< (+ k 1) N)) (< (+ 2 k) N) (= csum 0) (< i N))), 17135#(and (or (<= (+ N asum) csum) (< i N)) (or (< i N) (< csum (+ N asum 1)))), 17178#(and (or (<= (+ (select A (+ k 1)) 2 (select A k)) (+ (select A i) N asum)) (< (+ i 1) N) (not (< i N))) (or (= l k) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (= csum 0)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) (+ (select A (+ k 1)) 2 (select A k))))), 17170#(and (or (not (< k N)) (< (+ i 1) N) (<= (+ 2 l) N) (not (< i N)) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 l) N) (< (+ (select C l) csum (select A k)) (+ (select A i) N asum)) (< (+ i 1) N) (not (< i N)) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 l) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) (+ (select C l) (select A k) 1)) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 l) N) (< (+ i 1) N) (not (< i N)) (= csum 0) (< (+ k 1) N))), 17156#(and (or (<= (+ l 1) N) (< (+ i 1) N) (not (< i N)) (< csum (+ (select A i) N asum 1))) (or (<= (+ l 1) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) csum))), 17159#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 l) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) csum))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 l) N) (< (+ (select C l) csum) (+ (select A i) N asum (select A (+ i 1)) 1)))), 17152#(and (or (< (+ 2 l) N) (not (< (+ k 1) N)) (< (+ 2 k) N) (< (+ (select A (+ k 1)) csum (select A k) 1) (+ N asum))) (or (not (< (+ k 1) N)) (<= (+ 2 l) N) (< (+ 2 k) N)) (or (< (+ 2 l) N) (not (< (+ k 1) N)) (< (+ 2 k) N) (= csum 0)) (or (< (+ 2 l) N) (not (< (+ k 1) N)) (< (+ 2 k) N) (<= (+ N asum) (+ (select A (+ k 1)) 2 (select A k))))), 17137#(and (or (<= (+ l 1) N) (< i N) (< csum (+ N asum 1))) (or (<= (+ l 1) N) (<= (+ N asum) csum) (< i N))), 17154#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) csum)) (or (< (+ i 1) N) (not (< i N)) (< csum (+ (select A i) N asum 1)))), 17132#(and (or (< k N) (<= (+ N asum) csum)) (or (< k N) (< csum (+ N asum 1)))), 17150#(and (or (not (< k N)) (< (+ 2 l) N) (<= (+ N asum) (+ (select C l) (select A k) 1)) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< (+ 2 l) N) (< (+ k 1) N) (< (+ (select C l) csum (select A k)) (+ N asum)) (< i N)) (or (not (< k N)) (<= (+ 2 l) N) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< (+ 2 l) N) (= csum 0) (< (+ k 1) N) (< i N))), 17149#(and (or (not (< k N)) (<= (+ 2 l) N) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 l) N) (<= (+ N asum) (+ (select C l) (select A k) 1)) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 l) N) (< (+ k 1) N) (< (+ (select C l) csum (select A k)) (+ N asum))) (or (not (< k N)) (< (+ 2 l) N) (= csum 0) (< (+ k 1) N))), 17167#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 l) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) csum)) (< k N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 l) N) (< (+ (select C l) csum) (+ (select A i) N asum (select A (+ i 1)) 1)) (< k N))), 17146#(and (or (< (+ 2 l) N) (< k N) (= csum 0)) (or (<= (+ 2 l) N) (< k N)) (or (< (+ 2 l) N) (<= (+ N asum) (+ (select C l) (select C (+ (- 1) N)))) (< k N)) (or (< (+ 2 l) N) (< (+ (select C l) csum (select C (+ l 1))) (+ N asum 1)) (< k N))), 17134#(and (or (< (+ l 1) N) (< (+ (select C l) csum) (+ N asum 1)) (< k N)) (or (< (+ l 1) N) (< k N) (<= (+ N asum) (+ (select C l) csum)))), 17141#(and (or (not (< l N)) (<= (+ (select C l) csum) (+ N asum)) (<= (+ 2 l) N)) (or (<= (+ 2 l) N) (<= (+ N asum) (+ (select C l) csum)) (<= N l))), 17172#(and (or (< (+ 2 l) N) (not (< (+ k 1) N)) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A i) N asum) (+ (select A (+ k 1)) 2 (select A k)))) (or (< (+ 2 l) N) (not (< (+ k 1) N)) (< (+ i 1) N) (< (+ (select A (+ k 1)) csum (select A k) 1) (+ (select A i) N asum)) (not (< i N)) (< (+ 2 k) N)) (or (< (+ 2 l) N) (not (< (+ k 1) N)) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (= csum 0)) (or (not (< (+ k 1) N)) (< (+ i 1) N) (<= (+ 2 l) N) (not (< i N)) (< (+ 2 k) N))), 17144#(and (or (not (< (+ l 1) N)) (<= (+ 3 l) N) (<= (+ (select C l) csum (select C (+ l 1))) (+ N asum))) (or (<= N (+ l 1)) (<= (+ N asum) (+ (select C l) csum (select C (+ l 1)))) (<= (+ 3 l) N))), 17140#(and (or (< (+ l 1) N) (< (+ (select C l) csum) (+ N asum 1)) (< k N) (< i N)) (or (< (+ l 1) N) (< k N) (<= (+ N asum) (+ (select C l) csum)) (< i N))), 17168#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ (select C l) csum (select C (+ l 1))) (+ (select A i) N asum (select A (+ i 1)) 1)) (<= (+ 3 l) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 l) N)) (or (< (+ 2 l) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (= csum 0)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) csum (select C (+ l 1)))) (<= (+ 3 l) N))), 17175#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ l 1) k)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) (+ (select C l) (select A k) 1))) (or (<= (+ (select C l) (select A k) 1) (+ (select A i) N asum)) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (= csum 0))), 17142#(and (or (not (< l N)) (<= (+ (select C l) csum) (+ N asum)) (<= (+ 2 l) N) (< k N)) (or (<= (+ 2 l) N) (< k N) (<= (+ N asum) (+ (select C l) csum)) (<= N l))), 17164#(and (or (< (+ i 1) N) (< (+ (select C l) csum (select C (+ l 1))) (+ (select A i) N asum 1)) (not (< i N)) (< k N) (<= (+ 3 l) N)) (or (< (+ i 1) N) (<= (+ 2 l) N) (not (< i N)) (< k N)) (or (< (+ 2 l) N) (< (+ i 1) N) (not (< i N)) (< k N) (= csum 0)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) (+ (select C l) csum (select C (+ l 1)))) (< k N) (<= (+ 3 l) N))), 17158#(and (or (<= (+ l 1) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) csum)) (or (<= (+ l 1) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< csum (+ (select A i) N asum (select A (+ i 1)) 1)))), 17151#(and (or (<= N (+ l 1)) (not (< (+ k 1) N)) (< (+ 2 k) N) (<= (+ 3 l) N) (<= (+ N asum) (+ (select A (+ k 1)) 2 csum (select A k)))) (or (<= (+ (select A (+ k 1)) 2 csum (select A k)) (+ N asum)) (not (< (+ k 1) N)) (< (+ 2 k) N) (not (< (+ l 1) N)) (<= (+ 3 l) N))), 17136#(and (or (< k N) (<= (+ N asum) csum) (< i N)) (or (< k N) (< i N) (< csum (+ N asum 1)))), 17148#(and (or (not (< k N)) (<= (+ (select C l) csum (select A k) 1) (+ N asum)) (not (< (+ l 1) N)) (<= (+ 3 l) N) (< (+ k 1) N)) (or (not (< k N)) (<= N (+ l 1)) (<= (+ N asum) (+ (select C l) csum (select A k) 1)) (<= (+ 3 l) N) (< (+ k 1) N))), 17138#(and (or (<= (+ l 1) N) (< k N) (< i N) (< csum (+ N asum 1))) (or (<= (+ l 1) N) (< k N) (<= (+ N asum) csum) (< i N))), 17176#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= csum 0)) (or (not (< (+ i 1) N)) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) (select A k) 1)) (< (+ 2 i) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select C l) (select A k) 1) (+ (select A i) N asum (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ l 1) k))), 17171#(and (or (not (< k N)) (< (+ 2 l) N) (not (< (+ i 1) N)) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) (select A k) 1)) (< (+ 2 i) N) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 l) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (= csum 0) (< (+ k 1) N)) (or (not (< k N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 l) N) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 l) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ k 1) N) (< (+ (select C l) csum (select A k)) (+ (select A i) N asum (select A (+ i 1)))))), 17145#(and (or (<= N (+ l 1)) (<= (+ N asum) (+ (select C l) csum (select C (+ l 1)))) (< k N) (<= (+ 3 l) N)) (or (not (< (+ l 1) N)) (< k N) (<= (+ 3 l) N) (<= (+ (select C l) csum (select C (+ l 1))) (+ N asum)))), 17143#(and (or (<= (+ N asum) (+ (select C l) csum (select C (+ l 1)))) (<= (+ 3 l) N) (< i N)) (or (<= (+ 2 l) N) (< i N)) (or (< (+ (select C l) csum (select C (+ l 1))) (+ N asum 1)) (<= (+ 3 l) N) (< i N)) (or (< (+ 2 l) N) (= csum 0) (< i N))), 17166#(and (or (<= (+ l 1) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) csum) (< k N)) (or (<= (+ l 1) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< csum (+ (select A i) N asum (select A (+ i 1)) 1)) (< k N)))] [2022-03-15 21:39:30,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-03-15 21:39:30,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:39:30,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-03-15 21:39:30,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=4474, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 21:39:30,869 INFO L87 Difference]: Start difference. First operand 737 states and 2702 transitions. Second operand has 59 states, 58 states have (on average 2.8620689655172415) internal successors, (166), 58 states have internal predecessors, (166), 0 states have call successors, (0), 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:40:49,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:49,966 INFO L93 Difference]: Finished difference Result 2978 states and 9926 transitions. [2022-03-15 21:40:49,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 295 states. [2022-03-15 21:40:49,967 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.8620689655172415) internal successors, (166), 58 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 21:40:49,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:49,982 INFO L225 Difference]: With dead ends: 2978 [2022-03-15 21:40:49,982 INFO L226 Difference]: Without dead ends: 2859 [2022-03-15 21:40:49,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 40 SyntacticMatches, 16 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49658 ImplicationChecksByTransitivity, 78.7s TimeCoverageRelationStatistics Valid=17149, Invalid=108521, Unknown=0, NotChecked=0, Total=125670 [2022-03-15 21:40:49,992 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2201 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 3981 mSolverCounterSat, 789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2201 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 789 IncrementalHoareTripleChecker+Valid, 3981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:49,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2201 Valid, 0 Invalid, 4770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [789 Valid, 3981 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-03-15 21:40:49,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2022-03-15 21:40:50,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 948. [2022-03-15 21:40:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 947 states have (on average 3.672650475184794) internal successors, (3478), 947 states have internal predecessors, (3478), 0 states have call successors, (0), 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:40:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 3478 transitions. [2022-03-15 21:40:50,033 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 3478 transitions. Word has length 19 [2022-03-15 21:40:50,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:50,033 INFO L470 AbstractCegarLoop]: Abstraction has 948 states and 3478 transitions. [2022-03-15 21:40:50,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.8620689655172415) internal successors, (166), 58 states have internal predecessors, (166), 0 states have call successors, (0), 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:40:50,034 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 3478 transitions. [2022-03-15 21:40:50,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:40:50,036 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:50,036 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:50,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 21:40:50,263 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,SelfDestructingSolverStorable12 [2022-03-15 21:40:50,263 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:40:50,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:50,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2068978802, now seen corresponding path program 10 times [2022-03-15 21:40:50,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:50,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990368604] [2022-03-15 21:40:50,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:50,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:50,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:50,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990368604] [2022-03-15 21:40:50,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990368604] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:50,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249979593] [2022-03-15 21:40:50,476 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:40:50,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:50,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:50,477 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:40:50,479 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:40:50,525 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:40:50,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:50,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 21:40:50,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:50,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-03-15 21:40:50,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:40:50,752 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 25 [2022-03-15 21:40:50,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:40:50,755 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-03-15 21:40:50,806 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 12 treesize of output 8 [2022-03-15 21:40:50,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:50,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:50,953 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:40:50,953 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 458 treesize of output 426 [2022-03-15 21:40:50,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:40:50,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:40:50,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:40:51,085 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:40:51,108 INFO L353 Elim1Store]: treesize reduction 14, result has 72.5 percent of original size [2022-03-15 21:40:51,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 47 [2022-03-15 21:40:51,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:40:51,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:40:51,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:40:51,180 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 22 treesize of output 5 [2022-03-15 21:40:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:51,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249979593] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:51,207 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:51,207 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2022-03-15 21:40:51,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [121896335] [2022-03-15 21:40:51,208 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:51,209 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:51,218 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 154 transitions. [2022-03-15 21:40:51,218 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:56,161 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 43 new interpolants: [22779#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) csum) (< k N)) (or (< (+ i 1) N) (not (< i N)) (< k N) (< csum (+ (select A i) N asum 1)))), 22798#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select A (+ k 1)) 2 (select A k)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) 2 (select A k)) (+ (select A i) N asum (select A (+ i 1))))) (or (= l k) (not (< (+ i 1) N)) (< (+ 2 i) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= csum 0)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N))), 22778#(and (or (< (+ i 1) N) (<= (+ 2 l) N) (not (< i N)) (<= (+ (select A i) N asum) (+ (select C l) csum))) (or (< (+ (select C l) csum) (+ (select A i) N asum 1)) (< (+ i 1) N) (<= (+ 2 l) N) (not (< i N)))), 22792#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= csum 0)) (or (not (< (+ i 1) N)) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) (select A k) 1)) (< (+ 2 i) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select C l) (select A k) 1) (+ (select A i) N asum (select A (+ i 1))))) (or (not (< (+ i 1) N)) (<= (+ k 1) N) (< (+ 2 i) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ l 1) k))), 22797#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (= l k) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (= csum 0)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) (+ (select A (+ k 1)) 2 (select A k)))) (or (<= (+ (select A (+ k 1)) 2 (select A k)) (+ (select A i) N asum)) (<= N i) (< (+ i 1) N))), 22795#(and (or (not (< k N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= csum 0)) (or (not (< k N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N)) (or (and (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select A (+ k 1)) (select C l) 1)) (not (= l k))) (not (< k N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (and (= l k) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select A (+ k 1)) 2 (select A k))))) (or (not (< k N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (and (<= (+ (select A (+ k 1)) (select C l) 1) (+ (select A i) N asum (select A (+ i 1)))) (not (= l k))) (and (= l k) (<= (+ (select A (+ k 1)) 2 (select A k)) (+ (select A i) N asum (select A (+ i 1))))))), 22796#(and (or (<= (+ N asum) (+ (select A (+ k 1)) 2 (select A k))) (< i N)) (or (<= (+ 2 k) N) (< i N)) (or (= csum 0) (< i N)) (or (< i N) (<= (+ (select A (+ k 1)) 2 (select A k)) (+ N asum))) (or (= l k) (< i N))), 22787#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 l) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) csum))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 l) N) (< (+ (select C l) csum) (+ (select A i) N asum (select A (+ i 1)) 1)))), 22784#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) (+ (select C l) (select A k) 1))) (or (<= (+ (select C l) (select A k) 1) (+ (select A i) N asum)) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (= (+ (* (- 1) k) p) 0)) (or (< (+ i 1) N) (not (< i N)) (<= (+ p 1) N)) (or (< (+ i 1) N) (not (< i N)) (= csum 0))), 22767#(and (or (= (+ (* (- 1) k) p) 0) (< i N)) (or (<= (+ p 1) N) (< i N)) (or (= csum 0) (< i N)) (or (<= (+ (select C l) (select A k) 1) (+ N asum)) (< i N)) (or (<= (+ N asum) (+ (select C l) (select A k) 1)) (< i N))), 22757#(and (or (< k N) (<= (+ N asum) csum)) (or (< k N) (< csum (+ N asum 1)))), 22761#(and (or (<= (+ l 1) N) (< k N) (< i N) (< csum (+ N asum 1))) (or (<= (+ l 1) N) (< k N) (<= (+ N asum) csum) (< i N))), 22793#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= csum 0)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (+ (* (- 1) k) p) 0)) (or (not (< (+ i 1) N)) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) (select A k) 1)) (< (+ 2 i) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ p 1) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select C l) (select A k) 1) (+ (select A i) N asum (select A (+ i 1)))))), 22760#(and (or (<= (+ l 1) N) (< i N) (< csum (+ N asum 1))) (or (<= (+ l 1) N) (<= (+ N asum) csum) (< i N))), 22794#(and (or (not (< k N)) (<= (+ (select A (+ k 1)) (select C l) 1) (+ (select A i) N asum)) (= l k) (< (+ i 1) N) (not (< i N))) (or (<= (+ (select A i) N asum) (+ (select A (+ k 1)) (select C l) 1)) (not (< k N)) (= l k) (< (+ i 1) N) (not (< i N))) (or (not (< k N)) (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) (+ (select A (+ k 1)) 2 (select A k))) (not (= l k))) (or (not (< k N)) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (<= (+ (select A (+ k 1)) 2 (select A k)) (+ (select A i) N asum)) (not (< k N)) (< (+ i 1) N) (not (< i N)) (not (= l k))) (or (not (< k N)) (< (+ i 1) N) (not (< i N)) (= csum 0))), 22788#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) csum) (< k N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< csum (+ (select A i) N asum (select A (+ i 1)) 1)) (< k N))), 22773#(and (or (<= (+ (select A (+ k 1)) 2 csum (select A k)) (+ N asum)) (not (< (+ k 1) N)) (<= (+ 3 l) N) (<= (+ k 1) l)) (or (not (< (+ k 1) N)) (<= (+ 3 l) N) (<= (+ N asum) (+ (select A (+ k 1)) 2 csum (select A k))) (<= (+ k 1) l))), 22770#(and (or (not (< k N)) (<= (+ 2 l) N) (<= (+ csum (select A k) 1) (+ N asum)) (<= (+ k 1) l)) (or (not (< k N)) (<= (+ N asum) (+ csum (select A k) 1)) (<= (+ 2 l) N) (<= (+ k 1) l))), 22768#(and (or (not (< l N)) (not (< l p)) (<= (+ 2 l) N) (<= (+ N asum) (+ (select C l) csum))) (or (not (< l N)) (not (< l p)) (<= (+ (select C l) csum) (+ N asum)) (<= (+ 2 l) N))), 22772#(and (or (not (< k N)) (<= (+ N asum) (+ (select C l) csum (select A k) 1)) (<= (+ 3 l) N) (<= p l) (<= k l)) (or (not (< k N)) (<= (+ (select C l) csum (select A k) 1) (+ N asum)) (<= (+ 3 l) N) (<= p l) (<= k l))), 22789#(and (or (<= (+ l 1) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) csum) (< k N)) (or (<= (+ l 1) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< csum (+ (select A i) N asum (select A (+ i 1)) 1)) (< k N))), 22775#(and (or (not (< k N)) (not (= l k)) (< i N) (<= (+ (select A (+ k 1)) 2 (select A k)) (+ N asum))) (or (not (< k N)) (= csum 0) (< i N)) (or (not (< k N)) (<= (+ N asum) (+ (select A (+ k 1)) 2 (select A k))) (not (= l k)) (< i N)) (or (not (< k N)) (= l k) (<= (+ N asum) (+ (select A (+ k 1)) (select C l) 1)) (< i N)) (or (not (< k N)) (<= (+ 2 k) N) (< i N)) (or (not (< k N)) (= l k) (<= (+ (select A (+ k 1)) (select C l) 1) (+ N asum)) (< i N))), 22791#(and (or (< k (+ l 1)) (not (< (+ i 1) N)) (<= (+ k 1) N) (< (+ 2 i) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= l k)) (or (<= (+ csum (select A k) 1) (+ (select A i) N asum (select A (+ i 1)))) (not (= (+ (* (- 1) k) l) 0)) (not (< (+ i 1) N)) (< (+ 2 i) N)) (or (<= (+ (select A i) N asum (select A (+ i 1))) (+ csum (select A k) 1)) (not (= (+ (* (- 1) k) l) 0)) (not (< (+ i 1) N)) (< (+ 2 i) N))), 22781#(and (or (< (+ l 1) N) (< (+ i 1) N) (not (< i N)) (< k N) (<= (+ (select A i) N asum) (+ (select C l) csum))) (or (< (+ (select C l) csum) (+ (select A i) N asum 1)) (< (+ i 1) N) (<= (+ 2 l) N) (not (< i N)) (< k N))), 22766#(and (or (<= (+ k 1) N) (< i N)) (or (= csum 0) (< i N)) (or (<= (+ l 1) k) (< i N)) (or (<= (+ (select C l) (select A k) 1) (+ N asum)) (< i N)) (or (<= (+ N asum) (+ (select C l) (select A k) 1)) (< i N))), 22769#(and (or (not (< l N)) (not (< l p)) (<= (+ (select C l) csum) (+ N asum)) (<= (+ 2 l) N) (< k N)) (or (not (< l N)) (not (< l p)) (<= (+ 2 l) N) (< k N) (<= (+ N asum) (+ (select C l) csum)))), 22782#(and (or (not (= (+ (* (- 1) k) l) 0)) (< (+ i 1) N) (not (< i N)) (<= (+ csum (select A k) 1) (+ (select A i) N asum))) (or (< k (+ l 1)) (<= (+ k 1) N) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (<= l k) (not (< i N))) (or (not (= (+ (* (- 1) k) l) 0)) (< (+ i 1) N) (<= (+ (select A i) N asum) (+ csum (select A k) 1)) (not (< i N)))), 22783#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ l 1) k)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) (+ (select C l) (select A k) 1))) (or (<= (+ (select C l) (select A k) 1) (+ (select A i) N asum)) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (= csum 0)) (or (<= (+ k 1) N) (< (+ i 1) N) (not (< i N)))), 22774#(and (or (not (< k N)) (= csum 0)) (or (not (< k N)) (<= (+ 2 k) N)) (or (not (< k N)) (and (= l k) (<= (+ (select A (+ k 1)) 2 (select A k)) (+ N asum))) (and (<= (+ (select A (+ k 1)) (select C l) 1) (+ N asum)) (not (= l k)))) (or (not (< k N)) (and (= l k) (<= (+ N asum) (+ (select A (+ k 1)) 2 (select A k)))) (and (not (= l k)) (<= (+ N asum) (+ (select A (+ k 1)) (select C l) 1))))), 22790#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 l) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) csum)) (< k N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 l) N) (< (+ (select C l) csum) (+ (select A i) N asum (select A (+ i 1)) 1)) (< k N))), 22785#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< csum (+ (select A i) N asum (select A (+ i 1)) 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) csum))), 22765#(and (or (<= l k) (< i N)) (or (not (= (+ (* (- 1) k) l) 0)) (<= (+ N asum) (+ csum (select A k) 1)) (< i N)) (or (< k (+ l 1)) (<= (+ k 1) N) (< i N)) (or (not (= (+ (* (- 1) k) l) 0)) (<= (+ csum (select A k) 1) (+ N asum)) (< i N))), 22777#(and (or (<= (+ l 1) N) (< (+ i 1) N) (not (< i N)) (< csum (+ (select A i) N asum 1))) (or (<= (+ l 1) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) csum))), 22759#(and (or (< k N) (<= (+ N asum) csum) (< l N)) (or (< k N) (< l N) (< csum (+ N asum 1)))), 22786#(and (or (<= (+ l 1) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) csum)) (or (<= (+ l 1) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< csum (+ (select A i) N asum (select A (+ i 1)) 1)))), 22758#(and (or (< k N) (<= (+ N asum) csum) (< i N)) (or (< k N) (< i N) (< csum (+ N asum 1)))), 22780#(and (or (<= (+ l 1) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) csum) (< k N)) (or (<= (+ l 1) N) (< (+ i 1) N) (not (< i N)) (< k N) (< csum (+ (select A i) N asum 1)))), 22763#(and (or (< (+ l 1) N) (< (+ (select C l) csum) (+ N asum 1)) (< k N)) (or (< (+ l 1) N) (< k N) (<= (+ N asum) (+ (select C l) csum)))), 22776#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) csum)) (or (< (+ i 1) N) (not (< i N)) (< csum (+ (select A i) N asum 1)))), 22762#(and (or (<= (+ 2 l) N) (< (+ (select C l) csum) (+ N asum 1)) (< i N)) (or (<= (+ 2 l) N) (<= (+ N asum) (+ (select C l) csum)) (< i N))), 22764#(and (or (< (+ l 1) N) (< (+ (select C l) csum) (+ N asum 1)) (< k N) (< i N)) (or (< (+ l 1) N) (< k N) (<= (+ N asum) (+ (select C l) csum)) (< i N))), 22756#(and (or (<= (+ N asum) csum) (< i N)) (or (< i N) (< csum (+ N asum 1)))), 22771#(and (or (not (< k N)) (<= (+ N asum) (+ (select C l) csum (select A k) 1)) (<= (+ 3 l) N) (<= k l)) (or (not (< k N)) (<= (+ (select C l) csum (select A k) 1) (+ N asum)) (<= (+ 3 l) N) (<= k l)))] [2022-03-15 21:40:56,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-15 21:40:56,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:56,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-15 21:40:56,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=4126, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 21:40:56,162 INFO L87 Difference]: Start difference. First operand 948 states and 3478 transitions. Second operand has 55 states, 54 states have (on average 2.5) internal successors, (135), 54 states have internal predecessors, (135), 0 states have call successors, (0), 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:41:56,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:56,629 INFO L93 Difference]: Finished difference Result 3067 states and 10028 transitions. [2022-03-15 21:41:56,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 305 states. [2022-03-15 21:41:56,629 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.5) internal successors, (135), 54 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 21:41:56,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:56,641 INFO L225 Difference]: With dead ends: 3067 [2022-03-15 21:41:56,641 INFO L226 Difference]: Without dead ends: 2981 [2022-03-15 21:41:56,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 31 SyntacticMatches, 8 SemanticMatches, 360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50886 ImplicationChecksByTransitivity, 60.1s TimeCoverageRelationStatistics Valid=16957, Invalid=113725, Unknown=0, NotChecked=0, Total=130682 [2022-03-15 21:41:56,650 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1772 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 3521 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1772 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 3521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:56,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1772 Valid, 0 Invalid, 4313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 3521 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 21:41:56,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2022-03-15 21:41:56,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1039. [2022-03-15 21:41:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 1038 states have (on average 3.6348747591522157) internal successors, (3773), 1038 states have internal predecessors, (3773), 0 states have call successors, (0), 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:41:56,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 3773 transitions. [2022-03-15 21:41:56,689 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 3773 transitions. Word has length 19 [2022-03-15 21:41:56,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:56,689 INFO L470 AbstractCegarLoop]: Abstraction has 1039 states and 3773 transitions. [2022-03-15 21:41:56,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.5) internal successors, (135), 54 states have internal predecessors, (135), 0 states have call successors, (0), 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:41:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 3773 transitions. [2022-03-15 21:41:56,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:41:56,692 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:56,692 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:56,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 21:41:56,907 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,SelfDestructingSolverStorable13 [2022-03-15 21:41:56,907 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:41:56,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:56,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1802223625, now seen corresponding path program 11 times [2022-03-15 21:41:56,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:56,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737131291] [2022-03-15 21:41:56,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:56,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:56,959 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:41:56,959 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:56,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737131291] [2022-03-15 21:41:56,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737131291] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:56,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896928503] [2022-03-15 21:41:56,959 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:41:56,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:56,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:56,960 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:41:56,961 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:41:56,990 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:41:56,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:41:56,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:41:56,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:41:57,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:41:57,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896928503] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:57,060 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:57,061 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-03-15 21:41:57,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1641132741] [2022-03-15 21:41:57,061 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:57,062 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:57,070 INFO L252 McrAutomatonBuilder]: Finished intersection with 95 states and 187 transitions. [2022-03-15 21:41:57,070 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:58,104 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [28653#(< i N), 28659#(or (<= N (+ i 1)) (< (+ 2 i) N)), 28666#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 28657#(or (<= (+ 2 k) N) (< i N)), 28667#(or (<= (+ 3 k) N) (<= N i) (< (+ i 1) N) (<= N k)), 28675#(or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ 3 i) N)), 28660#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 28669#(or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (<= N k)), 28674#(or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N)), 28655#(or (<= N i) (< (+ i 1) N)), 28658#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N)), 28665#(or (<= (+ 3 k) N) (< i N)), 28671#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N)), 28672#(or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= N k) (< (+ 3 i) N)), 28654#(or (< k N) (< i N)), 28662#(or (<= N (+ k 1)) (<= (+ 3 k) N)), 28664#(or (<= (+ 3 k) N) (<= N k) (< i N)), 28661#(or (<= (+ 2 k) N) (<= N k)), 28668#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N)), 28656#(or (<= N i) (< (+ i 1) N) (< k N)), 28663#(or (<= (+ 3 k) N) (<= N k)), 28673#(or (<= (+ 3 k) N) (<= N i) (< (+ i 1) N)), 28670#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N))] [2022-03-15 21:41:58,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 21:41:58,105 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:58,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 21:41:58,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2022-03-15 21:41:58,105 INFO L87 Difference]: Start difference. First operand 1039 states and 3773 transitions. Second operand has 31 states, 31 states have (on average 3.6129032258064515) internal successors, (112), 30 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:59,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:59,290 INFO L93 Difference]: Finished difference Result 2806 states and 10297 transitions. [2022-03-15 21:41:59,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 21:41:59,290 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.6129032258064515) internal successors, (112), 30 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:41:59,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:59,305 INFO L225 Difference]: With dead ends: 2806 [2022-03-15 21:41:59,305 INFO L226 Difference]: Without dead ends: 2760 [2022-03-15 21:41:59,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 82 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=920, Invalid=3636, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 21:41:59,307 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 583 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:59,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [583 Valid, 0 Invalid, 1638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:41:59,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2022-03-15 21:41:59,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 1704. [2022-03-15 21:41:59,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1703 states have (on average 3.9142689371697004) internal successors, (6666), 1703 states have internal predecessors, (6666), 0 states have call successors, (0), 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:41:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 6666 transitions. [2022-03-15 21:41:59,355 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 6666 transitions. Word has length 20 [2022-03-15 21:41:59,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:59,356 INFO L470 AbstractCegarLoop]: Abstraction has 1704 states and 6666 transitions. [2022-03-15 21:41:59,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.6129032258064515) internal successors, (112), 30 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:59,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 6666 transitions. [2022-03-15 21:41:59,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:41:59,361 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:59,361 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:59,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 21:41:59,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 21:41:59,582 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:41:59,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:59,583 INFO L85 PathProgramCache]: Analyzing trace with hash 385284851, now seen corresponding path program 12 times [2022-03-15 21:41:59,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:59,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320255542] [2022-03-15 21:41:59,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:59,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:41:59,638 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:59,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320255542] [2022-03-15 21:41:59,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320255542] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:59,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101889919] [2022-03-15 21:41:59,638 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:41:59,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:59,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:59,639 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:41:59,639 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:41:59,670 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:41:59,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:41:59,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:41:59,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:59,699 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:41:59,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:59,735 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:41:59,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101889919] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:59,735 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:59,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 8 [2022-03-15 21:41:59,735 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [835097806] [2022-03-15 21:41:59,735 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:59,737 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:59,773 INFO L252 McrAutomatonBuilder]: Finished intersection with 89 states and 174 transitions. [2022-03-15 21:41:59,773 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:00,715 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [35090#(or (<= N i) (< (+ i 1) N) (< k N)), 35093#(or (<= N (+ k 1)) (< (+ 2 k) N)), 35096#(<= N (+ 2 k)), 35107#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 35092#(or (<= N k) (< (+ k 1) N)), 35088#(or (<= N k) (< i N)), 35111#(or (<= N k) (<= i (+ k 1))), 35098#(or (<= N (+ k 1)) (< i N)), 35103#(or (<= N (+ i 1)) (< (+ 2 i) N)), 35097#(and (or (< i N) (<= N p)) (or (= (+ (* (- 1) k) p) 0) (< i N))), 35094#(<= N (+ k 1)), 35110#(and (or (<= N i) (<= (+ i 1) p)) (or (<= N i) (= (+ (* (- 1) k) p) 0))), 35105#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 35108#(or (<= N i) (< (+ i 1) N) (<= N (+ 2 k))), 35085#(< k N), 35102#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 35095#(or (<= N (+ 2 k)) (< (+ 3 k) N)), 35087#(or (< k N) (< i N)), 35091#(or (<= N i) (< (+ i 1) N) (<= N k)), 35106#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (= (+ (* (- 1) k) p) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= N p))), 35100#(or (<= N k) (<= i (+ 2 k))), 35099#(or (<= N (+ 2 k)) (< i N)), 35086#(< i N), 35109#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N (+ 2 k))), 35104#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 35101#(and (or (<= N i) (< (+ i 1) N) (= (+ (* (- 1) k) p) 0)) (or (<= N i) (< (+ i 1) N) (<= N p))), 35112#(and (or (<= N (+ i 1)) (= (+ (* (- 1) k) p) 0)) (or (<= N (+ i 1)) (<= (+ 2 i) p))), 35089#(or (<= N i) (< (+ i 1) N))] [2022-03-15 21:42:00,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 21:42:00,715 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:00,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 21:42:00,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1110, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 21:42:00,716 INFO L87 Difference]: Start difference. First operand 1704 states and 6666 transitions. Second operand has 37 states, 37 states have (on average 3.2162162162162162) internal successors, (119), 36 states have internal predecessors, (119), 0 states have call successors, (0), 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:42:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:01,798 INFO L93 Difference]: Finished difference Result 3477 states and 12970 transitions. [2022-03-15 21:42:01,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 21:42:01,799 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.2162162162162162) internal successors, (119), 36 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have 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:42:01,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:01,810 INFO L225 Difference]: With dead ends: 3477 [2022-03-15 21:42:01,810 INFO L226 Difference]: Without dead ends: 3461 [2022-03-15 21:42:01,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1064, Invalid=3492, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 21:42:01,811 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 583 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:01,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [583 Valid, 0 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:42:01,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2022-03-15 21:42:01,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 2111. [2022-03-15 21:42:01,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2111 states, 2110 states have (on average 4.145497630331754) internal successors, (8747), 2110 states have internal predecessors, (8747), 0 states have call successors, (0), 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:42:01,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 8747 transitions. [2022-03-15 21:42:01,870 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 8747 transitions. Word has length 20 [2022-03-15 21:42:01,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:01,872 INFO L470 AbstractCegarLoop]: Abstraction has 2111 states and 8747 transitions. [2022-03-15 21:42:01,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.2162162162162162) internal successors, (119), 36 states have internal predecessors, (119), 0 states have call successors, (0), 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:42:01,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 8747 transitions. [2022-03-15 21:42:01,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:42:01,878 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:01,879 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:01,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 21:42:02,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:02,099 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:02,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:02,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2136185558, now seen corresponding path program 13 times [2022-03-15 21:42:02,100 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:02,100 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782981690] [2022-03-15 21:42:02,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:02,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:42:02,144 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:02,144 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782981690] [2022-03-15 21:42:02,144 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782981690] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:02,144 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854889982] [2022-03-15 21:42:02,144 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:42:02,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:02,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:02,148 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:42:02,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 21:42:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:02,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:42:02,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:02,234 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:42:02,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:42:02,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854889982] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:02,271 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:02,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-03-15 21:42:02,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [305167771] [2022-03-15 21:42:02,271 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:02,273 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:02,288 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 278 transitions. [2022-03-15 21:42:02,288 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:03,799 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [43004#(or (<= N (+ l 1)) (<= (+ 3 l) N)), 43013#(or (<= N (+ i 1)) (< (+ 2 i) N)), 43015#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 l) N)), 43018#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< l N)), 43009#(or (<= N i) (< (+ i 1) N)), 43007#(or (<= (+ 2 l) N) (< i N)), 43019#(or (<= N (+ 2 i)) (<= (+ 2 l) N) (< (+ 3 i) N)), 43014#(or (<= N (+ i 1)) (< (+ 2 i) N) (< l N)), 43020#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ 3 l) N)), 43017#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 43016#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 3 l) N)), 43006#(or (<= (+ l 1) N) (< i N)), 43012#(or (<= N i) (< (+ i 1) N) (<= (+ 3 l) N)), 43008#(or (<= (+ 3 l) N) (< i N)), 43003#(or (<= (+ 2 l) N) (<= N l)), 43010#(or (<= N i) (< (+ i 1) N) (< l N)), 43011#(or (<= N i) (< (+ i 1) N) (<= (+ 2 l) N)), 43005#(< i N)] [2022-03-15 21:42:03,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 21:42:03,800 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:03,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 21:42:03,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2022-03-15 21:42:03,801 INFO L87 Difference]: Start difference. First operand 2111 states and 8747 transitions. Second operand has 26 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 25 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:42:04,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:04,783 INFO L93 Difference]: Finished difference Result 8211 states and 33602 transitions. [2022-03-15 21:42:04,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 21:42:04,783 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 25 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 21 [2022-03-15 21:42:04,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:04,854 INFO L225 Difference]: With dead ends: 8211 [2022-03-15 21:42:04,855 INFO L226 Difference]: Without dead ends: 8195 [2022-03-15 21:42:04,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 123 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=875, Invalid=3547, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 21:42:04,856 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 328 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:04,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [328 Valid, 0 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:42:04,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8195 states. [2022-03-15 21:42:04,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8195 to 3912. [2022-03-15 21:42:04,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3912 states, 3911 states have (on average 4.340833546407568) internal successors, (16977), 3911 states have internal predecessors, (16977), 0 states have call successors, (0), 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:42:05,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3912 states and 16977 transitions. [2022-03-15 21:42:05,013 INFO L78 Accepts]: Start accepts. Automaton has 3912 states and 16977 transitions. Word has length 21 [2022-03-15 21:42:05,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:05,014 INFO L470 AbstractCegarLoop]: Abstraction has 3912 states and 16977 transitions. [2022-03-15 21:42:05,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 25 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:42:05,014 INFO L276 IsEmpty]: Start isEmpty. Operand 3912 states and 16977 transitions. [2022-03-15 21:42:05,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:42:05,025 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:05,025 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:05,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 21:42:05,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 21:42:05,240 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:05,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:05,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1572375518, now seen corresponding path program 14 times [2022-03-15 21:42:05,241 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:05,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467901726] [2022-03-15 21:42:05,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:05,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:42:05,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:05,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467901726] [2022-03-15 21:42:05,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467901726] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:05,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294081369] [2022-03-15 21:42:05,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:42:05,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:05,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:05,292 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:42:05,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 21:42:05,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:42:05,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:05,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:42:05,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:05,400 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:42:05,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:05,439 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:42:05,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294081369] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:05,440 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:05,440 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-03-15 21:42:05,440 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1122930272] [2022-03-15 21:42:05,440 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:05,442 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:05,456 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 258 transitions. [2022-03-15 21:42:05,456 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:06,754 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [59281#(or (< (+ 3 l) N) (<= N (+ 2 l))), 59282#(or (<= N (+ i 1)) (< (+ 2 i) N)), 59269#(< l N), 59270#(< (+ l 1) N), 59273#(or (<= N l) (< i N)), 59272#(< i N), 59283#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N l)), 59279#(or (<= N i) (< (+ i 1) N) (<= N (+ 2 l))), 59280#(or (< (+ 2 l) N) (<= N (+ l 1))), 59277#(or (<= N i) (< (+ i 1) N) (<= N l)), 59276#(or (<= N i) (< (+ i 1) N)), 59274#(or (<= N (+ l 1)) (< i N)), 59284#(or (<= N (+ i 1)) (<= N (+ l 1)) (< (+ 2 i) N)), 59278#(or (<= N (+ l 1)) (<= N i) (< (+ i 1) N)), 59271#(or (< (+ l 1) N) (<= N l)), 59285#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N (+ 2 l))), 59275#(or (<= N (+ 2 l)) (< i N))] [2022-03-15 21:42:06,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 21:42:06,754 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:06,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 21:42:06,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2022-03-15 21:42:06,755 INFO L87 Difference]: Start difference. First operand 3912 states and 16977 transitions. Second operand has 25 states, 25 states have (on average 4.0) internal successors, (100), 24 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:42:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:08,276 INFO L93 Difference]: Finished difference Result 15800 states and 63676 transitions. [2022-03-15 21:42:08,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-03-15 21:42:08,277 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.0) internal successors, (100), 24 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 21 [2022-03-15 21:42:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:08,341 INFO L225 Difference]: With dead ends: 15800 [2022-03-15 21:42:08,341 INFO L226 Difference]: Without dead ends: 15498 [2022-03-15 21:42:08,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2519 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1651, Invalid=6905, Unknown=0, NotChecked=0, Total=8556 [2022-03-15 21:42:08,342 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 343 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:08,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 0 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:42:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15498 states. [2022-03-15 21:42:08,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15498 to 9031. [2022-03-15 21:42:08,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9031 states, 9030 states have (on average 4.262679955703211) internal successors, (38492), 9030 states have internal predecessors, (38492), 0 states have call successors, (0), 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:42:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9031 states to 9031 states and 38492 transitions. [2022-03-15 21:42:08,697 INFO L78 Accepts]: Start accepts. Automaton has 9031 states and 38492 transitions. Word has length 21 [2022-03-15 21:42:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:08,697 INFO L470 AbstractCegarLoop]: Abstraction has 9031 states and 38492 transitions. [2022-03-15 21:42:08,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.0) internal successors, (100), 24 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:42:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 9031 states and 38492 transitions. [2022-03-15 21:42:08,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:42:08,719 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:08,719 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:08,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-15 21:42:08,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 21:42:08,927 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:08,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:08,928 INFO L85 PathProgramCache]: Analyzing trace with hash 363963212, now seen corresponding path program 15 times [2022-03-15 21:42:08,928 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:08,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540057180] [2022-03-15 21:42:08,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:08,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:09,006 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:42:09,006 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:09,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540057180] [2022-03-15 21:42:09,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540057180] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:09,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221408485] [2022-03-15 21:42:09,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:42:09,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:09,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:09,008 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:42:09,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 21:42:09,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 21:42:09,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:09,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:42:09,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:42:09,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:42:09,156 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221408485] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:09,156 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:09,156 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 14 [2022-03-15 21:42:09,156 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1136916639] [2022-03-15 21:42:09,156 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:09,158 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:09,175 INFO L252 McrAutomatonBuilder]: Finished intersection with 138 states and 298 transitions. [2022-03-15 21:42:09,175 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:11,033 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [93421#(or (not (< l N)) (<= (+ N 1) i) (< k N)), 93435#(or (<= N (+ 3 i)) (< k N)), 93439#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N) (<= N l)), 93418#(or (<= (+ N 1) i) (< k N)), 93323#(< (+ l 1) N), 93440#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 k) N) (<= N l)), 93423#(or (<= N k) (< (+ k 1) N) (<= N l)), 93437#(or (<= N (+ i 1)) (<= N l)), 93429#(or (<= N (+ k 1)) (< (+ 2 l) N) (<= N (+ l 1)) (< (+ 2 k) N)), 93425#(or (<= N i) (<= N l)), 93410#(or (< (+ 2 l) N) (<= N (+ l 1))), 93411#(<= N l), 93441#(and (or (<= N k) (= (+ l (* (- 1) i)) 0) (< (+ k 1) N)) (or (<= N (+ 2 i)) (<= N k) (< (+ k 1) N))), 93413#(< k N), 93420#(or (< k N) (<= N l)), 93419#(or (< (+ 2 l) N) (<= N (+ l 1)) (< k N)), 93412#(or (not (< l N)) (<= (+ N 1) i)), 93424#(or (<= (+ N 1) i) (<= N k) (< (+ k 1) N) (<= N l)), 93409#(or (< (+ l 1) N) (<= N l)), 93432#(or (<= N (+ k 1)) (<= N i) (< (+ 2 k) N) (<= N l)), 93415#(or (< (+ l 1) N) (< k N)), 93427#(or (<= N i) (< k N) (<= N l)), 93431#(or (<= N (+ k 1)) (<= (+ N 1) i) (< (+ 2 k) N) (<= N l)), 93333#(< l N), 93442#(and (or (<= N (+ k 1)) (< (+ 2 k) N) (= (+ l (* (- 1) i)) 0)) (or (<= N (+ k 1)) (<= N (+ 2 i)) (< (+ 2 k) N))), 93438#(or (<= N (+ i 1)) (< k N) (<= N l)), 93416#(or (< (+ l 1) N) (< k N) (<= N l)), 93422#(or (< (+ 2 l) N) (<= N (+ l 1)) (<= N k) (< (+ k 1) N)), 93414#(or (< k N) (< l N)), 93430#(or (<= N (+ k 1)) (< (+ 2 k) N) (<= N l)), 93417#(or (<= N i) (< k N)), 93426#(or (<= N (+ i 1)) (< k N)), 93433#(or (<= N (+ 2 i)) (< k N)), 93434#(<= N (+ 3 i)), 93436#(and (or (<= N (+ 2 i)) (< k N)) (or (< k N) (= (+ l (* (- 1) i)) 0))), 93428#(or (<= N i) (<= N k) (< (+ k 1) N) (<= N l))] [2022-03-15 21:42:11,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 21:42:11,033 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:11,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 21:42:11,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=2054, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 21:42:11,034 INFO L87 Difference]: Start difference. First operand 9031 states and 38492 transitions. Second operand has 46 states, 46 states have (on average 3.9565217391304346) internal successors, (182), 45 states have internal predecessors, (182), 0 states have call successors, (0), 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:42:15,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:15,675 INFO L93 Difference]: Finished difference Result 16635 states and 67047 transitions. [2022-03-15 21:42:15,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-03-15 21:42:15,676 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.9565217391304346) internal successors, (182), 45 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:42:15,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:15,792 INFO L225 Difference]: With dead ends: 16635 [2022-03-15 21:42:15,793 INFO L226 Difference]: Without dead ends: 16481 [2022-03-15 21:42:15,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 115 SyntacticMatches, 3 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8317 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4234, Invalid=21526, Unknown=0, NotChecked=0, Total=25760 [2022-03-15 21:42:15,795 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 691 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 2552 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 2552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:15,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [691 Valid, 0 Invalid, 3044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 2552 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 21:42:15,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16481 states. [2022-03-15 21:42:16,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16481 to 9562. [2022-03-15 21:42:16,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9562 states, 9561 states have (on average 4.252693232925426) internal successors, (40660), 9561 states have internal predecessors, (40660), 0 states have call successors, (0), 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:42:16,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9562 states to 9562 states and 40660 transitions. [2022-03-15 21:42:16,077 INFO L78 Accepts]: Start accepts. Automaton has 9562 states and 40660 transitions. Word has length 21 [2022-03-15 21:42:16,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:16,078 INFO L470 AbstractCegarLoop]: Abstraction has 9562 states and 40660 transitions. [2022-03-15 21:42:16,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.9565217391304346) internal successors, (182), 45 states have internal predecessors, (182), 0 states have call successors, (0), 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:42:16,078 INFO L276 IsEmpty]: Start isEmpty. Operand 9562 states and 40660 transitions. [2022-03-15 21:42:16,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:42:16,094 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:16,094 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:16,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 21:42:16,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:16,295 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:16,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:16,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1672747866, now seen corresponding path program 16 times [2022-03-15 21:42:16,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:16,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459704804] [2022-03-15 21:42:16,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:16,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:16,366 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:42:16,366 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:16,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459704804] [2022-03-15 21:42:16,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459704804] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:16,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745373325] [2022-03-15 21:42:16,366 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:42:16,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:16,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:16,368 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:42:16,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 21:42:16,395 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:42:16,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:16,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:42:16,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:16,429 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:42:16,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:16,477 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:42:16,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745373325] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:16,478 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:16,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 11 [2022-03-15 21:42:16,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [279671716] [2022-03-15 21:42:16,478 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:16,479 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:16,489 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 220 transitions. [2022-03-15 21:42:16,489 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:17,957 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [129523#(< k N), 129575#(or (<= (+ k 1) i) (<= N k)), 129573#(or (<= N (+ k 1)) (<= (+ 3 k) i) (<= (+ k 1) l)), 129578#(<= N (+ i 1)), 129571#(or (<= N (+ k 1)) (< (+ 2 l) N) (<= (+ k 1) l)), 129567#(or (< (+ 2 l) N) (<= N (+ l 1)) (<= N k) (< (+ k 1) N)), 129576#(or (not (< l N)) (not (< l p)) (<= (+ k 1) i) (<= N k)), 129569#(or (<= (+ 3 k) N) (not (< l N)) (not (< l p)) (<= N k)), 129562#(or (< (+ l 1) N) (< k N)), 129584#(or (<= k i) (<= N k)), 129582#(or (<= N (+ i 1)) (< k N)), 129585#(or (not (< l N)) (<= k i) (not (< l p)) (<= N k)), 129563#(or (< (+ l 1) N) (not (< l N)) (not (< l p)) (< k N)), 129566#(or (<= (+ 2 k) i) (<= N k)), 129574#(<= N i), 129588#(and (or (<= N k) (= l i)) (or (<= N k) (<= k l))), 129579#(<= N (+ 2 i)), 129587#(or (<= N (+ 3 i)) (< k N)), 129583#(or (<= N (+ 2 i)) (< k N)), 129559#(< (+ l 1) N), 129581#(or (<= N i) (< k N)), 129580#(<= N (+ 3 i)), 129558#(< l N), 129564#(or (< (+ l 1) N) (<= N k) (< (+ k 1) N) (<= N l)), 129561#(or (< k N) (< l N)), 129565#(or (<= (+ 3 k) N) (<= N k)), 129570#(or (<= (+ 2 k) i) (not (< l N)) (not (< l p)) (<= N k)), 129560#(or (< (+ l 1) N) (not (< l N)) (not (< l p))), 129568#(or (< (+ 2 l) N) (<= N (+ l 1)) (<= N k) (< (+ k 1) N) (<= p l)), 129577#(or (<= N (+ k 1)) (<= (+ 2 k) i) (<= (+ k 1) l)), 129572#(or (<= N (+ k 1)) (<= (+ k 4) N) (<= (+ k 1) l)), 129586#(or (<= N (+ k 1)) (<= (+ k 1) i) (<= (+ k 1) l))] [2022-03-15 21:42:17,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 21:42:17,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:17,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 21:42:17,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1575, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 21:42:17,958 INFO L87 Difference]: Start difference. First operand 9562 states and 40660 transitions. Second operand has 42 states, 42 states have (on average 3.5714285714285716) internal successors, (150), 41 states have internal predecessors, (150), 0 states have call successors, (0), 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:42:29,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:29,265 INFO L93 Difference]: Finished difference Result 48731 states and 185228 transitions. [2022-03-15 21:42:29,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 307 states. [2022-03-15 21:42:29,266 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.5714285714285716) internal successors, (150), 41 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:42:29,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:29,482 INFO L225 Difference]: With dead ends: 48731 [2022-03-15 21:42:29,482 INFO L226 Difference]: Without dead ends: 46773 [2022-03-15 21:42:29,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 335 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46847 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=17348, Invalid=95884, Unknown=0, NotChecked=0, Total=113232 [2022-03-15 21:42:29,487 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1182 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 2938 mSolverCounterSat, 592 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 592 IncrementalHoareTripleChecker+Valid, 2938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:29,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1182 Valid, 0 Invalid, 3530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [592 Valid, 2938 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 21:42:29,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46773 states. [2022-03-15 21:42:30,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46773 to 7299. [2022-03-15 21:42:30,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7299 states, 7298 states have (on average 4.022060838585914) internal successors, (29353), 7298 states have internal predecessors, (29353), 0 states have call successors, (0), 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:42:30,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7299 states to 7299 states and 29353 transitions. [2022-03-15 21:42:30,205 INFO L78 Accepts]: Start accepts. Automaton has 7299 states and 29353 transitions. Word has length 21 [2022-03-15 21:42:30,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:30,205 INFO L470 AbstractCegarLoop]: Abstraction has 7299 states and 29353 transitions. [2022-03-15 21:42:30,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.5714285714285716) internal successors, (150), 41 states have internal predecessors, (150), 0 states have call successors, (0), 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:42:30,205 INFO L276 IsEmpty]: Start isEmpty. Operand 7299 states and 29353 transitions. [2022-03-15 21:42:30,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:42:30,221 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:30,221 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:30,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 21:42:30,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:30,442 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:30,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:30,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1568478212, now seen corresponding path program 17 times [2022-03-15 21:42:30,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:30,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261087049] [2022-03-15 21:42:30,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:30,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:30,755 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:30,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261087049] [2022-03-15 21:42:30,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261087049] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:30,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081755435] [2022-03-15 21:42:30,756 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:42:30,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:30,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:30,757 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:42:30,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 21:42:30,790 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:42:30,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:30,791 WARN L261 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-15 21:42:30,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:30,938 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-03-15 21:42:30,984 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 21:42:31,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:42:31,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:42:31,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:42:31,066 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 43 [2022-03-15 21:42:31,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:42:31,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:42:31,074 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2022-03-15 21:42:31,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2022-03-15 21:42:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:31,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:31,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:42:31,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:42:31,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:42:31,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:42:31,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:42:31,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:42:31,767 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:42:31,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:42:31,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:42:31,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:42:31,779 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:42:31,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:42:31,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:42:31,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:42:31,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:42:31,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:42:31,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:42:31,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:42:31,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:42:32,020 INFO L353 Elim1Store]: treesize reduction 44, result has 65.9 percent of original size [2022-03-15 21:42:32,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 32 treesize of output 97 [2022-03-15 21:42:32,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:42:32,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:42:32,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:42:32,242 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:42:32,242 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:42:32,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:42:32,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:42:32,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:42:32,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:42:32,245 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 5 [2022-03-15 21:42:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:32,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081755435] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:32,298 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:32,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2022-03-15 21:42:32,298 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1974557806] [2022-03-15 21:42:32,298 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:32,301 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:32,318 INFO L252 McrAutomatonBuilder]: Finished intersection with 156 states and 338 transitions. [2022-03-15 21:42:32,318 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:57,092 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 76 new interpolants: [193720#(and (or (<= N (+ 2 i)) (<= (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1))) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)))) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (= csum 0)) (or (not (< (+ 2 i) N)) (= l 0) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1)))))), 193687#(and (or (< (+ l 1) N) (not (< l N)) (< (+ (select C l) csum) (+ N asum 1))) (or (< (+ l 1) N) (<= (+ N asum) (+ (select C l) csum)) (<= N l))), 193677#(and (or (not (< (+ 2 i) N)) (< csum (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)) 1)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) csum) (< (+ 3 i) N))), 193693#(and (or (not (< k N)) (< (+ 3 l) N) (not (< (+ 2 l) N)) (< (+ (select C l) csum (select A k) (select C (+ l 1))) (+ N asum)) (< (+ k 1) N)) (or (not (< k N)) (< (+ 3 l) N) (<= (+ N asum) (+ (select C l) csum (select A k) (select C (+ l 1)) 1)) (< (+ k 1) N) (<= N (+ 2 l)))), 193706#(and (or (<= (+ (select A i) N asum) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1)))) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (= l 0) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1))) (+ (select A i) N asum))) (or (< (+ i 1) N) (not (< i N)) (= csum 0))), 193708#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (<= (+ (select A i) N asum) (+ (select C l) csum))) (or (< (+ i 1) N) (not (< i N)) (< k N) (<= (+ (select C l) csum) (+ (select A i) N asum)))), 193678#(and (or (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select C l) csum)) (< (+ 3 i) N)) (or (<= N (+ 2 i)) (<= (+ (select C l) csum) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)))) (< (+ 3 i) N))), 193734#(and (or (not (< (+ 2 k) N)) (= csum 0) (< (+ 3 k) N) (< i N)) (or (<= (+ N asum) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1)))) (not (< (+ 2 k) N)) (= l k) (= (+ 2 l) k) (= (+ 2 k) l) (= l (+ k 1)) (< (+ 3 k) N) (= (+ l 1) k) (< i N)) (or (not (< (+ 2 k) N)) (<= (+ (select A (+ 2 k)) (select C 1) (select C 2) 1) (+ N asum)) (not (= (+ 2 k) l)) (< (+ 3 k) N) (< i N)) (or (<= (+ N asum) (+ (select A (+ k 1)) (select C l) 2 csum (select A k))) (not (= (+ l 1) k)) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (<= N (+ 2 k)) (not (= (+ k 1) 0)) (< (+ 3 k) N) (< i N) (<= (+ (select A (+ k 1)) 2 (select A (+ 2 k)) (select C 2)) (+ N asum))) (or (<= (+ (select C l) (select A k) (select C 1) 1) (+ N asum)) (<= N (+ 2 k)) (< (+ 3 k) N) (not (= 2 k)) (< i N)) (or (not (< (+ 2 k) N)) (<= (+ N asum) (+ (select A (+ 2 k)) csum (select C (+ 2 l)) (select C (+ l 1)) 1)) (not (= (+ 2 k) l)) (< (+ 3 k) N) (< i N)) (or (<= (+ N asum) (+ (select C l) csum (select A k) (select C (+ l 1)) 1)) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N) (not (= (+ 2 l) k))) (or (not (< (+ 2 k) N)) (= (+ k 1) 0) (= 2 k) (= k 0) (<= (+ (select C l) (select C 1) (select C 2)) (+ N asum)) (= (+ 2 k) l) (< (+ 3 k) N) (= k 1) (< i N)) (or (not (= l (+ k 1))) (<= (+ N asum) (+ (select A (+ k 1)) 2 (select A (+ 2 k)) csum (select C (+ 2 l)))) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (<= (+ N asum) (+ (select A (+ k 1)) (select A (+ 2 k)) 3 csum (select A k))) (<= N (+ 2 k)) (< (+ 3 k) N) (not (= l k)) (< i N)) (or (not (< (+ 2 k) N)) (= l 0) (< (+ 3 k) N) (< i N)) (or (not (< (+ 2 k) N)) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) 3 (select A k)) (+ N asum)) (< (+ 3 k) N) (< i N) (not (= k 0))) (or (<= (+ (select A (+ k 1)) (select C l) 2 (select A k)) (+ N asum)) (<= N (+ 2 k)) (not (= k 1)) (< (+ 3 k) N) (< i N))), 193685#(and (or (< (+ l 1) N) (< (+ (select C l) csum) (+ N asum 1)) (< k N)) (or (< (+ l 1) N) (< k N) (<= (+ N asum) (+ (select C l) csum)))), 193736#(and (or (= k 0) (< i N)) (or (< i N) (<= (+ N asum) (+ (select A (+ k 1)) (select A (+ 2 k)) 3 (select A k)))) (or (<= (+ (select A (+ k 1)) (select A (+ 2 k)) 3 (select A k)) (+ N asum)) (< i N)) (or (= csum 0) (< i N)) (or (= l 0) (< i N))), 193672#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) csum)) (or (< (+ i 1) N) (not (< i N)) (< csum (+ (select A i) N asum 1)))), 193719#(and (or (= l k) (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (= (+ 2 l) k) (< (+ 2 k) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1)))) (= l (+ k 1)) (= (+ l 1) k)) (or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ (select C l) (select A k) (select C 1) 1) (+ (select A i) N asum (select A (+ i 1)))) (< (+ 2 k) N) (not (= 2 k))) (or (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (= csum 0)) (or (<= (+ (select A (+ k 1)) (select C l) 2 (select A k)) (+ (select A i) N asum (select A (+ i 1)))) (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (not (= k 1))) (or (<= N (+ k 1)) (not (< (+ i 1) N)) (<= (+ (select A (+ k 1)) 2 (select A k) (select C 2)) (+ (select A i) N asum (select A (+ i 1)))) (< (+ 2 i) N) (< (+ 2 k) N) (not (= k 0))) (or (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (not (= l (+ k 1))) (< (+ 2 k) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select A (+ k 1)) csum (select C (+ 2 l)) (select C (+ l 1)) 1))) (or (<= N (+ k 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select A (+ k 1)) 2 csum (select C (+ 2 l)) (select A k))) (not (= l k))) (or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N) (< (+ 2 k) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) csum (select A k) (select C (+ l 1)) 1)) (not (= (+ 2 l) k))) (or (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (= l 0) (< (+ 2 k) N)) (or (<= (+ (select A (+ k 1)) (select C 1) (select C 2) 1) (+ (select A i) N asum (select A (+ i 1)))) (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (not (= l (+ k 1))) (< (+ 2 k) N)) (or (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (<= (+ (select C l) (select C 1) (select C 2)) (+ (select A i) N asum (select A (+ i 1)))) (= 2 k) (= k 0) (< (+ 2 k) N) (= l (+ k 1)) (= k 1)) (or (<= N (+ k 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (+ l 1) k)) (< (+ 2 k) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select A (+ k 1)) (select C l) 2 csum (select A k))))), 193696#(and (or (= l 0) (< k N)) (or (< k N) (<= (+ (select C l) (select C 1) (select C 2)) (+ N asum))) (or (< k N) (= csum 0)) (or (<= (+ N asum) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1)))) (< k N))), 193737#(and (or (< (+ i 1) N) (not (< i N)) (= k 0)) (or (< (+ i 1) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) 3 (select A k)) (+ (select A i) N asum)) (not (< i N))) (or (< (+ i 1) N) (<= (+ (select A i) N asum) (+ (select A (+ k 1)) (select A (+ 2 k)) 3 (select A k))) (not (< i N))) (or (< (+ i 1) N) (= l 0) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (= csum 0))), 193722#(and (or (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select C l) csum)) (< (+ 3 i) N) (< k N)) (or (< (+ (select C l) csum) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)) 1)) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N))), 193694#(and (or (not (< (+ k 1) N)) (< (+ 3 l) N) (< (+ 2 k) N) (not (< (+ 2 l) N)) (< (+ (select A (+ k 1)) (select C l) csum (select A k) 1) (+ N asum))) (or (<= (+ N asum) (+ (select A (+ k 1)) (select C l) 2 csum (select A k))) (not (< (+ k 1) N)) (< (+ 3 l) N) (< (+ 2 k) N) (<= N (+ 2 l)))), 193613#(or (< (+ l 1) N) (and (< (+ (select C l) csum) (+ N asum 1)) (<= (+ N asum) (+ (select C l) csum)))), 193740#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= csum 0)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= l 0)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= k 0)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) 3 (select A k)) (+ (select A i) N asum (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) 3 (select A k))))), 193716#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (<= (+ (select C l) csum (select C (+ l 1))) (+ (select A i) N asum (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) csum (select C (+ l 1)))) (< k N))), 193695#(and (or (<= (+ N asum) (+ (select C l) csum (select C (+ l 1)))) (< k N)) (or (< k N) (<= (+ (select C l) csum (select C (+ l 1))) (+ N asum)))), 193713#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= csum 0)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= l 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1))) (+ (select A i) N asum (select A (+ i 1)))))), 193731#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) (+ (select A (+ k 1)) (select C l) 2 (select A k)))) (or (< (+ i 1) N) (not (< i N)) (= k 1)) (or (< (+ i 1) N) (= l 0) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A (+ k 1)) (select C l) 2 (select A k)) (+ (select A i) N asum))) (or (< (+ i 1) N) (not (< i N)) (= csum 0))), 193714#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) csum) (< k N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< csum (+ (select A i) N asum (select A (+ i 1)) 1)) (< k N))), 193712#(and (or (<= N (+ k 1)) (< (+ i 1) N) (not (= (+ l 1) k)) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A i) N asum) (+ (select A (+ k 1)) (select C l) 2 csum (select A k)))) (or (not (< (+ k 1) N)) (< (+ i 1) N) (not (< i N)) (not (= l (+ k 1))) (< (+ 2 k) N) (<= (+ (select A (+ k 1)) (select C 1) (select C 2) 1) (+ (select A i) N asum))) (or (not (< (+ k 1) N)) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (not (= k 1)) (<= (+ (select A (+ k 1)) (select C l) 2 (select A k)) (+ (select A i) N asum))) (or (not (< (+ k 1) N)) (< (+ i 1) N) (not (< i N)) (not (= l (+ k 1))) (< (+ 2 k) N) (<= (+ (select A i) N asum) (+ (select A (+ k 1)) csum (select C (+ 2 l)) (select C (+ l 1)) 1))) (or (not (< (+ k 1) N)) (< (+ i 1) N) (= 2 k) (not (< i N)) (= k 0) (< (+ 2 k) N) (= l (+ k 1)) (= k 1) (<= (+ (select C l) (select C 1) (select C 2)) (+ (select A i) N asum))) (or (<= N (+ k 1)) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A (+ k 1)) 2 (select A k) (select C 2)) (+ (select A i) N asum)) (not (= k 0))) (or (not (< (+ k 1) N)) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (= csum 0)) (or (<= N (+ k 1)) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (not (= l k)) (<= (+ (select A i) N asum) (+ (select A (+ k 1)) 2 csum (select C (+ 2 l)) (select A k)))) (or (<= (+ (select A i) N asum) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1)))) (= l k) (not (< (+ k 1) N)) (< (+ i 1) N) (= (+ 2 l) k) (not (< i N)) (< (+ 2 k) N) (= l (+ k 1)) (= (+ l 1) k)) (or (not (< (+ k 1) N)) (< (+ i 1) N) (= l 0) (not (< i N)) (< (+ 2 k) N)) (or (<= N (+ k 1)) (<= N i) (< (+ i 1) N) (< (+ 2 k) N) (<= (+ (select A i) N asum) (+ (select C l) csum (select A k) (select C (+ l 1)) 1)) (not (= (+ 2 l) k))) (or (<= N (+ k 1)) (<= (+ (select C l) (select A k) (select C 1) 1) (+ (select A i) N asum)) (<= N i) (< (+ i 1) N) (< (+ 2 k) N) (not (= 2 k)))), 193718#(and (or (not (< k N)) (<= (+ (select A k) (select C 1) (select C 2) 1) (+ (select A i) N asum (select A (+ i 1)))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ k 1) N) (not (= l k))) (or (not (< k N)) (= l k) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select C l) (select C 1) (select C 2)) (+ (select A i) N asum (select A (+ i 1)))) (= 2 k) (< (+ k 1) N) (= k 1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= N k) (< (+ k 1) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) csum (select A k) (select C (+ l 1)) 1)) (not (= (+ 2 l) k))) (or (not (< k N)) (= l k) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (+ 2 l) k) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1)))) (< (+ k 1) N) (= (+ l 1) k)) (or (not (< k N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select C l) (select A k) (select C 1) 1) (+ (select A i) N asum (select A (+ i 1)))) (< (+ k 1) N) (not (= 2 k))) (or (not (< k N)) (not (< (+ i 1) N)) (<= (+ (select A i) N asum (select A (+ i 1))) (+ csum (select C (+ 2 l)) (select A k) (select C (+ l 1)) 1)) (< (+ 2 i) N) (< (+ k 1) N) (not (= l k))) (or (not (< k N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= csum 0) (< (+ k 1) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (+ l 1) k)) (<= N k) (< (+ k 1) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) csum (select C (+ 2 l)) (select A k) 1))) (or (not (< k N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= l 0) (< (+ k 1) N)) (or (not (< (+ i 1) N)) (<= (+ (select C l) (select A k) (select C 2) 1) (+ (select A i) N asum (select A (+ i 1)))) (< (+ 2 i) N) (<= N k) (< (+ k 1) N) (not (= k 1)))), 193727#(and (or (= csum 0) (< i N)) (or (<= (+ (select C l) (select A k) (select C 1) 1) (+ N asum)) (< i N)) (or (= l 0) (< i N)) (or (<= (+ N asum) (+ (select C l) (select A k) (select C 1) 1)) (< i N)) (or (= 2 k) (< i N))), 193699#(and (or (= csum 0) (< i N)) (or (< i N) (<= (+ N asum) (+ (select C l) (select C 1) (select C 2)))) (or (= l 0) (< i N)) (or (<= (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1))) (+ N asum)) (< i N))), 193681#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) csum (select C (+ l 1))))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ (select C l) csum (select C (+ l 1))) (+ (select A i) N asum (select A (+ i 1)))))), 193704#(and (or (<= (+ N asum) (+ csum (select C (+ 2 l)) (select A k) (select C (+ l 1)) 1)) (not (< k N)) (< (+ k 1) N) (not (= l k)) (< i N)) (or (not (< k N)) (<= (+ (select C l) (select A k) (select C 1) 1) (+ N asum)) (< (+ k 1) N) (not (= 2 k)) (< i N)) (or (<= (+ (select C l) (select A k) (select C 2) 1) (+ N asum)) (<= N k) (< (+ k 1) N) (not (= k 1)) (< i N)) (or (<= N k) (<= (+ N asum) (+ (select C l) csum (select A k) (select C (+ l 1)) 1)) (< (+ k 1) N) (< i N) (not (= (+ 2 l) k))) (or (not (< k N)) (= l 0) (< (+ k 1) N) (< i N)) (or (not (< k N)) (= l k) (= 2 k) (<= (+ (select C l) (select C 1) (select C 2)) (+ N asum)) (< (+ k 1) N) (= k 1) (< i N)) (or (not (= (+ l 1) k)) (<= N k) (< (+ k 1) N) (<= (+ N asum) (+ (select C l) csum (select C (+ 2 l)) (select A k) 1)) (< i N)) (or (not (< k N)) (= csum 0) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< (+ k 1) N) (not (= l k)) (< i N) (<= (+ (select A k) (select C 1) (select C 2) 1) (+ N asum))) (or (not (< k N)) (<= (+ N asum) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1)))) (= l k) (= (+ 2 l) k) (< (+ k 1) N) (= (+ l 1) k) (< i N))), 193724#(and (or (not (< (+ 2 i) N)) (= l 0) (< (+ 3 i) N) (< k N)) (or (<= N (+ 2 i)) (<= (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1))) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)))) (< (+ 3 i) N) (< k N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (= csum 0)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1)))))), 193711#(and (or (<= (+ (select C l) (select A k) (select C 2) 1) (+ (select A i) N asum)) (< (+ i 1) N) (not (< i N)) (<= N k) (< (+ k 1) N) (not (= k 1))) (or (not (< k N)) (<= (+ (select C l) (select A k) (select C 1) 1) (+ (select A i) N asum)) (< (+ i 1) N) (not (< i N)) (< (+ k 1) N) (not (= 2 k))) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) (+ (select C l) csum (select A k) (select C (+ l 1)) 1)) (<= N k) (< (+ k 1) N) (not (= (+ 2 l) k))) (or (<= (+ (select A i) N asum) (+ (select C l) csum (select C (+ 2 l)) (select A k) 1)) (< (+ i 1) N) (not (= (+ l 1) k)) (not (< i N)) (<= N k) (< (+ k 1) N)) (or (not (< k N)) (< (+ i 1) N) (= l 0) (not (< i N)) (< (+ k 1) N)) (or (not (< k N)) (< (+ i 1) N) (not (< i N)) (< (+ k 1) N) (not (= l k)) (<= (+ (select A i) N asum) (+ csum (select C (+ 2 l)) (select A k) (select C (+ l 1)) 1))) (or (not (< k N)) (= l k) (< (+ i 1) N) (= 2 k) (not (< i N)) (< (+ k 1) N) (= k 1) (<= (+ (select C l) (select C 1) (select C 2)) (+ (select A i) N asum))) (or (not (< k N)) (< (+ i 1) N) (not (< i N)) (= csum 0) (< (+ k 1) N)) (or (not (< k N)) (<= (+ (select A i) N asum) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1)))) (= l k) (< (+ i 1) N) (= (+ 2 l) k) (not (< i N)) (< (+ k 1) N) (= (+ l 1) k)) (or (not (< k N)) (< (+ i 1) N) (not (< i N)) (<= (+ (select A k) (select C 1) (select C 2) 1) (+ (select A i) N asum)) (< (+ k 1) N) (not (= l k)))), 193726#(and (or (not (< (+ k 1) N)) (not (< (+ 2 i) N)) (< (+ 2 k) N) (< (+ 3 i) N) (= csum 0)) (or (<= N (+ k 1)) (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select A (+ k 1)) 2 csum (select C (+ 2 l)) (select A k))) (< (+ 2 k) N) (< (+ 3 i) N) (not (= l k))) (or (= l k) (not (< (+ k 1) N)) (not (< (+ 2 i) N)) (< (+ 2 k) N) (and (= (+ 2 l) k) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select C l) csum (select A k) (select C (+ l 1)) 1))) (< (+ 3 i) N) (= l (+ k 1)) (and (not (= (+ 2 l) k)) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1))))) (= (+ l 1) k)) (or (not (< (+ k 1) N)) (not (< (+ 2 i) N)) (not (= l (+ k 1))) (< (+ 2 k) N) (< (+ 3 i) N) (<= (+ (select A (+ k 1)) (select C 1) (select C 2) 1) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))))) (or (not (< (+ k 1) N)) (not (< (+ 2 i) N)) (= l 0) (< (+ 2 k) N) (< (+ 3 i) N)) (or (not (< (+ k 1) N)) (not (< (+ 2 i) N)) (= k 0) (< (+ 2 k) N) (< (+ 3 i) N) (and (<= (+ (select C l) (select C 1) (select C 2)) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)))) (not (= 2 k))) (= l (+ k 1)) (= k 1) (and (<= (+ (select C l) (select A k) (select C 1) 1) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)))) (= 2 k))) (or (<= N (+ k 1)) (not (< (+ 2 i) N)) (< (+ 2 k) N) (< (+ 3 i) N) (<= (+ (select A (+ k 1)) 2 (select A k) (select C 2)) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)))) (not (= k 0))) (or (not (< (+ k 1) N)) (not (< (+ 2 i) N)) (not (= l (+ k 1))) (< (+ 2 k) N) (< (+ 3 i) N) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select A (+ k 1)) csum (select C (+ 2 l)) (select C (+ l 1)) 1))) (or (<= N (+ k 1)) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select A (+ k 1)) (select C l) 2 csum (select A k))) (not (< (+ 2 i) N)) (not (= (+ l 1) k)) (< (+ 2 k) N) (< (+ 3 i) N)) (or (not (< (+ k 1) N)) (not (< (+ 2 i) N)) (< (+ 2 k) N) (< (+ 3 i) N) (not (= k 1)) (<= (+ (select A (+ k 1)) (select C l) 2 (select A k)) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)))))), 193742#(and (or (not (< (+ 2 k) N)) (= l k) (not (< (+ 2 i) N)) (and (= (+ 2 l) k) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select C l) csum (select A k) (select C (+ l 1)) 1))) (< (+ 3 i) N) (= (+ 2 k) l) (= l (+ k 1)) (< (+ 3 k) N) (and (not (= (+ 2 l) k)) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1))))) (= (+ l 1) k)) (or (not (< (+ 2 i) N)) (<= (+ (select A (+ k 1)) 2 (select A (+ 2 k)) (select C 2)) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)))) (< (+ 3 i) N) (<= N (+ 2 k)) (not (= (+ k 1) 0)) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (<= (+ (select A (+ 2 k)) (select C 1) (select C 2) 1) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)))) (not (< (+ 2 i) N)) (< (+ 3 i) N) (not (= (+ 2 k) l)) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (not (< (+ 2 i) N)) (< (+ 3 i) N) (= csum 0) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select A (+ 2 k)) csum (select C (+ 2 l)) (select C (+ l 1)) 1)) (not (= (+ 2 k) l)) (< (+ 3 k) N)) (or (not (< (+ 2 i) N)) (not (= l (+ k 1))) (< (+ 3 i) N) (<= N (+ 2 k)) (< (+ 3 k) N) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select A (+ k 1)) 2 (select A (+ 2 k)) csum (select C (+ 2 l))))) (or (not (< (+ 2 k) N)) (= (+ k 1) 0) (not (< (+ 2 i) N)) (= k 0) (< (+ 3 i) N) (= (+ 2 k) l) (and (<= (+ (select C l) (select C 1) (select C 2)) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)))) (not (= 2 k))) (< (+ 3 k) N) (= k 1) (and (<= (+ (select C l) (select A k) (select C 1) 1) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)))) (= 2 k))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (<= N (+ 2 k)) (not (= k 1)) (< (+ 3 k) N) (<= (+ (select A (+ k 1)) (select C l) 2 (select A k)) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))))) (or (not (< (+ 2 k) N)) (not (< (+ 2 i) N)) (= l 0) (< (+ 3 i) N) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (not (< (+ 2 i) N)) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) 3 (select A k)) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)))) (< (+ 3 i) N) (< (+ 3 k) N) (not (= k 0))) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= N (+ 2 k)) (< (+ 3 k) N) (not (= l k)) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) 3 csum (select A k)))) (or (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select A (+ k 1)) (select C l) 2 csum (select A k))) (<= N (+ 2 i)) (not (= (+ l 1) k)) (< (+ 3 i) N) (<= N (+ 2 k)) (< (+ 3 k) N))), 193744#(and (or (not (< (+ 2 i) N)) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) 3 (select A k)) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)))) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (= csum 0)) (or (not (< (+ 2 i) N)) (= l 0) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (= k 0) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) 3 (select A k))) (< (+ 3 i) N))), 193702#(and (or (<= (+ N asum) (+ (select C l) csum (select C (+ l 1)))) (< k N) (< i N)) (or (< k N) (<= (+ (select C l) csum (select C (+ l 1))) (+ N asum)) (< i N))), 193738#(and (or (<= (+ (select A (+ k 1)) (select C l) 2 (select A k)) (+ (select A i) N asum (select A (+ i 1)))) (not (< (+ i 1) N)) (< (+ 2 i) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= k 1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= csum 0)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= l 0)) (or (not (< (+ i 1) N)) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select A (+ k 1)) (select C l) 2 (select A k))) (< (+ 2 i) N))), 193709#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) (+ (select C l) csum (select C (+ l 1)))) (< k N)) (or (< (+ i 1) N) (<= (+ (select C l) csum (select C (+ l 1))) (+ (select A i) N asum)) (not (< i N)) (< k N))), 193733#(and (or (not (< (+ 2 k) N)) (<= (+ (select A (+ 2 k)) (select C 1) (select C 2) 1) (+ N asum)) (not (= (+ 2 k) l)) (< (+ 3 k) N)) (or (and (= (+ 2 l) k) (<= (+ N asum) (+ (select C l) csum (select A k) (select C (+ l 1)) 1))) (not (< (+ 2 k) N)) (= l k) (= (+ 2 k) l) (= l (+ k 1)) (< (+ 3 k) N) (and (<= (+ N asum) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1)))) (not (= (+ 2 l) k))) (= (+ l 1) k)) (or (not (< (+ 2 k) N)) (<= (+ N asum) (+ (select A (+ 2 k)) csum (select C (+ 2 l)) (select C (+ l 1)) 1)) (not (= (+ 2 k) l)) (< (+ 3 k) N)) (or (<= (+ N asum) (+ (select A (+ k 1)) (select A (+ 2 k)) 3 csum (select A k))) (<= N (+ 2 k)) (< (+ 3 k) N) (not (= l k))) (or (not (< (+ 2 k) N)) (= l 0) (< (+ 3 k) N)) (or (not (= l (+ k 1))) (<= (+ N asum) (+ (select A (+ k 1)) 2 (select A (+ 2 k)) csum (select C (+ 2 l)))) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (= (+ k 1) 0) (= k 0) (= (+ 2 k) l) (and (<= (+ (select C l) (select A k) (select C 1) 1) (+ N asum)) (= 2 k)) (< (+ 3 k) N) (and (<= (+ (select C l) (select C 1) (select C 2)) (+ N asum)) (not (= 2 k))) (= k 1)) (or (<= (+ (select A (+ k 1)) (select C l) 2 (select A k)) (+ N asum)) (<= N (+ 2 k)) (not (= k 1)) (< (+ 3 k) N)) (or (<= N (+ 2 k)) (not (= (+ k 1) 0)) (< (+ 3 k) N) (<= (+ (select A (+ k 1)) 2 (select A (+ 2 k)) (select C 2)) (+ N asum))) (or (<= (+ N asum) (+ (select A (+ k 1)) (select C l) 2 csum (select A k))) (not (= (+ l 1) k)) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) 3 (select A k)) (+ N asum)) (< (+ 3 k) N) (not (= k 0))) (or (not (< (+ 2 k) N)) (= csum 0) (< (+ 3 k) N))), 193684#(and (or (< k N) (<= (+ N asum) csum) (< l N)) (or (< k N) (< l N) (< csum (+ N asum 1)))), 193682#(and (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select C l) csum (select C (+ l 1))))) (or (<= N (+ 2 i)) (<= (+ (select C l) csum (select C (+ l 1))) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)))) (< (+ 3 i) N))), 193686#(and (or (<= (+ (select C l) csum) (+ N asum)) (< k N)) (or (< k N) (<= (+ N asum) (+ (select C l) csum)))), 193698#(and (or (not (< (+ k 1) N)) (not (= l (+ k 1))) (< (+ 2 k) N) (<= (+ (select A (+ k 1)) (select C 1) (select C 2) 1) (+ N asum))) (or (<= N (+ k 1)) (<= (+ N asum) (+ (select A (+ k 1)) (select C l) 2 csum (select A k))) (not (= (+ l 1) k)) (< (+ 2 k) N)) (or (not (< (+ k 1) N)) (< (+ 2 k) N) (= csum 0)) (or (not (< (+ k 1) N)) (= k 0) (< (+ 2 k) N) (= l (+ k 1)) (and (<= (+ (select C l) (select A k) (select C 1) 1) (+ N asum)) (= 2 k)) (and (<= (+ (select C l) (select C 1) (select C 2)) (+ N asum)) (not (= 2 k))) (= k 1)) (or (not (< (+ k 1) N)) (< (+ 2 k) N) (<= (+ (select A (+ k 1)) (select C l) 2 (select A k)) (+ N asum)) (not (= k 1))) (or (not (< (+ k 1) N)) (= l 0) (< (+ 2 k) N)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ (select A (+ k 1)) 2 (select A k) (select C 2)) (+ N asum)) (not (= k 0))) (or (<= (+ N asum) (+ (select A (+ k 1)) csum (select C (+ 2 l)) (select C (+ l 1)) 1)) (not (< (+ k 1) N)) (not (= l (+ k 1))) (< (+ 2 k) N)) (or (and (= (+ 2 l) k) (<= (+ N asum) (+ (select C l) csum (select A k) (select C (+ l 1)) 1))) (= l k) (not (< (+ k 1) N)) (< (+ 2 k) N) (= l (+ k 1)) (and (<= (+ N asum) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1)))) (not (= (+ 2 l) k))) (= (+ l 1) k)) (or (<= (+ N asum) (+ (select A (+ k 1)) 2 csum (select C (+ 2 l)) (select A k))) (<= N (+ k 1)) (< (+ 2 k) N) (not (= l k)))), 193689#(and (or (< (+ 2 l) N) (< (+ (select C l) csum (select C (+ l 1))) (+ N asum 1)) (not (< (+ l 1) N))) (or (< (+ 2 l) N) (<= N (+ l 1)) (<= (+ N asum) (+ (select C l) csum (select C (+ l 1)))))), 193723#(and (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select C l) csum (select C (+ l 1))))) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< (+ (select C l) csum (select C (+ l 1))) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)) 1)))), 193671#(and (or (<= (+ N asum) csum) (< i N)) (or (< i N) (< csum (+ N asum 1)))), 193705#(and (or (not (< (+ k 1) N)) (= l 0) (< (+ 2 k) N) (< i N)) (or (not (< (+ k 1) N)) (< (+ 2 k) N) (= csum 0) (< i N)) (or (<= N (+ k 1)) (< (+ 2 k) N) (< i N) (<= (+ (select A (+ k 1)) 2 (select A k) (select C 2)) (+ N asum)) (not (= k 0))) (or (not (< (+ k 1) N)) (= k 0) (< (+ 2 k) N) (= l (+ k 1)) (and (<= (+ (select C l) (select A k) (select C 1) 1) (+ N asum)) (= 2 k)) (and (<= (+ (select C l) (select C 1) (select C 2)) (+ N asum)) (not (= 2 k))) (= k 1) (< i N)) (or (<= (+ N asum) (+ (select A (+ k 1)) csum (select C (+ 2 l)) (select C (+ l 1)) 1)) (not (< (+ k 1) N)) (not (= l (+ k 1))) (< (+ 2 k) N) (< i N)) (or (and (= (+ 2 l) k) (<= (+ N asum) (+ (select C l) csum (select A k) (select C (+ l 1)) 1))) (= l k) (not (< (+ k 1) N)) (< (+ 2 k) N) (= l (+ k 1)) (and (<= (+ N asum) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1)))) (not (= (+ 2 l) k))) (= (+ l 1) k) (< i N)) (or (<= N (+ k 1)) (<= (+ N asum) (+ (select A (+ k 1)) (select C l) 2 csum (select A k))) (not (= (+ l 1) k)) (< (+ 2 k) N) (< i N)) (or (not (< (+ k 1) N)) (< (+ 2 k) N) (<= (+ (select A (+ k 1)) (select C l) 2 (select A k)) (+ N asum)) (not (= k 1)) (< i N)) (or (<= (+ N asum) (+ (select A (+ k 1)) 2 csum (select C (+ 2 l)) (select A k))) (<= N (+ k 1)) (< (+ 2 k) N) (not (= l k)) (< i N)) (or (not (< (+ k 1) N)) (not (= l (+ k 1))) (< (+ 2 k) N) (<= (+ (select A (+ k 1)) (select C 1) (select C 2) 1) (+ N asum)) (< i N))), 193701#(and (or (< k N) (<= (+ N asum) (+ (select C l) csum)) (< i N)) (or (<= (+ (select C l) csum) (+ N asum)) (< k N) (< i N))), 193676#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) csum))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ (select C l) csum) (+ (select A i) N asum (select A (+ i 1)))))), 193692#(and (or (< (+ 3 l) N) (not (< (+ 2 l) N)) (< k N) (< (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1))) (+ N asum 1))) (or (<= (+ N asum) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1)))) (< (+ 3 l) N) (< k N) (<= N (+ 2 l)))), 193700#(and (or (< k N) (<= (+ N asum) csum) (< i N)) (or (< k N) (< i N) (< csum (+ N asum 1)))), 193697#(and (or (not (< k N)) (and (not (= l k)) (or (and (not (= (+ l 1) k)) (or (and (= (+ 2 l) k) (<= (+ N asum) (+ (select C l) csum (select A k) (select C (+ l 1)) 1))) (and (<= (+ N asum) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1)))) (not (= (+ 2 l) k))))) (and (<= (+ N asum) (+ (select C l) csum (select C (+ 2 l)) (select A k) 1)) (= (+ l 1) k)))) (< (+ k 1) N) (and (<= (+ N asum) (+ csum (select C (+ 2 l)) (select A k) (select C (+ l 1)) 1)) (= l k))) (or (not (< k N)) (= l 0) (< (+ k 1) N)) (or (not (< k N)) (< (+ k 1) N) (and (= l k) (<= (+ (select A k) (select C 1) (select C 2) 1) (+ N asum))) (and (or (and (<= (+ (select C l) (select A k) (select C 1) 1) (+ N asum)) (= 2 k)) (and (or (and (<= (+ (select C l) (select A k) (select C 2) 1) (+ N asum)) (= k 1)) (and (<= (+ (select C l) (select C 1) (select C 2)) (+ N asum)) (not (= k 1)))) (not (= 2 k)))) (not (= l k)))) (or (not (< k N)) (= csum 0) (< (+ k 1) N))), 193680#(and (or (< (+ i 1) N) (<= (+ (select C l) csum (select C (+ l 1))) (+ (select A i) N asum)) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) (+ (select C l) csum (select C (+ l 1)))))), 193725#(and (or (<= (+ (select C l) (select A k) (select C 2) 1) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)))) (not (< (+ 2 i) N)) (<= N k) (< (+ 3 i) N) (< (+ k 1) N) (not (= k 1))) (or (not (< k N)) (= l k) (= (+ 2 l) k) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< (+ k 1) N) (= (+ l 1) k) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1))))) (or (not (< (+ 2 i) N)) (<= N k) (< (+ 3 i) N) (< (+ k 1) N) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select C l) csum (select A k) (select C (+ l 1)) 1)) (not (= (+ 2 l) k))) (or (not (< k N)) (= l k) (<= (+ (select C l) (select C 1) (select C 2)) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)))) (not (< (+ 2 i) N)) (= 2 k) (< (+ 3 i) N) (< (+ k 1) N) (= k 1)) (or (not (< k N)) (<= (+ (select A k) (select C 1) (select C 2) 1) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)))) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< (+ k 1) N) (not (= l k))) (or (not (< k N)) (not (< (+ 2 i) N)) (< (+ 3 i) N) (= csum 0) (< (+ k 1) N)) (or (not (< k N)) (not (< (+ 2 i) N)) (<= (+ (select C l) (select A k) (select C 1) 1) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)))) (< (+ 3 i) N) (< (+ k 1) N) (not (= 2 k))) (or (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select C l) csum (select C (+ 2 l)) (select A k) 1)) (not (< (+ 2 i) N)) (not (= (+ l 1) k)) (<= N k) (< (+ 3 i) N) (< (+ k 1) N)) (or (not (< k N)) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ csum (select C (+ 2 l)) (select A k) (select C (+ l 1)) 1)) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< (+ k 1) N) (not (= l k))) (or (not (< k N)) (not (< (+ 2 i) N)) (= l 0) (< (+ 3 i) N) (< (+ k 1) N))), 193707#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) csum) (< k N)) (or (< (+ i 1) N) (not (< i N)) (< k N) (< csum (+ (select A i) N asum 1)))), 193739#(and (or (<= (+ (select A (+ k 1)) 2 (select A (+ 2 k)) (select C 2)) (+ (select A i) N asum (select A (+ i 1)))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= N (+ 2 k)) (not (= (+ k 1) 0)) (< (+ 3 k) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) 3 csum (select A k))) (<= N (+ 2 k)) (< (+ 3 k) N) (not (= l k))) (or (not (< (+ 2 k) N)) (= l k) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (+ 2 l) k) (= (+ 2 k) l) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1)))) (= l (+ k 1)) (< (+ 3 k) N) (= (+ l 1) k)) (or (<= N (+ i 1)) (<= (+ (select A (+ k 1)) (select C l) 2 (select A k)) (+ (select A i) N asum (select A (+ i 1)))) (< (+ 2 i) N) (<= N (+ 2 k)) (not (= k 1)) (< (+ 3 k) N)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= N (+ 2 k)) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) csum (select A k) (select C (+ l 1)) 1)) (< (+ 3 k) N) (not (= (+ 2 l) k))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (+ l 1) k)) (<= N (+ 2 k)) (< (+ 3 k) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select A (+ k 1)) (select C l) 2 csum (select A k)))) (or (not (< (+ 2 k) N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select A (+ 2 k)) csum (select C (+ 2 l)) (select C (+ l 1)) 1)) (not (= (+ 2 k) l)) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ 2 k)) (select C 1) (select C 2) 1) (+ (select A i) N asum (select A (+ i 1)))) (not (= (+ 2 k) l)) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= l 0) (< (+ 3 k) N)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ (select C l) (select A k) (select C 1) 1) (+ (select A i) N asum (select A (+ i 1)))) (<= N (+ 2 k)) (< (+ 3 k) N) (not (= 2 k))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= l (+ k 1))) (<= N (+ 2 k)) (< (+ 3 k) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select A (+ k 1)) 2 (select A (+ 2 k)) csum (select C (+ 2 l))))) (or (not (< (+ 2 k) N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= csum 0) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) 3 (select A k)) (+ (select A i) N asum (select A (+ i 1)))) (< (+ 3 k) N) (not (= k 0))) (or (not (< (+ 2 k) N)) (not (< (+ i 1) N)) (= (+ k 1) 0) (< (+ 2 i) N) (<= (+ (select C l) (select C 1) (select C 2)) (+ (select A i) N asum (select A (+ i 1)))) (= 2 k) (= k 0) (= (+ 2 k) l) (< (+ 3 k) N) (= k 1))), 193609#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (< l N)), 193728#(and (or (< (+ i 1) N) (<= (+ (select A i) N asum) (+ (select C l) (select A k) (select C 1) 1)) (not (< i N))) (or (< (+ i 1) N) (= l 0) (not (< i N))) (or (<= (+ (select C l) (select A k) (select C 1) 1) (+ (select A i) N asum)) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (= csum 0)) (or (< (+ i 1) N) (= 2 k) (not (< i N)))), 193729#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select C l) (select A k) (select C 1) 1) (+ (select A i) N asum (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) (select A k) (select C 1) 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= csum 0)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= l 0)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= 2 k))), 193683#(and (or (< k N) (<= (+ N asum) csum)) (or (< k N) (< csum (+ N asum 1)))), 193679#(and (or (<= (+ N asum) (+ (select C l) csum (select C (+ l 1)))) (< i N)) (or (<= (+ (select C l) csum (select C (+ l 1))) (+ N asum)) (< i N))), 193690#(and (or (<= (+ N asum) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1)))) (< (+ 3 l) N) (<= N (+ 2 l))) (or (< (+ 3 l) N) (not (< (+ 2 l) N)) (< (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1))) (+ N asum 1)))), 193721#(and (or (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) csum) (< (+ 3 i) N) (< k N)) (or (not (< (+ 2 i) N)) (< csum (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)) 1)) (< (+ 3 i) N) (< k N))), 193675#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< csum (+ (select A i) N asum (select A (+ i 1)) 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) csum))), 193735#(and (or (< (+ i 1) N) (not (< i N)) (not (= l (+ k 1))) (<= N (+ 2 k)) (< (+ 3 k) N) (<= (+ (select A i) N asum) (+ (select A (+ k 1)) 2 (select A (+ 2 k)) csum (select C (+ 2 l))))) (or (not (< (+ 2 k) N)) (< (+ i 1) N) (= l 0) (not (< i N)) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (< (+ i 1) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) 3 (select A k)) (+ (select A i) N asum)) (not (< i N)) (< (+ 3 k) N) (not (= k 0))) (or (not (< (+ 2 k) N)) (< (+ i 1) N) (not (< i N)) (= csum 0) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (< (+ i 1) N) (not (< i N)) (not (= (+ 2 k) l)) (< (+ 3 k) N) (<= (+ (select A i) N asum) (+ (select A (+ 2 k)) csum (select C (+ 2 l)) (select C (+ l 1)) 1))) (or (not (< (+ 2 k) N)) (< (+ i 1) N) (not (< i N)) (<= (+ (select A (+ 2 k)) (select C 1) (select C 2) 1) (+ (select A i) N asum)) (not (= (+ 2 k) l)) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (= l k) (< (+ i 1) N) (not (< i N)) (and (= (+ 2 l) k) (<= (+ (select A i) N asum) (+ (select C l) csum (select A k) (select C (+ l 1)) 1))) (= (+ 2 k) l) (and (<= (+ (select A i) N asum) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1)))) (not (= (+ 2 l) k))) (= l (+ k 1)) (< (+ 3 k) N) (= (+ l 1) k)) (or (not (< (+ 2 k) N)) (= (+ k 1) 0) (< (+ i 1) N) (not (< i N)) (= k 0) (= (+ 2 k) l) (and (<= (+ (select C l) (select C 1) (select C 2)) (+ (select A i) N asum)) (not (= 2 k))) (and (<= (+ (select C l) (select A k) (select C 1) 1) (+ (select A i) N asum)) (= 2 k)) (< (+ 3 k) N) (= k 1)) (or (<= N i) (< (+ i 1) N) (not (= (+ l 1) k)) (<= N (+ 2 k)) (< (+ 3 k) N) (<= (+ (select A i) N asum) (+ (select A (+ k 1)) (select C l) 2 csum (select A k)))) (or (<= (+ (select A i) N asum) (+ (select A (+ k 1)) (select A (+ 2 k)) 3 csum (select A k))) (< (+ i 1) N) (not (< i N)) (<= N (+ 2 k)) (< (+ 3 k) N) (not (= l k))) (or (<= N i) (< (+ i 1) N) (<= N (+ 2 k)) (not (= k 1)) (< (+ 3 k) N) (<= (+ (select A (+ k 1)) (select C l) 2 (select A k)) (+ (select A i) N asum))) (or (<= (+ (select A (+ k 1)) 2 (select A (+ 2 k)) (select C 2)) (+ (select A i) N asum)) (< (+ i 1) N) (not (< i N)) (<= N (+ 2 k)) (not (= (+ k 1) 0)) (< (+ 3 k) N))), 193715#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) csum)) (< k N)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (<= (+ (select C l) csum) (+ (select A i) N asum (select A (+ i 1)))))), 193741#(and (or (not (< (+ 2 i) N)) (<= (+ (select C l) (select A k) (select C 1) 1) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)))) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select C l) (select A k) (select C 1) 1)) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (= csum 0)) (or (not (< (+ 2 i) N)) (= l 0) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (= 2 k) (< (+ 3 i) N))), 193691#(and (or (< (+ 2 l) N) (< (+ (select C l) csum (select C (+ l 1))) (+ N asum 1)) (not (< (+ l 1) N)) (< k N)) (or (< (+ 2 l) N) (<= N (+ l 1)) (<= (+ N asum) (+ (select C l) csum (select C (+ l 1)))) (< k N))), 193717#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1))) (+ (select A i) N asum (select A (+ i 1)))) (< k N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (<= (+ (select A i) N asum (select A (+ i 1))) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (= csum 0)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= l 0) (< k N))), 193688#(and (or (< (+ l 1) N) (< k N) (<= (+ N asum) (+ (select C l) csum)) (<= N l)) (or (< (+ l 1) N) (not (< l N)) (< (+ (select C l) csum) (+ N asum 1)) (< k N))), 193710#(and (or (< (+ i 1) N) (= l 0) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (< k N) (<= (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1))) (+ (select A i) N asum))) (or (<= (+ (select A i) N asum) (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1)))) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (< k N) (= csum 0))), 193743#(and (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (= csum 0)) (or (not (< (+ 2 i) N)) (= l 0) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (= k 1)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1))) (+ (select A (+ k 1)) (select C l) 2 (select A k)))) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A (+ k 1)) (select C l) 2 (select A k)) (+ (select A i) (select A (+ 2 i)) N asum (select A (+ i 1)))))), 193674#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select C l) csum) (+ (select A i) N asum))) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) N asum) (+ (select C l) csum)))), 193673#(and (or (<= (+ (select C l) csum) (+ N asum)) (< i N)) (or (<= (+ N asum) (+ (select C l) csum)) (< i N))), 193703#(and (or (< k N) (= csum 0) (< i N)) (or (< k N) (<= (+ (select C l) csum (select C (+ 2 l)) (select C (+ l 1))) (+ N asum)) (< i N)) (or (< k N) (< i N) (<= (+ N asum) (+ (select C l) (select C 1) (select C 2)))) (or (= l 0) (< k N) (< i N))), 193730#(and (or (<= (+ (select A (+ k 1)) (select C l) 2 (select A k)) (+ N asum)) (< i N)) (or (= csum 0) (< i N)) (or (= k 1) (< i N)) (or (= l 0) (< i N)) (or (<= (+ N asum) (+ (select A (+ k 1)) (select C l) 2 (select A k))) (< i N))), 193732#(and (or (not (< (+ 2 k) N)) (< (+ 3 l) N) (<= (+ N asum) (+ (select A (+ k 1)) (select A (+ 2 k)) 3 csum (select A k))) (<= N (+ 2 l)) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (< (+ 3 l) N) (not (< (+ 2 l) N)) (< (+ (select A (+ k 1)) 2 (select A (+ 2 k)) csum (select A k)) (+ N asum)) (< (+ 3 k) N)))] [2022-03-15 21:42:57,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-03-15 21:42:57,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:57,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-03-15 21:42:57,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=10810, Unknown=0, NotChecked=0, Total=11342 [2022-03-15 21:42:57,094 INFO L87 Difference]: Start difference. First operand 7299 states and 29353 transitions. Second operand has 89 states, 88 states have (on average 2.977272727272727) internal successors, (262), 88 states have internal predecessors, (262), 0 states have call successors, (0), 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:43:11,443 WARN L228 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 355 DAG size of output: 327 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:43:24,968 WARN L228 SmtUtils]: Spent 6.65s on a formula simplification. DAG size of input: 347 DAG size of output: 321 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:43:32,158 WARN L228 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 342 DAG size of output: 314 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:44:46,609 WARN L228 SmtUtils]: Spent 6.67s on a formula simplification. DAG size of input: 356 DAG size of output: 314 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:44:58,430 WARN L228 SmtUtils]: Spent 6.63s on a formula simplification. DAG size of input: 345 DAG size of output: 307 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:45:22,589 WARN L228 SmtUtils]: Spent 6.83s on a formula simplification. DAG size of input: 347 DAG size of output: 321 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:45:46,970 WARN L228 SmtUtils]: Spent 5.52s on a formula simplification. DAG size of input: 359 DAG size of output: 297 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:45:56,983 WARN L228 SmtUtils]: Spent 6.98s on a formula simplification. DAG size of input: 340 DAG size of output: 311 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:46:13,711 WARN L228 SmtUtils]: Spent 5.13s on a formula simplification. DAG size of input: 370 DAG size of output: 318 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:46:46,511 WARN L228 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 359 DAG size of output: 304 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:47:19,010 WARN L228 SmtUtils]: Spent 6.78s on a formula simplification. DAG size of input: 351 DAG size of output: 313 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:47:41,354 WARN L228 SmtUtils]: Spent 5.26s on a formula simplification. DAG size of input: 374 DAG size of output: 320 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:48:08,926 WARN L228 SmtUtils]: Spent 6.42s on a formula simplification. DAG size of input: 349 DAG size of output: 307 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:48:47,470 WARN L228 SmtUtils]: Spent 5.10s on a formula simplification. DAG size of input: 346 DAG size of output: 326 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:49:07,459 WARN L228 SmtUtils]: Spent 7.12s on a formula simplification. DAG size of input: 346 DAG size of output: 317 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:49:34,428 WARN L228 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 365 DAG size of output: 315 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:49:45,550 WARN L228 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 275 DAG size of output: 263 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:49:51,396 WARN L228 SmtUtils]: Spent 5.36s on a formula simplification. DAG size of input: 377 DAG size of output: 326 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:50:02,938 WARN L228 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 267 DAG size of output: 255 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:50:08,549 WARN L228 SmtUtils]: Spent 5.15s on a formula simplification. DAG size of input: 370 DAG size of output: 320 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:50:18,916 WARN L228 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 341 DAG size of output: 323 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:50:44,671 WARN L228 SmtUtils]: Spent 5.41s on a formula simplification. DAG size of input: 352 DAG size of output: 332 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:50:56,441 WARN L228 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 338 DAG size of output: 318 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 21:51:04,541 WARN L228 SmtUtils]: Spent 5.23s on a formula simplification. DAG size of input: 271 DAG size of output: 259 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-03-15 21:51:10,070 WARN L244 SmtUtils]: Removed 13 from assertion stack [2022-03-15 21:51:10,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 299 states. [2022-03-15 21:51:10,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 59 SyntacticMatches, 23 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50024 ImplicationChecksByTransitivity, 489.3s TimeCoverageRelationStatistics Valid=12799, Invalid=142043, Unknown=0, NotChecked=0, Total=154842 [2022-03-15 21:51:10,079 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3076 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 10052 mSolverCounterSat, 1577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3076 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 11629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1577 IncrementalHoareTripleChecker+Valid, 10052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:10,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3076 Valid, 0 Invalid, 11629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1577 Valid, 10052 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2022-03-15 21:51:10,081 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 21:51:10,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 21:51:10,110 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 21:51:10,110 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 21:51:10,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:10,289 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (7299states) and FLOYD_HOARE automaton (currently 299 states, 89 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 348 for 5024ms.. [2022-03-15 21:51:10,291 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 21:51:10,291 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 21:51:10,291 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 21:51:10,292 INFO L732 BasicCegarLoop]: Path program histogram: [17, 2, 1, 1] [2022-03-15 21:51:10,294 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 21:51:10,294 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 21:51:10,295 INFO L202 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 09:51:10 BasicIcfg [2022-03-15 21:51:10,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 21:51:10,296 INFO L158 Benchmark]: Toolchain (without parser) took 743247.13ms. Allocated memory was 170.9MB in the beginning and 874.5MB in the end (delta: 703.6MB). Free memory was 130.7MB in the beginning and 316.9MB in the end (delta: -186.3MB). Peak memory consumption was 740.7MB. Max. memory is 8.0GB. [2022-03-15 21:51:10,296 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 170.9MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 21:51:10,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.44ms. Allocated memory is still 170.9MB. Free memory was 130.7MB in the beginning and 129.1MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 21:51:10,296 INFO L158 Benchmark]: Boogie Preprocessor took 14.38ms. Allocated memory is still 170.9MB. Free memory was 129.1MB in the beginning and 128.2MB in the end (delta: 893.0kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:51:10,296 INFO L158 Benchmark]: RCFGBuilder took 254.05ms. Allocated memory is still 170.9MB. Free memory was 128.1MB in the beginning and 118.7MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 21:51:10,296 INFO L158 Benchmark]: TraceAbstraction took 742954.27ms. Allocated memory was 170.9MB in the beginning and 874.5MB in the end (delta: 703.6MB). Free memory was 118.2MB in the beginning and 316.9MB in the end (delta: -198.7MB). Peak memory consumption was 727.1MB. Max. memory is 8.0GB. [2022-03-15 21:51:10,297 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.11ms. Allocated memory is still 170.9MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.44ms. Allocated memory is still 170.9MB. Free memory was 130.7MB in the beginning and 129.1MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.38ms. Allocated memory is still 170.9MB. Free memory was 129.1MB in the beginning and 128.2MB in the end (delta: 893.0kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 254.05ms. Allocated memory is still 170.9MB. Free memory was 128.1MB in the beginning and 118.7MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 742954.27ms. Allocated memory was 170.9MB in the beginning and 874.5MB in the end (delta: 703.6MB). Free memory was 118.2MB in the beginning and 316.9MB in the end (delta: -198.7MB). Peak memory consumption was 727.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 35 PlacesBefore, 26 PlacesAfterwards, 29 TransitionsBefore, 20 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 4 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 178 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 166, positive: 160, positive conditional: 0, positive unconditional: 160, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 92, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 166, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 92, unknown conditional: 0, unknown unconditional: 92] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 25, Positive conditional cache size: 0, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - 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: 68]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (7299states) and FLOYD_HOARE automaton (currently 299 states, 89 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 348 for 5024ms.. - TimeoutResultAtElement [Line: 61]: 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 (7299states) and FLOYD_HOARE automaton (currently 299 states, 89 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 348 for 5024ms.. - TimeoutResultAtElement [Line: 62]: 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 (7299states) and FLOYD_HOARE automaton (currently 299 states, 89 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 348 for 5024ms.. - TimeoutResultAtElement [Line: 61]: 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 (7299states) and FLOYD_HOARE automaton (currently 299 states, 89 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 348 for 5024ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 42 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 742.8s, OverallIterations: 21, TraceHistogramMax: 4, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.1s, AutomataDifference: 674.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13298 SdHoareTripleChecker+Valid, 23.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13298 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 19.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6130 mSDsCounter, 5644 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33174 IncrementalHoareTripleChecker+Invalid, 38818 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5644 mSolverCounterUnsat, 0 mSDtfsCounter, 33174 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3825 GetRequests, 1362 SyntacticMatches, 124 SemanticMatches, 2338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229907 ImplicationChecksByTransitivity, 664.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9562occurred in iteration=19, InterpolantAutomatonStates: 1622, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 66064 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 710 NumberOfCodeBlocks, 710 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 980 ConstructedInterpolants, 5 QuantifiedInterpolants, 8968 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1476 ConjunctsInSsa, 227 ConjunctsInUnsatCore, 58 InterpolantComputations, 3 PerfectInterpolantSequences, 296/561 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