/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-bad/buffer-mult-alt.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:45:49,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:45:49,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:45:49,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:45:49,555 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:45:49,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:45:49,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:45:49,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:45:49,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:45:49,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:45:49,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:45:49,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:45:49,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:45:49,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:45:49,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:45:49,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:45:49,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:45:49,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:45:49,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:45:49,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:45:49,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:45:49,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:45:49,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:45:49,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:45:49,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:45:49,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:45:49,592 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:45:49,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:45:49,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:45:49,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:45:49,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:45:49,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:45:49,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:45:49,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:45:49,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:45:49,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:45:49,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:45:49,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:45:49,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:45:49,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:45:49,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:45:49,601 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:45:49,621 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:45:49,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:45:49,622 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:45:49,622 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:45:49,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:45:49,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:45:49,623 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:45:49,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:45:49,623 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:45:49,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:45:49,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:45:49,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:45:49,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:45:49,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:45:49,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:45:49,629 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:45:49,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:45:49,629 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:45:49,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:45:49,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:45:49,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:45:49,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:45:49,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:45:49,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:45:49,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:45:49,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:45:49,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:45:49,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:45:49,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:45:49,631 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:45:49,631 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:45:49,632 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:45:49,632 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:45:49,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:45:49,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:45:49,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:45:49,833 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:45:49,834 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:45:49,834 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/buffer-mult-alt.wvr.bpl [2022-03-15 21:45:49,835 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/buffer-mult-alt.wvr.bpl' [2022-03-15 21:45:49,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:45:49,864 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:45:49,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:45:49,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:45:49,865 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:45:49,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:45:49" (1/1) ... [2022-03-15 21:45:49,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:45:49" (1/1) ... [2022-03-15 21:45:49,881 INFO L137 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:45:49,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:45:49,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:45:49,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:45:49,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:45:49,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:45:49" (1/1) ... [2022-03-15 21:45:49,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:45:49" (1/1) ... [2022-03-15 21:45:49,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:45:49" (1/1) ... [2022-03-15 21:45:49,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:45:49" (1/1) ... [2022-03-15 21:45:49,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:45:49" (1/1) ... [2022-03-15 21:45:49,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:45:49" (1/1) ... [2022-03-15 21:45:49,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:45:49" (1/1) ... [2022-03-15 21:45:49,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:45:49,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:45:49,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:45:49,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:45:49,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:45:49" (1/1) ... [2022-03-15 21:45:49,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:45:49,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:49,925 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:45:49,938 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:45:49,949 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:45:49,949 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:45:49,950 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:45:49,950 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:45:49,950 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:45:49,950 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:45:49,950 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:45:49,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:45:49,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:45:49,950 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 21:45:49,950 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 21:45:49,950 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 21:45:49,950 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2022-03-15 21:45:49,951 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 21:45:49,951 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 21:45:49,951 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:45:49,984 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:45:49,985 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:45:50,122 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:45:50,147 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:45:50,147 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 21:45:50,148 INFO L202 PluginConnector]: Adding new model buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:45:50 BoogieIcfgContainer [2022-03-15 21:45:50,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:45:50,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:45:50,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:45:50,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:45:50,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:45:49" (1/2) ... [2022-03-15 21:45:50,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39efa79b and model type buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:45:50, skipping insertion in model container [2022-03-15 21:45:50,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:45:50" (2/2) ... [2022-03-15 21:45:50,174 INFO L111 eAbstractionObserver]: Analyzing ICFG buffer-mult-alt.wvr.bpl [2022-03-15 21:45:50,177 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:45:50,177 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:45:50,177 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:45:50,177 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:45:50,221 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-15 21:45:50,247 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:45:50,252 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:45:50,252 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 21:45:50,258 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:45:50,264 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 102 flow [2022-03-15 21:45:50,266 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 102 flow [2022-03-15 21:45:50,267 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 102 flow [2022-03-15 21:45:50,293 INFO L129 PetriNetUnfolder]: 4/31 cut-off events. [2022-03-15 21:45:50,293 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-03-15 21:45:50,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2022-03-15 21:45:50,299 INFO L116 LiptonReduction]: Number of co-enabled transitions 350 [2022-03-15 21:45:50,456 INFO L131 LiptonReduction]: Checked pairs total: 574 [2022-03-15 21:45:50,456 INFO L133 LiptonReduction]: Total number of compositions: 9 [2022-03-15 21:45:50,468 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 86 flow [2022-03-15 21:45:50,515 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 163 states, 162 states have (on average 3.765432098765432) internal successors, (610), 162 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:50,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 162 states have (on average 3.765432098765432) internal successors, (610), 162 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:50,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:45:50,530 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:50,531 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:50,531 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:45:50,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:50,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1969046511, now seen corresponding path program 1 times [2022-03-15 21:45:50,547 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:50,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533772468] [2022-03-15 21:45:50,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:50,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:50,652 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:45:50,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:50,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533772468] [2022-03-15 21:45:50,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533772468] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:45:50,654 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:45:50,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 21:45:50,655 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1037261238] [2022-03-15 21:45:50,655 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:50,660 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:50,675 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 98 transitions. [2022-03-15 21:45:50,675 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:51,170 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:45:51,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:45:51,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:51,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:45:51,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:45:51,186 INFO L87 Difference]: Start difference. First operand has 163 states, 162 states have (on average 3.765432098765432) internal successors, (610), 162 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:51,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:51,219 INFO L93 Difference]: Finished difference Result 191 states and 705 transitions. [2022-03-15 21:45:51,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:45:51,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 21:45:51,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:51,228 INFO L225 Difference]: With dead ends: 191 [2022-03-15 21:45:51,229 INFO L226 Difference]: Without dead ends: 191 [2022-03-15 21:45:51,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 9 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:45:51,231 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:51,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 5 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:45:51,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-03-15 21:45:51,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-03-15 21:45:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 3.710526315789474) internal successors, (705), 190 states have internal predecessors, (705), 0 states have call successors, (0), 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:45:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 705 transitions. [2022-03-15 21:45:51,268 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 705 transitions. Word has length 14 [2022-03-15 21:45:51,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:51,268 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 705 transitions. [2022-03-15 21:45:51,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:51,269 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 705 transitions. [2022-03-15 21:45:51,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:45:51,270 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:51,270 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:51,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:45:51,271 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:45:51,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:51,271 INFO L85 PathProgramCache]: Analyzing trace with hash -66430160, now seen corresponding path program 1 times [2022-03-15 21:45:51,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:51,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839719252] [2022-03-15 21:45:51,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:51,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:51,299 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:45:51,300 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:51,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839719252] [2022-03-15 21:45:51,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839719252] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:51,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619924040] [2022-03-15 21:45:51,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:51,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:51,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:51,302 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:45:51,345 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:45:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:51,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 21:45:51,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:51,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 21:45:51,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619924040] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:45:51,397 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 21:45:51,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-03-15 21:45:51,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [455272409] [2022-03-15 21:45:51,398 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:51,399 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:51,405 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 138 transitions. [2022-03-15 21:45:51,405 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:51,848 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:45:51,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:45:51,849 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:51,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:45:51,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:45:51,850 INFO L87 Difference]: Start difference. First operand 191 states and 705 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:51,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:51,899 INFO L93 Difference]: Finished difference Result 328 states and 1196 transitions. [2022-03-15 21:45:51,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 21:45:51,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:45:51,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:51,905 INFO L225 Difference]: With dead ends: 328 [2022-03-15 21:45:51,906 INFO L226 Difference]: Without dead ends: 328 [2022-03-15 21:45:51,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:45:51,907 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:51,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 9 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:45:51,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-03-15 21:45:51,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 239. [2022-03-15 21:45:51,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 3.7563025210084033) internal successors, (894), 238 states have internal predecessors, (894), 0 states have call successors, (0), 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:45:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 894 transitions. [2022-03-15 21:45:51,919 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 894 transitions. Word has length 16 [2022-03-15 21:45:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:51,919 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 894 transitions. [2022-03-15 21:45:51,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 894 transitions. [2022-03-15 21:45:51,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:45:51,920 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:51,920 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:51,939 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:45:52,137 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:45:52,137 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:45:52,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:52,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1630343822, now seen corresponding path program 1 times [2022-03-15 21:45:52,143 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:52,143 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831279746] [2022-03-15 21:45:52,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:52,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:52,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:52,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831279746] [2022-03-15 21:45:52,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831279746] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:52,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137812805] [2022-03-15 21:45:52,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:52,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:52,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:52,233 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:45:52,261 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:45:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:52,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:45:52,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:52,334 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 21:45:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:52,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:45:52,384 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:45:52,385 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 13 treesize of output 17 [2022-03-15 21:45:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:52,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137812805] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:45:52,410 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:45:52,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-03-15 21:45:52,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1458186898] [2022-03-15 21:45:52,410 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:52,412 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:52,422 INFO L252 McrAutomatonBuilder]: Finished intersection with 102 states and 236 transitions. [2022-03-15 21:45:52,422 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:53,923 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [1917#(or (not (= (select q1 q1_back) C)) (<= 1 (+ total (select q1 q1_front)))), 1915#(or (< (+ q1_front 1) q1_back) (<= 1 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 1916#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= 1 (+ total (select q1 q1_front)))), 1914#(or (<= 1 total) (< q1_front q1_back))] [2022-03-15 21:45:53,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 21:45:53,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:53,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 21:45:53,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-03-15 21:45:53,925 INFO L87 Difference]: Start difference. First operand 239 states and 894 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:54,064 INFO L93 Difference]: Finished difference Result 744 states and 2758 transitions. [2022-03-15 21:45:54,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 21:45:54,064 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:45:54,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:54,079 INFO L225 Difference]: With dead ends: 744 [2022-03-15 21:45:54,079 INFO L226 Difference]: Without dead ends: 717 [2022-03-15 21:45:54,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 91 SyntacticMatches, 20 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-03-15 21:45:54,080 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 65 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:54,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 47 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:45:54,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-03-15 21:45:54,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 372. [2022-03-15 21:45:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 3.8086253369272236) internal successors, (1413), 371 states have internal predecessors, (1413), 0 states have call successors, (0), 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:45:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1413 transitions. [2022-03-15 21:45:54,094 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1413 transitions. Word has length 18 [2022-03-15 21:45:54,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:54,094 INFO L470 AbstractCegarLoop]: Abstraction has 372 states and 1413 transitions. [2022-03-15 21:45:54,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:54,094 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1413 transitions. [2022-03-15 21:45:54,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:45:54,096 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:54,096 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:54,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-15 21:45:54,311 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:45:54,312 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:45:54,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:54,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1312819404, now seen corresponding path program 2 times [2022-03-15 21:45:54,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:54,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856237259] [2022-03-15 21:45:54,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:54,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:54,374 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:54,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856237259] [2022-03-15 21:45:54,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856237259] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:54,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341783504] [2022-03-15 21:45:54,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:45:54,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:54,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:54,376 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:45:54,437 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:45:54,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:45:54,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:45:54,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 21:45:54,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:54,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:45:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:54,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341783504] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:45:54,506 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:45:54,507 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 6 [2022-03-15 21:45:54,507 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2136329996] [2022-03-15 21:45:54,507 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:54,509 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:54,527 INFO L252 McrAutomatonBuilder]: Finished intersection with 138 states and 334 transitions. [2022-03-15 21:45:54,527 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:56,206 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [3538#(or (< i N) (<= q1_back (+ q1_front 1))), 3531#(or (< q1_front q1_back) (< i N)), 3537#(or (<= q1_back q1_front) (< i N)), 3540#(or (< (+ i 1) N) (not (< i N)) (<= q1_back q1_front)), 3539#(or (< (+ i 1) N) (<= q1_back (+ q1_front 1))), 3534#(< i N), 3535#(or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= q1_back (+ q1_front 1))), 3532#(or (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (< i N)), 3536#(or (<= N i) (< (+ i 1) N) (< (+ q1_front 1) q1_back) (<= q1_back q1_front)), 3533#(or (< (+ q1_front 2) q1_back) (< i N) (<= q1_back (+ q1_front 1)))] [2022-03-15 21:45:56,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:45:56,207 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:56,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:45:56,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-03-15 21:45:56,208 INFO L87 Difference]: Start difference. First operand 372 states and 1413 transitions. Second operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 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:45:56,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:56,458 INFO L93 Difference]: Finished difference Result 857 states and 3164 transitions. [2022-03-15 21:45:56,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 21:45:56,459 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have 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:45:56,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:56,463 INFO L225 Difference]: With dead ends: 857 [2022-03-15 21:45:56,463 INFO L226 Difference]: Without dead ends: 805 [2022-03-15 21:45:56,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:45:56,464 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 282 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:56,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 69 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:45:56,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2022-03-15 21:45:56,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 600. [2022-03-15 21:45:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 3.8363939899833057) internal successors, (2298), 599 states have internal predecessors, (2298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:56,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 2298 transitions. [2022-03-15 21:45:56,479 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 2298 transitions. Word has length 20 [2022-03-15 21:45:56,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:56,480 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 2298 transitions. [2022-03-15 21:45:56,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 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:45:56,480 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 2298 transitions. [2022-03-15 21:45:56,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:45:56,481 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:56,481 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:56,500 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:45:56,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:56,695 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:45:56,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:56,696 INFO L85 PathProgramCache]: Analyzing trace with hash 884721520, now seen corresponding path program 1 times [2022-03-15 21:45:56,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:56,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076691819] [2022-03-15 21:45:56,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:56,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:56,724 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:45:56,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:56,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076691819] [2022-03-15 21:45:56,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076691819] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:45:56,724 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:45:56,724 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:45:56,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2109130125] [2022-03-15 21:45:56,725 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:56,726 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:56,765 INFO L252 McrAutomatonBuilder]: Finished intersection with 132 states and 314 transitions. [2022-03-15 21:45:56,765 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:57,654 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [5615#(or (< j M) (= q2_back q2_front)), 5614#(< j M)] [2022-03-15 21:45:57,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:45:57,655 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:57,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:45:57,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 21:45:57,656 INFO L87 Difference]: Start difference. First operand 600 states and 2298 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:57,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:57,725 INFO L93 Difference]: Finished difference Result 966 states and 3503 transitions. [2022-03-15 21:45:57,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:45:57,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:45:57,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:57,730 INFO L225 Difference]: With dead ends: 966 [2022-03-15 21:45:57,730 INFO L226 Difference]: Without dead ends: 946 [2022-03-15 21:45:57,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 86 SyntacticMatches, 25 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-15 21:45:57,732 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:57,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 23 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:45:57,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2022-03-15 21:45:57,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 881. [2022-03-15 21:45:57,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 3.7636363636363637) internal successors, (3312), 880 states have internal predecessors, (3312), 0 states have call successors, (0), 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:45:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 3312 transitions. [2022-03-15 21:45:57,751 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 3312 transitions. Word has length 20 [2022-03-15 21:45:57,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:57,752 INFO L470 AbstractCegarLoop]: Abstraction has 881 states and 3312 transitions. [2022-03-15 21:45:57,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:57,752 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 3312 transitions. [2022-03-15 21:45:57,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:45:57,754 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:57,754 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:57,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 21:45:57,754 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:45:57,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:57,754 INFO L85 PathProgramCache]: Analyzing trace with hash 251715157, now seen corresponding path program 1 times [2022-03-15 21:45:57,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:57,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745613636] [2022-03-15 21:45:57,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:57,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:45:57,788 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:57,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745613636] [2022-03-15 21:45:57,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745613636] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:57,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864140942] [2022-03-15 21:45:57,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:57,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:57,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:57,816 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:45:57,817 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:45:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:57,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:45:57,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:45:57,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:45:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:45:57,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864140942] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:45:57,966 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:45:57,966 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-03-15 21:45:57,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [688517728] [2022-03-15 21:45:57,966 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:57,968 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:57,992 INFO L252 McrAutomatonBuilder]: Finished intersection with 188 states and 466 transitions. [2022-03-15 21:45:57,992 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:59,809 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [8486#(or (< (+ j 1) M) (< i N)), 8485#(or (< j M) (< i N)), 8482#(< j M), 8487#(or (< (+ j 1) M) (<= M j)), 8492#(or (<= N i) (< (+ i 1) N)), 8490#(or (< (+ i 1) N) (< j M)), 8496#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 8488#(or (< (+ j 1) M) (< i N) (<= M j)), 8471#(or (< i N) (<= M j)), 8475#(or (< (+ i 1) N) (<= M j)), 8497#(or (<= N i) (< (+ i 1) N) (<= M j)), 8489#(< (+ i 1) N), 8483#(< (+ j 1) M), 8491#(or (< (+ j 1) M) (< (+ i 1) N)), 8484#(< i N), 8494#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N)), 8493#(or (<= N i) (< (+ i 1) N) (< j M)), 8495#(or (< (+ j 1) M) (< (+ i 1) N) (<= M j))] [2022-03-15 21:45:59,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:45:59,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:59,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:45:59,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2022-03-15 21:45:59,810 INFO L87 Difference]: Start difference. First operand 881 states and 3312 transitions. Second operand has 23 states, 23 states have (on average 5.782608695652174) internal successors, (133), 22 states have internal predecessors, (133), 0 states have call successors, (0), 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:46:00,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:00,174 INFO L93 Difference]: Finished difference Result 1655 states and 6170 transitions. [2022-03-15 21:46:00,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 21:46:00,174 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.782608695652174) internal successors, (133), 22 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 21:46:00,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:00,182 INFO L225 Difference]: With dead ends: 1655 [2022-03-15 21:46:00,182 INFO L226 Difference]: Without dead ends: 1630 [2022-03-15 21:46:00,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=335, Invalid=1071, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 21:46:00,183 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 260 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:00,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 1 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:46:00,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2022-03-15 21:46:00,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1216. [2022-03-15 21:46:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1215 states have (on average 3.954732510288066) internal successors, (4805), 1215 states have internal predecessors, (4805), 0 states have call successors, (0), 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:46:00,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 4805 transitions. [2022-03-15 21:46:00,211 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 4805 transitions. Word has length 22 [2022-03-15 21:46:00,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:00,211 INFO L470 AbstractCegarLoop]: Abstraction has 1216 states and 4805 transitions. [2022-03-15 21:46:00,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.782608695652174) internal successors, (133), 22 states have internal predecessors, (133), 0 states have call successors, (0), 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:46:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 4805 transitions. [2022-03-15 21:46:00,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:46:00,214 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:00,214 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:00,241 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:46:00,430 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:46:00,430 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:46:00,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:00,430 INFO L85 PathProgramCache]: Analyzing trace with hash -529213003, now seen corresponding path program 3 times [2022-03-15 21:46:00,434 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:00,434 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052672567] [2022-03-15 21:46:00,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:00,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:00,522 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:00,522 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052672567] [2022-03-15 21:46:00,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052672567] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:00,522 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821046891] [2022-03-15 21:46:00,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:46:00,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:00,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:00,534 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:46:00,562 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:46:00,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:46:00,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:00,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 21:46:00,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:00,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:46:00,724 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:46:00,724 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-03-15 21:46:00,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:00,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:01,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:46:01,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:46:01,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:46:01,009 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:46:01,009 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 33 [2022-03-15 21:46:01,096 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:01,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821046891] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:01,096 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:01,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2022-03-15 21:46:01,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1828670560] [2022-03-15 21:46:01,096 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:01,099 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:01,117 INFO L252 McrAutomatonBuilder]: Finished intersection with 156 states and 374 transitions. [2022-03-15 21:46:01,117 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:03,625 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [12756#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 12753#(or (< (+ q1_front 1) q1_back) (<= 1 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 12754#(or (< (+ q1_front 2) q1_back) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back (+ q1_front 1))), 12709#(or (<= 1 total) (< q1_front q1_back)), 12757#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))), 12755#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (<= q1_back q1_front)), 12758#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))))] [2022-03-15 21:46:03,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 21:46:03,625 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:03,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 21:46:03,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-03-15 21:46:03,626 INFO L87 Difference]: Start difference. First operand 1216 states and 4805 transitions. Second operand has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 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:46:04,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:04,085 INFO L93 Difference]: Finished difference Result 3701 states and 14688 transitions. [2022-03-15 21:46:04,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 21:46:04,085 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 21:46:04,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:04,106 INFO L225 Difference]: With dead ends: 3701 [2022-03-15 21:46:04,106 INFO L226 Difference]: Without dead ends: 3685 [2022-03-15 21:46:04,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 143 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 21:46:04,108 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 280 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:04,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 108 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:46:04,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3685 states. [2022-03-15 21:46:04,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3685 to 1628. [2022-03-15 21:46:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1627 states have (on average 4.044253226797787) internal successors, (6580), 1627 states have internal predecessors, (6580), 0 states have call successors, (0), 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:46:04,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 6580 transitions. [2022-03-15 21:46:04,176 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 6580 transitions. Word has length 22 [2022-03-15 21:46:04,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:04,176 INFO L470 AbstractCegarLoop]: Abstraction has 1628 states and 6580 transitions. [2022-03-15 21:46:04,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 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:46:04,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 6580 transitions. [2022-03-15 21:46:04,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:46:04,181 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:04,181 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:04,198 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:46:04,398 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:46:04,398 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:46:04,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:04,399 INFO L85 PathProgramCache]: Analyzing trace with hash 957972751, now seen corresponding path program 4 times [2022-03-15 21:46:04,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:04,400 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238176593] [2022-03-15 21:46:04,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:04,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:04,486 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:04,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238176593] [2022-03-15 21:46:04,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238176593] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:04,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478884810] [2022-03-15 21:46:04,486 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:46:04,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:04,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:04,488 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:46:04,488 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:46:04,551 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:46:04,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:04,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 21:46:04,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:04,698 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:46:04,699 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 24 treesize of output 12 [2022-03-15 21:46:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:04,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:04,813 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:46:04,814 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 50 [2022-03-15 21:46:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:04,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478884810] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:04,915 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:04,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-03-15 21:46:04,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [673652900] [2022-03-15 21:46:04,915 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:04,917 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:04,935 INFO L252 McrAutomatonBuilder]: Finished intersection with 117 states and 264 transitions. [2022-03-15 21:46:04,935 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:07,197 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [19882#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))), 19879#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= 1 (+ total (select q1 q1_front)))), 19883#(and (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 19877#(or (<= 1 total) (< q1_front q1_back)), 19881#(or (<= q1_back q1_front) (<= 1 (+ total (select q1 q1_front)))), 19880#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 19878#(or (< (+ q1_front 1) q1_back) (<= 1 (+ total (select q1 q1_front))) (not (< q1_front q1_back)))] [2022-03-15 21:46:07,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 21:46:07,197 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:07,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 21:46:07,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-03-15 21:46:07,198 INFO L87 Difference]: Start difference. First operand 1628 states and 6580 transitions. Second operand has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 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:46:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:07,783 INFO L93 Difference]: Finished difference Result 5487 states and 21970 transitions. [2022-03-15 21:46:07,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 21:46:07,784 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 21:46:07,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:07,811 INFO L225 Difference]: With dead ends: 5487 [2022-03-15 21:46:07,811 INFO L226 Difference]: Without dead ends: 5428 [2022-03-15 21:46:07,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 98 SyntacticMatches, 23 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 21:46:07,812 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 315 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:07,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 100 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:46:07,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5428 states. [2022-03-15 21:46:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5428 to 2096. [2022-03-15 21:46:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2096 states, 2095 states have (on average 4.105966587112172) internal successors, (8602), 2095 states have internal predecessors, (8602), 0 states have call successors, (0), 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:46:07,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 8602 transitions. [2022-03-15 21:46:07,886 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 8602 transitions. Word has length 22 [2022-03-15 21:46:07,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:07,889 INFO L470 AbstractCegarLoop]: Abstraction has 2096 states and 8602 transitions. [2022-03-15 21:46:07,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 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:46:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 8602 transitions. [2022-03-15 21:46:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 21:46:07,894 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:07,894 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:07,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-15 21:46:08,111 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:46:08,111 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:46:08,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:08,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1678189718, now seen corresponding path program 2 times [2022-03-15 21:46:08,112 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:08,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948138628] [2022-03-15 21:46:08,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:08,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:08,155 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:46:08,155 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:08,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948138628] [2022-03-15 21:46:08,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948138628] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:08,156 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166229819] [2022-03-15 21:46:08,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:46:08,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:08,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:08,157 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:46:08,158 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:46:08,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:46:08,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:08,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:46:08,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:08,220 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:46:08,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:46:08,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166229819] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:08,261 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:08,261 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-03-15 21:46:08,261 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [136220843] [2022-03-15 21:46:08,261 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:08,263 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:08,293 INFO L252 McrAutomatonBuilder]: Finished intersection with 218 states and 538 transitions. [2022-03-15 21:46:08,293 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:10,446 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [29744#(or (<= (+ q1_back 1) q1_front) (<= (+ q1_front 1) q1_back)), 29745#(or (<= q1_front q1_back) (<= (+ q1_back 2) q1_front)), 29607#(<= q1_front q1_back), 29743#(or (<= q1_back q1_front) (<= (+ q1_front 2) q1_back))] [2022-03-15 21:46:10,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 21:46:10,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:10,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 21:46:10,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:46:10,447 INFO L87 Difference]: Start difference. First operand 2096 states and 8602 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 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:46:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:10,536 INFO L93 Difference]: Finished difference Result 2776 states and 11285 transitions. [2022-03-15 21:46:10,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:46:10,537 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 21:46:10,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:10,546 INFO L225 Difference]: With dead ends: 2776 [2022-03-15 21:46:10,547 INFO L226 Difference]: Without dead ends: 2776 [2022-03-15 21:46:10,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 234 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:46:10,547 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 85 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:10,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 26 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:46:10,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2022-03-15 21:46:10,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 1957. [2022-03-15 21:46:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1957 states, 1956 states have (on average 4.043967280163599) internal successors, (7910), 1956 states have internal predecessors, (7910), 0 states have call successors, (0), 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:46:10,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 7910 transitions. [2022-03-15 21:46:10,592 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 7910 transitions. Word has length 24 [2022-03-15 21:46:10,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:10,592 INFO L470 AbstractCegarLoop]: Abstraction has 1957 states and 7910 transitions. [2022-03-15 21:46:10,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 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:46:10,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 7910 transitions. [2022-03-15 21:46:10,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 21:46:10,597 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:10,597 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:10,627 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:46:10,830 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:46:10,830 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:46:10,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:10,830 INFO L85 PathProgramCache]: Analyzing trace with hash 311942839, now seen corresponding path program 5 times [2022-03-15 21:46:10,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:10,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879923739] [2022-03-15 21:46:10,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:10,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:10,873 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:10,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879923739] [2022-03-15 21:46:10,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879923739] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:10,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979683750] [2022-03-15 21:46:10,873 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:46:10,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:10,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:10,875 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:46:10,875 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:46:10,910 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:46:10,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:10,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:46:10,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:10,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:10,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979683750] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:10,994 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:10,994 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 8 [2022-03-15 21:46:10,995 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [964015007] [2022-03-15 21:46:10,995 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:10,996 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:11,019 INFO L252 McrAutomatonBuilder]: Finished intersection with 192 states and 472 transitions. [2022-03-15 21:46:11,020 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:13,516 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [36598#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= q1_back q1_front)), 36594#(or (< (+ i 1) N) (not (< i N)) (<= q1_back (+ q1_front 1))), 36590#(or (< i N) (<= q1_back (+ q1_front 1))), 36589#(or (<= q1_back q1_front) (< i N)), 36592#(or (< (+ q1_front 2) q1_back) (<= N i) (< (+ i 1) N) (<= q1_back (+ q1_front 1))), 36596#(or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= q1_back (+ q1_front 1))), 36585#(or (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (< i N)), 36584#(< i N), 36583#(or (< q1_front q1_back) (< i N)), 36587#(or (< (+ q1_front 3) q1_back) (<= q1_back (+ q1_front 2)) (< i N)), 36588#(or (< (+ q1_front 3) q1_back) (< (+ i 1) N) (<= q1_back (+ q1_front 2))), 36597#(or (<= N (+ i 1)) (< (+ 2 i) N) (< (+ q1_front 1) q1_back) (<= q1_back q1_front)), 36586#(or (< (+ q1_front 2) q1_back) (< i N) (<= q1_back (+ q1_front 1))), 36593#(or (< (+ i 1) N) (<= q1_back (+ q1_front 2))), 36591#(or (<= q1_back (+ q1_front 2)) (< i N)), 36595#(or (<= N (+ i 1)) (< (+ q1_front 2) q1_back) (< (+ 2 i) N) (<= q1_back (+ q1_front 1)))] [2022-03-15 21:46:13,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:46:13,517 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:13,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:46:13,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2022-03-15 21:46:13,517 INFO L87 Difference]: Start difference. First operand 1957 states and 7910 transitions. Second operand has 24 states, 24 states have (on average 4.833333333333333) internal successors, (116), 23 states have internal predecessors, (116), 0 states have call successors, (0), 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:46:13,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:13,807 INFO L93 Difference]: Finished difference Result 3890 states and 15431 transitions. [2022-03-15 21:46:13,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 21:46:13,808 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.833333333333333) internal successors, (116), 23 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 21:46:13,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:13,819 INFO L225 Difference]: With dead ends: 3890 [2022-03-15 21:46:13,819 INFO L226 Difference]: Without dead ends: 3790 [2022-03-15 21:46:13,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 192 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=341, Invalid=849, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 21:46:13,820 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 488 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:13,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [488 Valid, 95 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:46:13,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3790 states. [2022-03-15 21:46:13,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3790 to 2327. [2022-03-15 21:46:13,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2327 states, 2326 states have (on average 4.035683576956148) internal successors, (9387), 2326 states have internal predecessors, (9387), 0 states have call successors, (0), 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:46:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 9387 transitions. [2022-03-15 21:46:13,875 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 9387 transitions. Word has length 24 [2022-03-15 21:46:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:13,875 INFO L470 AbstractCegarLoop]: Abstraction has 2327 states and 9387 transitions. [2022-03-15 21:46:13,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.833333333333333) internal successors, (116), 23 states have internal predecessors, (116), 0 states have call successors, (0), 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:46:13,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 9387 transitions. [2022-03-15 21:46:13,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:46:13,882 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:13,882 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:13,912 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:46:14,098 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:46:14,098 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:46:14,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:14,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1233326888, now seen corresponding path program 3 times [2022-03-15 21:46:14,099 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:14,099 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108291026] [2022-03-15 21:46:14,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:14,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:14,181 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:46:14,181 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:14,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108291026] [2022-03-15 21:46:14,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108291026] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:14,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576400405] [2022-03-15 21:46:14,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:46:14,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:14,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:14,183 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:46:14,183 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:46:14,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:46:14,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:14,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 21:46:14,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:14,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:46:14,468 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:46:14,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 46 [2022-03-15 21:46:14,649 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 15 treesize of output 11 [2022-03-15 21:46:14,663 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:46:14,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:14,800 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:46:14,800 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 22 treesize of output 26 [2022-03-15 21:46:14,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:46:14,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:46:14,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:46:14,991 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:46:14,992 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2022-03-15 21:46:15,131 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:46:15,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576400405] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:15,131 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:15,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2022-03-15 21:46:15,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2072146753] [2022-03-15 21:46:15,131 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:15,133 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:15,197 INFO L252 McrAutomatonBuilder]: Finished intersection with 274 states and 696 transitions. [2022-03-15 21:46:15,198 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:20,990 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [45342#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front)))), 45352#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1))))), 45348#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= 1 (+ C total))) (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)))), 45346#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (<= q1_back q1_front)), 45290#(or (< q1_front q1_back) (<= 1 (+ (select q2 q2_front) total))), 45344#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (<= q1_back q1_front)), 45350#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1))))), 45338#(or (not (= (+ C (select q2 q2_back)) 0)) (< q1_front q1_back) (<= 1 (+ (select q2 q2_front) total))), 45349#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))), 45351#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))), 45353#(and (or (not (= (select q1 q1_back) C)) (<= 1 (+ C total)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= (select q1 (+ q1_front 1)) C)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 45337#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ (select q2 q2_front) total))), 45340#(or (< (+ q1_front 2) q1_back) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back (+ q1_front 1))), 45336#(or (< (+ q1_front 1) q1_back) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front q1_back))), 45339#(or (not (= (+ C (select q2 q2_back)) 0)) (< (+ q1_front 1) q1_back) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front q1_back))), 45335#(or (<= 1 total) (< q1_front q1_back)), 45343#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 45341#(or (not (= (+ C (select q2 q2_back)) 0)) (< (+ q1_front 2) q1_back) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back (+ q1_front 1))), 45345#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 45347#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))))] [2022-03-15 21:46:20,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 21:46:20,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:20,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 21:46:20,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1387, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 21:46:20,991 INFO L87 Difference]: Start difference. First operand 2327 states and 9387 transitions. Second operand has 29 states, 28 states have (on average 5.428571428571429) internal successors, (152), 28 states have internal predecessors, (152), 0 states have call successors, (0), 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:46:22,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:22,685 INFO L93 Difference]: Finished difference Result 9329 states and 36934 transitions. [2022-03-15 21:46:22,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 21:46:22,685 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 5.428571428571429) internal successors, (152), 28 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 21:46:22,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:22,715 INFO L225 Difference]: With dead ends: 9329 [2022-03-15 21:46:22,715 INFO L226 Difference]: Without dead ends: 9306 [2022-03-15 21:46:22,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 230 SyntacticMatches, 35 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=543, Invalid=3239, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 21:46:22,717 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 751 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:22,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [751 Valid, 222 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:46:22,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9306 states. [2022-03-15 21:46:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9306 to 2812. [2022-03-15 21:46:22,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2812 states, 2811 states have (on average 4.049448594806119) internal successors, (11383), 2811 states have internal predecessors, (11383), 0 states have call successors, (0), 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:46:22,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 11383 transitions. [2022-03-15 21:46:22,842 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 11383 transitions. Word has length 26 [2022-03-15 21:46:22,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:22,842 INFO L470 AbstractCegarLoop]: Abstraction has 2812 states and 11383 transitions. [2022-03-15 21:46:22,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 5.428571428571429) internal successors, (152), 28 states have internal predecessors, (152), 0 states have call successors, (0), 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:46:22,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 11383 transitions. [2022-03-15 21:46:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:46:22,849 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:22,849 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:22,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 21:46:23,060 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:46:23,060 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:46:23,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:23,060 INFO L85 PathProgramCache]: Analyzing trace with hash -899994300, now seen corresponding path program 4 times [2022-03-15 21:46:23,061 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:23,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825413269] [2022-03-15 21:46:23,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:23,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:23,144 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:46:23,144 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:23,144 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825413269] [2022-03-15 21:46:23,144 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825413269] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:23,144 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680479656] [2022-03-15 21:46:23,144 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:46:23,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:23,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:23,146 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:46:23,147 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:46:23,173 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:46:23,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:23,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 21:46:23,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:23,362 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 32 treesize of output 26 [2022-03-15 21:46:23,399 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:46:23,399 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 25 treesize of output 13 [2022-03-15 21:46:23,410 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:46:23,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:23,447 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:46:23,448 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 23 treesize of output 27 [2022-03-15 21:46:23,535 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:46:23,535 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 56 [2022-03-15 21:46:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:23,670 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680479656] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:23,670 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:23,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-03-15 21:46:23,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1488771174] [2022-03-15 21:46:23,671 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:23,673 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:23,709 INFO L252 McrAutomatonBuilder]: Finished intersection with 244 states and 608 transitions. [2022-03-15 21:46:23,709 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:28,004 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [60521#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))), 60519#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= (+ q1_back 1) q1_front)), 60527#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (<= (+ q1_back 2) q1_front)), 60526#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 60523#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (<= (+ q1_back 2) q1_front)), 60529#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= 1 (+ C total))) (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)))), 60525#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 60516#(or (<= 1 total) (< q1_front q1_back)), 60528#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1))))), 60517#(or (< (+ q1_front 1) q1_back) (<= 1 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 60531#(and (or (not (= (select q1 q1_back) C)) (<= 1 (+ C total)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= (select q1 (+ q1_front 1)) C)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 60522#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 60530#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1))))), 60518#(or (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))), 60524#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= (+ q1_back 1) q1_front)), 60520#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front))))] [2022-03-15 21:46:28,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 21:46:28,005 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:28,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 21:46:28,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 21:46:28,006 INFO L87 Difference]: Start difference. First operand 2812 states and 11383 transitions. Second operand has 25 states, 24 states have (on average 5.208333333333333) internal successors, (125), 24 states have internal predecessors, (125), 0 states have call successors, (0), 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:46:28,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:28,706 INFO L93 Difference]: Finished difference Result 6591 states and 26398 transitions. [2022-03-15 21:46:28,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 21:46:28,707 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.208333333333333) internal successors, (125), 24 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 21:46:28,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:28,724 INFO L225 Difference]: With dead ends: 6591 [2022-03-15 21:46:28,724 INFO L226 Difference]: Without dead ends: 6567 [2022-03-15 21:46:28,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 192 SyntacticMatches, 51 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=283, Invalid=1357, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 21:46:28,725 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 271 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:28,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 155 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1273 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:46:28,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6567 states. [2022-03-15 21:46:28,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6567 to 2812. [2022-03-15 21:46:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2812 states, 2811 states have (on average 4.049448594806119) internal successors, (11383), 2811 states have internal predecessors, (11383), 0 states have call successors, (0), 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:46:28,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 11383 transitions. [2022-03-15 21:46:28,819 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 11383 transitions. Word has length 26 [2022-03-15 21:46:28,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:28,819 INFO L470 AbstractCegarLoop]: Abstraction has 2812 states and 11383 transitions. [2022-03-15 21:46:28,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.208333333333333) internal successors, (125), 24 states have internal predecessors, (125), 0 states have call successors, (0), 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:46:28,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 11383 transitions. [2022-03-15 21:46:28,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:46:28,825 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:28,825 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:28,857 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:46:29,041 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:46:29,041 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:46:29,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:29,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1828394240, now seen corresponding path program 5 times [2022-03-15 21:46:29,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:29,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478827983] [2022-03-15 21:46:29,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:29,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:29,149 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:46:29,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:29,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478827983] [2022-03-15 21:46:29,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478827983] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:29,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146564238] [2022-03-15 21:46:29,150 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:46:29,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:29,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:29,151 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:46:29,152 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:46:29,179 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:46:29,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:29,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 21:46:29,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:29,406 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 26 treesize of output 20 [2022-03-15 21:46:29,470 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:46:29,471 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 13 treesize of output 17 [2022-03-15 21:46:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:29,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:29,710 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:46:29,711 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 22 treesize of output 26 [2022-03-15 21:46:29,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:46:29,973 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:46:29,974 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 45 [2022-03-15 21:46:30,067 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:46:30,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146564238] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:30,067 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:30,067 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2022-03-15 21:46:30,067 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1475894465] [2022-03-15 21:46:30,067 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:30,069 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:30,106 INFO L252 McrAutomatonBuilder]: Finished intersection with 232 states and 564 transitions. [2022-03-15 21:46:30,106 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:32,535 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [72942#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))), 72946#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= 1 (+ C total))) (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)))), 72947#(and (or (not (= (select q1 q1_back) C)) (<= 1 (+ C total)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= (select q1 (+ q1_front 1)) C)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 72940#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 72939#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 72869#(or (<= 1 total) (< q1_front q1_back)), 72943#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1))))), 72936#(or (< (+ q1_front 2) q1_back) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back (+ q1_front 1))), 72938#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (<= q1_back q1_front)), 72935#(or (< (+ q1_front 1) q1_back) (<= 1 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 72944#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1))))), 72941#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 72937#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 72945#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))))] [2022-03-15 21:46:32,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:46:32,536 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:32,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:46:32,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1028, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 21:46:32,536 INFO L87 Difference]: Start difference. First operand 2812 states and 11383 transitions. Second operand has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 22 states have internal predecessors, (113), 0 states have call successors, (0), 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:46:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:33,523 INFO L93 Difference]: Finished difference Result 7972 states and 31915 transitions. [2022-03-15 21:46:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 21:46:33,524 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 22 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 21:46:33,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:33,543 INFO L225 Difference]: With dead ends: 7972 [2022-03-15 21:46:33,544 INFO L226 Difference]: Without dead ends: 7938 [2022-03-15 21:46:33,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 218 SyntacticMatches, 11 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=399, Invalid=2463, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 21:46:33,545 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 503 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:33,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [503 Valid, 212 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:46:33,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7938 states. [2022-03-15 21:46:33,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7938 to 3436. [2022-03-15 21:46:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3436 states, 3435 states have (on average 4.116739446870452) internal successors, (14141), 3435 states have internal predecessors, (14141), 0 states have call successors, (0), 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:46:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 14141 transitions. [2022-03-15 21:46:33,645 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 14141 transitions. Word has length 26 [2022-03-15 21:46:33,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:33,645 INFO L470 AbstractCegarLoop]: Abstraction has 3436 states and 14141 transitions. [2022-03-15 21:46:33,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 22 states have internal predecessors, (113), 0 states have call successors, (0), 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:46:33,645 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 14141 transitions. [2022-03-15 21:46:33,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:46:33,653 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:33,653 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:33,686 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:46:33,868 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:46:33,868 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:46:33,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:33,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1059428536, now seen corresponding path program 6 times [2022-03-15 21:46:33,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:33,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4497508] [2022-03-15 21:46:33,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:33,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:33,953 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:33,953 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:33,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4497508] [2022-03-15 21:46:33,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4497508] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:33,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727308460] [2022-03-15 21:46:33,954 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:46:33,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:33,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:33,955 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:46:33,955 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:46:33,993 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:46:33,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:33,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 21:46:34,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:34,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:46:34,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:46:34,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:46:34,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:46:34,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:46:34,246 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:46:34,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 70 [2022-03-15 21:46:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:34,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:34,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:46:34,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:46:34,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:46:34,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:46:34,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:46:34,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:46:34,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:46:34,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:46:34,913 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:46:34,914 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 48 [2022-03-15 21:46:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:35,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727308460] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:35,111 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:35,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2022-03-15 21:46:35,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1200135660] [2022-03-15 21:46:35,111 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:35,113 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:35,143 INFO L252 McrAutomatonBuilder]: Finished intersection with 210 states and 512 transitions. [2022-03-15 21:46:35,143 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:39,191 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [88009#(or (not (= (select q1 q1_back) C)) (<= 3 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 1))))), 88011#(or (not (= (select q1 q1_back) C)) (<= 3 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))), 87946#(or (<= 1 total) (< q1_front q1_back)), 88010#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 88008#(or (not (= (select q1 q1_back) C)) (<= 3 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 88005#(or (< (+ q1_front 3) q1_back) (<= q1_back (+ q1_front 2)) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 88006#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= q1_back (+ q1_front 1))), 87950#(or (< (+ q1_front 1) q1_back) (<= 1 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 88007#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 88004#(or (< (+ q1_front 2) q1_back) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back (+ q1_front 1)))] [2022-03-15 21:46:39,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 21:46:39,191 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:39,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 21:46:39,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=805, Unknown=0, NotChecked=0, Total=992 [2022-03-15 21:46:39,192 INFO L87 Difference]: Start difference. First operand 3436 states and 14141 transitions. Second operand has 19 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 0 states have call successors, (0), 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:46:40,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:40,190 INFO L93 Difference]: Finished difference Result 10829 states and 43916 transitions. [2022-03-15 21:46:40,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 21:46:40,190 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 21:46:40,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:40,219 INFO L225 Difference]: With dead ends: 10829 [2022-03-15 21:46:40,219 INFO L226 Difference]: Without dead ends: 10813 [2022-03-15 21:46:40,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 195 SyntacticMatches, 15 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=440, Invalid=2110, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 21:46:40,220 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 486 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:40,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [486 Valid, 244 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:46:40,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10813 states. [2022-03-15 21:46:40,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10813 to 4741. [2022-03-15 21:46:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4741 states, 4740 states have (on average 4.162025316455696) internal successors, (19728), 4740 states have internal predecessors, (19728), 0 states have call successors, (0), 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:46:40,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4741 states to 4741 states and 19728 transitions. [2022-03-15 21:46:40,368 INFO L78 Accepts]: Start accepts. Automaton has 4741 states and 19728 transitions. Word has length 26 [2022-03-15 21:46:40,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:40,368 INFO L470 AbstractCegarLoop]: Abstraction has 4741 states and 19728 transitions. [2022-03-15 21:46:40,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 0 states have call successors, (0), 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:46:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 4741 states and 19728 transitions. [2022-03-15 21:46:40,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:46:40,378 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:40,378 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:40,399 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:46:40,591 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:46:40,591 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:46:40,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:40,592 INFO L85 PathProgramCache]: Analyzing trace with hash -390122610, now seen corresponding path program 7 times [2022-03-15 21:46:40,592 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:40,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132579311] [2022-03-15 21:46:40,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:40,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:40,709 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:40,709 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132579311] [2022-03-15 21:46:40,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132579311] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:40,709 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719010939] [2022-03-15 21:46:40,710 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:46:40,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:40,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:40,711 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:46:40,712 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:46:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:40,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 21:46:40,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:40,963 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:46:40,964 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 16 [2022-03-15 21:46:40,987 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:40,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:41,179 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:46:41,180 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 39 treesize of output 103 [2022-03-15 21:46:41,418 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:41,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719010939] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:41,418 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:41,418 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-03-15 21:46:41,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1234119363] [2022-03-15 21:46:41,419 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:41,421 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:41,442 INFO L252 McrAutomatonBuilder]: Finished intersection with 147 states and 330 transitions. [2022-03-15 21:46:41,442 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:43,620 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [108533#(or (< (+ q1_front 1) q1_back) (<= 1 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 108536#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= q1_back (+ q1_front 1))), 108532#(or (<= 1 total) (< q1_front q1_back)), 108541#(or (<= q1_back q1_front) (<= 1 (+ total (select q1 q1_front)))), 108539#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 108534#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= 1 (+ total (select q1 q1_front)))), 108540#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= 3 (+ (* 3 C) total)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))))), 108537#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 108538#(and (or (not (= (select q1 q1_back) C)) (<= 3 (+ (* 3 C) total))) (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 108535#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))] [2022-03-15 21:46:43,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 21:46:43,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:43,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 21:46:43,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=734, Unknown=0, NotChecked=0, Total=930 [2022-03-15 21:46:43,621 INFO L87 Difference]: Start difference. First operand 4741 states and 19728 transitions. Second operand has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 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:46:44,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:44,780 INFO L93 Difference]: Finished difference Result 13847 states and 56160 transitions. [2022-03-15 21:46:44,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 21:46:44,780 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 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 26 [2022-03-15 21:46:44,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:44,820 INFO L225 Difference]: With dead ends: 13847 [2022-03-15 21:46:44,820 INFO L226 Difference]: Without dead ends: 13804 [2022-03-15 21:46:44,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 128 SyntacticMatches, 20 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1445 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=3252, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 21:46:44,822 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 785 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:44,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [785 Valid, 205 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:46:44,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13804 states. [2022-03-15 21:46:44,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13804 to 5399. [2022-03-15 21:46:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5399 states, 5398 states have (on average 4.195072248981104) internal successors, (22645), 5398 states have internal predecessors, (22645), 0 states have call successors, (0), 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:46:45,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5399 states to 5399 states and 22645 transitions. [2022-03-15 21:46:45,014 INFO L78 Accepts]: Start accepts. Automaton has 5399 states and 22645 transitions. Word has length 26 [2022-03-15 21:46:45,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:45,014 INFO L470 AbstractCegarLoop]: Abstraction has 5399 states and 22645 transitions. [2022-03-15 21:46:45,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 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:46:45,014 INFO L276 IsEmpty]: Start isEmpty. Operand 5399 states and 22645 transitions. [2022-03-15 21:46:45,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:46:45,027 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:45,027 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:45,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-03-15 21:46:45,240 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:46:45,240 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:46:45,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:45,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1348024210, now seen corresponding path program 8 times [2022-03-15 21:46:45,241 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:45,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598654126] [2022-03-15 21:46:45,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:45,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:45,361 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:45,361 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:45,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598654126] [2022-03-15 21:46:45,361 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598654126] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:45,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613238801] [2022-03-15 21:46:45,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:46:45,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:45,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:45,362 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:46:45,363 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:46:45,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:46:45,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:45,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 21:46:45,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:45,572 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:46:45,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 16 [2022-03-15 21:46:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:45,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:45,770 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:46:45,770 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 39 treesize of output 103 [2022-03-15 21:46:46,154 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:46,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613238801] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:46,154 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:46,154 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-03-15 21:46:46,154 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [985495093] [2022-03-15 21:46:46,154 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:46,156 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:46,179 INFO L252 McrAutomatonBuilder]: Finished intersection with 147 states and 330 transitions. [2022-03-15 21:46:46,179 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:48,859 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [133431#(or (not (= (select q1 q1_back) C)) (<= 3 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))), 133427#(or (<= 3 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 2) q1_back) (<= q1_back (+ q1_front 1))), 133428#(or (<= 3 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q1_back q1_front)), 133433#(and (or (not (= (select q1 q1_back) C)) (<= 3 (+ (* 3 C) total))) (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 133432#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= 3 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))), 133434#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= 3 (+ (* 3 C) total)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))))), 133429#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= 3 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= q1_back (+ q1_front 1))), 133430#(or (<= 3 (+ total (select q1 q1_front))) (<= q1_back q1_front)), 133425#(or (< q1_front q1_back) (<= 3 total)), 133426#(or (< (+ q1_front 1) q1_back) (<= 3 (+ total (select q1 q1_front))) (not (< q1_front q1_back)))] [2022-03-15 21:46:48,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 21:46:48,860 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:48,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 21:46:48,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2022-03-15 21:46:48,860 INFO L87 Difference]: Start difference. First operand 5399 states and 22645 transitions. Second operand has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 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:46:50,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:50,102 INFO L93 Difference]: Finished difference Result 15018 states and 61498 transitions. [2022-03-15 21:46:50,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 21:46:50,102 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 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 26 [2022-03-15 21:46:50,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:50,151 INFO L225 Difference]: With dead ends: 15018 [2022-03-15 21:46:50,151 INFO L226 Difference]: Without dead ends: 14957 [2022-03-15 21:46:50,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 135 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=397, Invalid=2255, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 21:46:50,152 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 454 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:50,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [454 Valid, 399 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1660 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:46:50,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14957 states. [2022-03-15 21:46:50,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14957 to 5653. [2022-03-15 21:46:50,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5653 states, 5652 states have (on average 4.222929936305732) internal successors, (23868), 5652 states have internal predecessors, (23868), 0 states have call successors, (0), 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:46:50,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5653 states to 5653 states and 23868 transitions. [2022-03-15 21:46:50,357 INFO L78 Accepts]: Start accepts. Automaton has 5653 states and 23868 transitions. Word has length 26 [2022-03-15 21:46:50,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:50,357 INFO L470 AbstractCegarLoop]: Abstraction has 5653 states and 23868 transitions. [2022-03-15 21:46:50,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 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:46:50,357 INFO L276 IsEmpty]: Start isEmpty. Operand 5653 states and 23868 transitions. [2022-03-15 21:46:50,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:46:50,369 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:50,369 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:50,401 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:46:50,585 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:46:50,585 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:46:50,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:50,586 INFO L85 PathProgramCache]: Analyzing trace with hash 191054800, now seen corresponding path program 6 times [2022-03-15 21:46:50,586 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:50,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446014289] [2022-03-15 21:46:50,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:50,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:50,685 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:46:50,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:50,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446014289] [2022-03-15 21:46:50,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446014289] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:50,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382796680] [2022-03-15 21:46:50,685 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:46:50,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:50,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:50,686 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:46:50,687 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:46:50,714 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:46:50,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:50,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 21:46:50,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:50,838 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:46:50,838 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 44 treesize of output 26 [2022-03-15 21:46:50,890 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 15 treesize of output 11 [2022-03-15 21:46:50,898 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:46:50,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:50,962 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:46:50,962 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 24 treesize of output 28 [2022-03-15 21:46:51,014 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:46:51,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 57 [2022-03-15 21:46:51,119 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:46:51,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382796680] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:51,120 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:51,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-03-15 21:46:51,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [611273204] [2022-03-15 21:46:51,120 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:51,122 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:51,163 INFO L252 McrAutomatonBuilder]: Finished intersection with 219 states and 532 transitions. [2022-03-15 21:46:51,163 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:56,277 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [159974#(or (not (= (+ C (select q2 q2_back)) 0)) (< (+ q1_front 1) q1_back) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front q1_back))), 159967#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ (select q2 q2_front) total))), 159978#(or (<= 1 (+ (select q2 q2_front) total (select q1 q1_front))) (<= q1_back q1_front)), 159980#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front)))), 159968#(or (<= 1 total) (< q1_front q1_back)), 159969#(or (< q1_front q1_back) (<= 1 (+ (select q2 q2_front) total))), 159972#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front)))), 159986#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= 1 (+ C total))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 159971#(or (< (+ q1_front 1) q1_back) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front q1_back))), 159977#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))), 159982#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 1) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ C total))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 1)))), 159973#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 159984#(and (or (not (= (select q1 q1_back) C)) (<= 1 (+ C total))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 159979#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front))) (<= q1_back q1_front)), 159981#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back q1_front)) (or (not (= (+ C (select q2 q2_back)) 0)) (< q1_front (+ q1_back 1))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= C (select q1 q1_front)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front))))), 159970#(or (not (= (+ C (select q2 q2_back)) 0)) (< q1_front q1_back) (<= 1 (+ (select q2 q2_front) total))), 159975#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))), 159976#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 159983#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))), 159985#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ C total))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back q1_front)))] [2022-03-15 21:46:56,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 21:46:56,279 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:56,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 21:46:56,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 21:46:56,280 INFO L87 Difference]: Start difference. First operand 5653 states and 23868 transitions. Second operand has 29 states, 28 states have (on average 5.357142857142857) internal successors, (150), 28 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:46:58,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:58,116 INFO L93 Difference]: Finished difference Result 12439 states and 50579 transitions. [2022-03-15 21:46:58,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 21:46:58,116 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 5.357142857142857) internal successors, (150), 28 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 26 [2022-03-15 21:46:58,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:58,154 INFO L225 Difference]: With dead ends: 12439 [2022-03-15 21:46:58,155 INFO L226 Difference]: Without dead ends: 12416 [2022-03-15 21:46:58,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 171 SyntacticMatches, 42 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=522, Invalid=3138, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 21:46:58,156 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 497 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 2873 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:58,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [497 Valid, 350 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2873 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 21:46:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12416 states. [2022-03-15 21:46:58,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12416 to 5786. [2022-03-15 21:46:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5786 states, 5785 states have (on average 4.224546240276577) internal successors, (24439), 5785 states have internal predecessors, (24439), 0 states have call successors, (0), 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:46:58,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5786 states to 5786 states and 24439 transitions. [2022-03-15 21:46:58,363 INFO L78 Accepts]: Start accepts. Automaton has 5786 states and 24439 transitions. Word has length 26 [2022-03-15 21:46:58,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:58,364 INFO L470 AbstractCegarLoop]: Abstraction has 5786 states and 24439 transitions. [2022-03-15 21:46:58,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 5.357142857142857) internal successors, (150), 28 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:46:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 5786 states and 24439 transitions. [2022-03-15 21:46:58,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:46:58,375 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:58,375 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:58,392 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:46:58,579 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:46:58,579 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:46:58,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:58,580 INFO L85 PathProgramCache]: Analyzing trace with hash 381945348, now seen corresponding path program 7 times [2022-03-15 21:46:58,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:58,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249162618] [2022-03-15 21:46:58,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:58,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:58,694 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:46:58,695 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:58,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249162618] [2022-03-15 21:46:58,695 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249162618] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:58,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604182401] [2022-03-15 21:46:58,695 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:46:58,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:58,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:58,710 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:46:58,711 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:46:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:58,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 21:46:58,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:58,995 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 32 treesize of output 26 [2022-03-15 21:46:59,018 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:46:59,019 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 25 treesize of output 13 [2022-03-15 21:46:59,031 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:46:59,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:59,115 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:46:59,115 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 23 treesize of output 27 [2022-03-15 21:46:59,177 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:46:59,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 56 [2022-03-15 21:46:59,290 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:46:59,290 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604182401] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:59,290 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:59,290 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-03-15 21:46:59,290 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1250646238] [2022-03-15 21:46:59,290 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:59,292 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:59,322 INFO L252 McrAutomatonBuilder]: Finished intersection with 177 states and 399 transitions. [2022-03-15 21:46:59,322 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:02,776 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [184213#(or (< (+ q1_front 1) q1_back) (<= 1 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 184225#(and (or (not (= (select q1 q1_back) C)) (<= 1 (+ C total))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 184227#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= 1 (+ C total))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 184218#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))), 184219#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front)))), 184226#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ C total))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 184214#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= 1 (+ total (select q1 q1_front)))), 184215#(or (not (= (select q1 q1_back) C)) (<= 1 (+ total (select q1 q1_front)))), 184222#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))), 184220#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front)))), 184224#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))), 184217#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))), 184221#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back q1_front)) (or (not (= (+ C (select q2 q2_back)) 0)) (< q1_front (+ q1_back 1))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= C (select q1 q1_front)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front))))), 184216#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front)))), 184212#(or (<= 1 total) (< q1_front q1_back)), 184223#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 1) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ C total))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 1))))] [2022-03-15 21:47:02,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 21:47:02,778 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:02,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 21:47:02,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 21:47:02,779 INFO L87 Difference]: Start difference. First operand 5786 states and 24439 transitions. Second operand has 25 states, 24 states have (on average 4.916666666666667) internal successors, (118), 24 states have internal predecessors, (118), 0 states have call successors, (0), 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:47:03,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:03,565 INFO L93 Difference]: Finished difference Result 10433 states and 42706 transitions. [2022-03-15 21:47:03,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 21:47:03,565 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.916666666666667) internal successors, (118), 24 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 21:47:03,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:03,593 INFO L225 Difference]: With dead ends: 10433 [2022-03-15 21:47:03,593 INFO L226 Difference]: Without dead ends: 10409 [2022-03-15 21:47:03,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 144 SyntacticMatches, 31 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=444, Invalid=2312, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 21:47:03,594 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 385 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:03,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 132 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:47:03,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10409 states. [2022-03-15 21:47:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10409 to 5734. [2022-03-15 21:47:03,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5734 states, 5733 states have (on average 4.236874236874237) internal successors, (24290), 5733 states have internal predecessors, (24290), 0 states have call successors, (0), 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:47:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5734 states to 5734 states and 24290 transitions. [2022-03-15 21:47:03,781 INFO L78 Accepts]: Start accepts. Automaton has 5734 states and 24290 transitions. Word has length 26 [2022-03-15 21:47:03,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:03,781 INFO L470 AbstractCegarLoop]: Abstraction has 5734 states and 24290 transitions. [2022-03-15 21:47:03,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.916666666666667) internal successors, (118), 24 states have internal predecessors, (118), 0 states have call successors, (0), 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:47:03,782 INFO L276 IsEmpty]: Start isEmpty. Operand 5734 states and 24290 transitions. [2022-03-15 21:47:03,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:47:03,793 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:03,793 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:03,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 21:47:03,995 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:47:03,995 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:03,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:03,996 INFO L85 PathProgramCache]: Analyzing trace with hash 177358544, now seen corresponding path program 8 times [2022-03-15 21:47:03,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:03,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149686806] [2022-03-15 21:47:03,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:03,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:04,112 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:47:04,112 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:04,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149686806] [2022-03-15 21:47:04,112 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149686806] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:04,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190052043] [2022-03-15 21:47:04,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:47:04,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:04,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:04,113 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:47:04,114 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:47:04,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:47:04,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:04,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 21:47:04,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:04,299 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:47:04,375 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:47:04,375 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 25 treesize of output 13 [2022-03-15 21:47:04,391 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:47:04,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:04,493 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:04,493 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 23 treesize of output 27 [2022-03-15 21:47:04,566 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:47:04,566 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 56 [2022-03-15 21:47:04,682 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:47:04,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190052043] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:04,682 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:04,683 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 21:47:04,683 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1768183141] [2022-03-15 21:47:04,683 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:04,685 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:04,704 INFO L252 McrAutomatonBuilder]: Finished intersection with 135 states and 296 transitions. [2022-03-15 21:47:04,704 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:07,960 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [206341#(and (or (not (= (select q1 q1_back) C)) (<= 1 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 206348#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 1) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ C total))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 1)))), 206344#(or (<= 1 total) (< q1_front q1_back) (< q2_front q2_back)), 206337#(or (< (+ q1_front 1) q1_back) (<= 1 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 206350#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= 1 (+ C total))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 206349#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ C total))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 206345#(or (< (+ q1_front 1) q1_back) (< q2_front q2_back) (<= 1 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 206346#(or (< q2_front q2_back) (<= q1_back q1_front) (<= 1 (+ total (select q1 q1_front)))), 206340#(and (or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (<= 1 (+ C total (select q1 q1_front))) (not (= (select q1 (+ q1_front 1)) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 206343#(or (<= 1 total) (< q2_front q2_back)), 206338#(or (<= q1_back q1_front) (<= 1 (+ total (select q1 q1_front)))), 206339#(and (or (<= 1 (+ C total (select q1 q1_front))) (not (< q1_front q1_back)) (not (= (select q1 (+ q1_front 1)) C))) (<= q1_back (+ q1_front 1))), 206347#(or (< q2_front q2_back) (<= 1 (+ total (select q1 q1_front)))), 206336#(or (<= 1 total) (< q1_front q1_back)), 206342#(and (or (not (= (select q1 q1_back) C)) (<= 1 (+ C total))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front)))] [2022-03-15 21:47:07,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:47:07,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:07,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:47:07,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 21:47:07,961 INFO L87 Difference]: Start difference. First operand 5734 states and 24290 transitions. Second operand has 24 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 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:47:09,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:09,166 INFO L93 Difference]: Finished difference Result 10305 states and 42172 transitions. [2022-03-15 21:47:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 21:47:09,166 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 21:47:09,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:09,193 INFO L225 Difference]: With dead ends: 10305 [2022-03-15 21:47:09,194 INFO L226 Difference]: Without dead ends: 10271 [2022-03-15 21:47:09,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 110 SyntacticMatches, 23 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=588, Invalid=2492, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 21:47:09,195 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 486 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:09,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [486 Valid, 174 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:47:09,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10271 states. [2022-03-15 21:47:09,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10271 to 5864. [2022-03-15 21:47:09,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5864 states, 5863 states have (on average 4.240661777247143) internal successors, (24863), 5863 states have internal predecessors, (24863), 0 states have call successors, (0), 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:47:09,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5864 states to 5864 states and 24863 transitions. [2022-03-15 21:47:09,347 INFO L78 Accepts]: Start accepts. Automaton has 5864 states and 24863 transitions. Word has length 26 [2022-03-15 21:47:09,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:09,347 INFO L470 AbstractCegarLoop]: Abstraction has 5864 states and 24863 transitions. [2022-03-15 21:47:09,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 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:47:09,347 INFO L276 IsEmpty]: Start isEmpty. Operand 5864 states and 24863 transitions. [2022-03-15 21:47:09,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:47:09,359 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:09,359 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:09,375 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:47:09,571 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:47:09,571 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:09,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:09,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1982944210, now seen corresponding path program 9 times [2022-03-15 21:47:09,572 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:09,572 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84151724] [2022-03-15 21:47:09,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:09,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:09,722 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:09,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84151724] [2022-03-15 21:47:09,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84151724] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:09,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437458964] [2022-03-15 21:47:09,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:47:09,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:09,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:09,723 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:47:09,725 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:47:09,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 21:47:09,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:09,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 21:47:09,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:09,975 INFO L353 Elim1Store]: treesize reduction 14, result has 77.0 percent of original size [2022-03-15 21:47:09,975 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 62 [2022-03-15 21:47:10,102 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:10,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:10,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:47:10,546 INFO L353 Elim1Store]: treesize reduction 24, result has 75.3 percent of original size [2022-03-15 21:47:10,547 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 36 treesize of output 92 [2022-03-15 21:47:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:10,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437458964] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:10,709 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:10,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2022-03-15 21:47:10,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2084465973] [2022-03-15 21:47:10,709 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:10,711 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:10,732 INFO L252 McrAutomatonBuilder]: Finished intersection with 141 states and 316 transitions. [2022-03-15 21:47:10,732 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:14,045 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [228608#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= 3 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))), 228606#(or (<= 3 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))), 228605#(or (<= 3 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 228604#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= 3 (+ total (select q1 q1_front))) (<= (+ q1_back 1) q1_front)), 228602#(or (< q1_front q1_back) (<= 3 total)), 228610#(or (<= 3 (+ total (select q1 q1_front))) (<= q1_back q1_front)), 228609#(and (or (not (= (select q1 q1_back) C)) (<= 3 (+ (* 3 C) total))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 228603#(or (< (+ q1_front 1) q1_back) (<= 3 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 228607#(or (not (= (select q1 q1_back) C)) (<= 3 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (< (+ q1_front 1) q1_back) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front q1_back)))] [2022-03-15 21:47:14,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 21:47:14,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:14,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 21:47:14,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 21:47:14,046 INFO L87 Difference]: Start difference. First operand 5864 states and 24863 transitions. Second operand has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:15,114 INFO L93 Difference]: Finished difference Result 13494 states and 55473 transitions. [2022-03-15 21:47:15,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 21:47:15,115 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 21:47:15,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:15,154 INFO L225 Difference]: With dead ends: 13494 [2022-03-15 21:47:15,154 INFO L226 Difference]: Without dead ends: 13451 [2022-03-15 21:47:15,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 115 SyntacticMatches, 25 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=328, Invalid=1834, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 21:47:15,156 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 344 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:15,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 291 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:47:15,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13451 states. [2022-03-15 21:47:15,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13451 to 5900. [2022-03-15 21:47:15,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5900 states, 5899 states have (on average 4.234785556874046) internal successors, (24981), 5899 states have internal predecessors, (24981), 0 states have call successors, (0), 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:47:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5900 states to 5900 states and 24981 transitions. [2022-03-15 21:47:15,337 INFO L78 Accepts]: Start accepts. Automaton has 5900 states and 24981 transitions. Word has length 26 [2022-03-15 21:47:15,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:15,337 INFO L470 AbstractCegarLoop]: Abstraction has 5900 states and 24981 transitions. [2022-03-15 21:47:15,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:15,337 INFO L276 IsEmpty]: Start isEmpty. Operand 5900 states and 24981 transitions. [2022-03-15 21:47:15,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:47:15,349 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:15,349 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:15,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-03-15 21:47:15,553 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:47:15,553 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:15,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:15,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1774043154, now seen corresponding path program 10 times [2022-03-15 21:47:15,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:15,554 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214779272] [2022-03-15 21:47:15,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:15,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:15,655 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:15,655 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:15,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214779272] [2022-03-15 21:47:15,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214779272] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:15,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643883496] [2022-03-15 21:47:15,656 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:47:15,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:15,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:15,657 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:47:15,658 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:47:15,683 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:47:15,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:15,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 21:47:15,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:15,885 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:47:15,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 16 [2022-03-15 21:47:15,911 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:15,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:16,114 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:47:16,115 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 39 treesize of output 103 [2022-03-15 21:47:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:16,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643883496] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:16,453 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:16,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-03-15 21:47:16,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [719133008] [2022-03-15 21:47:16,453 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:16,455 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:16,476 INFO L252 McrAutomatonBuilder]: Finished intersection with 141 states and 316 transitions. [2022-03-15 21:47:16,476 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:19,075 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [254105#(or (< q1_front q1_back) (<= 3 total)), 254111#(or (<= 3 (+ total (select q1 q1_front))) (<= q1_back q1_front)), 254108#(or (<= 3 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q1_back q1_front)), 254110#(or (not (= (select q1 q1_back) C)) (<= 3 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (< (+ q1_front 1) q1_back) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front q1_back))), 254106#(or (< (+ q1_front 1) q1_back) (<= 3 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 254107#(or (<= 3 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 2) q1_back) (<= q1_back (+ q1_front 1))), 254112#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= 3 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))), 254113#(and (or (not (= (select q1 q1_back) C)) (<= 3 (+ (* 3 C) total))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 254109#(or (<= 3 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))))] [2022-03-15 21:47:19,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 21:47:19,076 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:19,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 21:47:19,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2022-03-15 21:47:19,076 INFO L87 Difference]: Start difference. First operand 5900 states and 24981 transitions. Second operand has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:20,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:20,105 INFO L93 Difference]: Finished difference Result 15258 states and 62881 transitions. [2022-03-15 21:47:20,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 21:47:20,119 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 21:47:20,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:20,213 INFO L225 Difference]: With dead ends: 15258 [2022-03-15 21:47:20,214 INFO L226 Difference]: Without dead ends: 15197 [2022-03-15 21:47:20,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 121 SyntacticMatches, 21 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=393, Invalid=2259, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 21:47:20,215 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 456 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:20,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [456 Valid, 347 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:47:20,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15197 states. [2022-03-15 21:47:20,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15197 to 6886. [2022-03-15 21:47:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6886 states, 6885 states have (on average 4.258968772694263) internal successors, (29323), 6885 states have internal predecessors, (29323), 0 states have call successors, (0), 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:47:20,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6886 states to 6886 states and 29323 transitions. [2022-03-15 21:47:20,407 INFO L78 Accepts]: Start accepts. Automaton has 6886 states and 29323 transitions. Word has length 26 [2022-03-15 21:47:20,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:20,407 INFO L470 AbstractCegarLoop]: Abstraction has 6886 states and 29323 transitions. [2022-03-15 21:47:20,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:20,407 INFO L276 IsEmpty]: Start isEmpty. Operand 6886 states and 29323 transitions. [2022-03-15 21:47:20,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 21:47:20,421 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:20,421 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:20,440 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:47:20,635 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:47:20,635 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:20,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:20,636 INFO L85 PathProgramCache]: Analyzing trace with hash 165905750, now seen corresponding path program 9 times [2022-03-15 21:47:20,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:20,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006562122] [2022-03-15 21:47:20,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:20,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-15 21:47:20,666 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:20,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006562122] [2022-03-15 21:47:20,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006562122] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:20,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698673903] [2022-03-15 21:47:20,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:47:20,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:20,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:20,667 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:47:20,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 21:47:20,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:47:20,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:20,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 21:47:20,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:20,755 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-15 21:47:20,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-15 21:47:20,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698673903] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:20,806 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:20,806 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 6 [2022-03-15 21:47:20,806 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [979725178] [2022-03-15 21:47:20,806 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:20,809 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:20,865 INFO L252 McrAutomatonBuilder]: Finished intersection with 304 states and 774 transitions. [2022-03-15 21:47:20,865 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:24,163 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [283356#(or (< j M) (<= q2_back q2_front)), 283360#(or (<= q2_back q2_front) (not (< j M))), 283355#(< j M), 283358#(or (< (+ j 1) M) (<= q2_back (+ q2_front 1))), 283357#(or (< j M) (<= q2_back (+ q2_front 1))), 283359#(or (< (+ j 1) M) (<= q2_back q2_front) (<= M j))] [2022-03-15 21:47:24,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 21:47:24,165 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:24,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 21:47:24,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-03-15 21:47:24,166 INFO L87 Difference]: Start difference. First operand 6886 states and 29323 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 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:47:24,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:24,361 INFO L93 Difference]: Finished difference Result 12107 states and 51195 transitions. [2022-03-15 21:47:24,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 21:47:24,362 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 21:47:24,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:24,398 INFO L225 Difference]: With dead ends: 12107 [2022-03-15 21:47:24,399 INFO L226 Difference]: Without dead ends: 11853 [2022-03-15 21:47:24,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 299 SyntacticMatches, 24 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:47:24,400 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 115 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:24,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 47 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:47:24,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11853 states. [2022-03-15 21:47:24,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11853 to 10694. [2022-03-15 21:47:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10694 states, 10693 states have (on average 4.357336575329655) internal successors, (46593), 10693 states have internal predecessors, (46593), 0 states have call successors, (0), 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:47:24,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10694 states to 10694 states and 46593 transitions. [2022-03-15 21:47:24,668 INFO L78 Accepts]: Start accepts. Automaton has 10694 states and 46593 transitions. Word has length 28 [2022-03-15 21:47:24,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:24,668 INFO L470 AbstractCegarLoop]: Abstraction has 10694 states and 46593 transitions. [2022-03-15 21:47:24,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 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:47:24,669 INFO L276 IsEmpty]: Start isEmpty. Operand 10694 states and 46593 transitions. [2022-03-15 21:47:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 21:47:24,691 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:24,691 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:24,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 21:47:24,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-03-15 21:47:24,911 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:24,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:24,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2011895558, now seen corresponding path program 11 times [2022-03-15 21:47:24,913 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:24,913 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277316175] [2022-03-15 21:47:24,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:24,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:24,967 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:24,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277316175] [2022-03-15 21:47:24,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277316175] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:24,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988027216] [2022-03-15 21:47:24,967 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:47:24,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:24,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:24,968 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:47:24,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 21:47:24,997 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 21:47:24,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:24,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:47:24,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:25,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:25,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988027216] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:25,050 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:25,050 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 10 [2022-03-15 21:47:25,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [910128557] [2022-03-15 21:47:25,050 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:25,052 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:25,187 INFO L252 McrAutomatonBuilder]: Finished intersection with 246 states and 610 transitions. [2022-03-15 21:47:25,187 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:28,958 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [317039#(or (<= q1_back (+ q1_front 3)) (< (+ q1_front 4) q1_back) (< i N)), 317036#(or (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (< i N)), 317051#(or (< (+ i 1) N) (<= q1_back (+ q1_front 3))), 317055#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= q1_back (+ q1_front 1))), 317052#(or (< (+ i 1) N) (<= q1_back (+ q1_front 2)) (not (< i N))), 317046#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< (+ q1_front 1) q1_back) (<= q1_back q1_front)), 317040#(< i N), 317041#(or (< (+ i 1) N) (<= q1_back (+ q1_front 3)) (< (+ q1_front 4) q1_back)), 317053#(or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= q1_back (+ q1_front 2))), 317048#(or (< i N) (<= q1_back (+ q1_front 1))), 317035#(or (< q1_front q1_back) (< i N)), 317050#(or (<= q1_back (+ q1_front 3)) (< i N)), 317047#(or (<= q1_back q1_front) (< i N)), 317045#(or (<= N (+ 2 i)) (< (+ q1_front 2) q1_back) (< (+ 3 i) N) (<= q1_back (+ q1_front 1))), 317044#(or (<= N (+ i 1)) (< (+ q1_front 2) q1_back) (< (+ 2 i) N) (<= q1_back (+ q1_front 1))), 317038#(or (< (+ q1_front 3) q1_back) (<= q1_back (+ q1_front 2)) (< i N)), 317054#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= q1_back (+ q1_front 1))), 317049#(or (<= q1_back (+ q1_front 2)) (< i N)), 317037#(or (< (+ q1_front 2) q1_back) (< i N) (<= q1_back (+ q1_front 1))), 317056#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= q1_back q1_front)), 317042#(or (< (+ q1_front 3) q1_back) (<= N i) (< (+ i 1) N) (<= q1_back (+ q1_front 2))), 317043#(or (<= N (+ i 1)) (< (+ q1_front 3) q1_back) (< (+ 2 i) N) (<= q1_back (+ q1_front 2)))] [2022-03-15 21:47:28,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 21:47:28,959 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:28,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 21:47:28,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=791, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 21:47:28,959 INFO L87 Difference]: Start difference. First operand 10694 states and 46593 transitions. Second operand has 32 states, 32 states have (on average 4.6875) internal successors, (150), 31 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:47:29,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:29,555 INFO L93 Difference]: Finished difference Result 19261 states and 82558 transitions. [2022-03-15 21:47:29,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 21:47:29,556 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.6875) internal successors, (150), 31 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 28 [2022-03-15 21:47:29,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:29,686 INFO L225 Difference]: With dead ends: 19261 [2022-03-15 21:47:29,686 INFO L226 Difference]: Without dead ends: 19107 [2022-03-15 21:47:29,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 244 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=567, Invalid=1503, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 21:47:29,687 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 765 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:29,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 105 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:47:29,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19107 states. [2022-03-15 21:47:29,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19107 to 13384. [2022-03-15 21:47:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13384 states, 13383 states have (on average 4.3405813345288795) internal successors, (58090), 13383 states have internal predecessors, (58090), 0 states have call successors, (0), 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:47:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13384 states to 13384 states and 58090 transitions. [2022-03-15 21:47:30,028 INFO L78 Accepts]: Start accepts. Automaton has 13384 states and 58090 transitions. Word has length 28 [2022-03-15 21:47:30,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:30,028 INFO L470 AbstractCegarLoop]: Abstraction has 13384 states and 58090 transitions. [2022-03-15 21:47:30,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.6875) internal successors, (150), 31 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:47:30,028 INFO L276 IsEmpty]: Start isEmpty. Operand 13384 states and 58090 transitions. [2022-03-15 21:47:30,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:47:30,061 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:30,061 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:30,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 21:47:30,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 21:47:30,281 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:30,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:30,282 INFO L85 PathProgramCache]: Analyzing trace with hash -62564997, now seen corresponding path program 10 times [2022-03-15 21:47:30,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:30,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719853625] [2022-03-15 21:47:30,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:30,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-15 21:47:30,313 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:30,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719853625] [2022-03-15 21:47:30,313 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719853625] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:30,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613553214] [2022-03-15 21:47:30,313 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:47:30,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:30,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:30,314 INFO L229 MonitoredProcess]: Starting monitored process 23 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:47:30,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 21:47:30,351 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:47:30,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:30,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:47:30,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-15 21:47:30,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-15 21:47:30,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613553214] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:30,518 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:30,518 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-03-15 21:47:30,518 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1801114781] [2022-03-15 21:47:30,518 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:30,520 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:30,765 INFO L252 McrAutomatonBuilder]: Finished intersection with 392 states and 1018 transitions. [2022-03-15 21:47:30,765 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:34,271 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [363314#(or (< (+ 2 j) M) (<= M (+ j 1))), 363307#(or (< (+ i 1) N) (< j M)), 363303#(or (<= N i) (< (+ i 1) N)), 363310#(< (+ j 1) M), 363306#(or (< j M) (< i N)), 363313#(or (< (+ j 1) M) (< i N) (<= M j)), 363315#(or (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 363302#(< (+ i 1) N), 363301#(< i N), 363323#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= M j)), 363322#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N)), 363305#(< j M), 363287#(or (< (+ i 1) N) (<= M (+ j 1))), 363330#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M (+ j 1))), 363283#(or (<= M (+ j 1)) (< i N)), 363308#(or (<= N i) (< (+ i 1) N) (< j M)), 363317#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N)), 363329#(or (<= N i) (< (+ i 1) N) (<= M (+ j 1))), 363324#(or (<= N (+ i 1)) (< (+ 2 i) N) (< (+ 2 j) M) (<= M (+ j 1))), 363326#(or (< (+ i 1) N) (<= M j)), 363304#(or (<= N (+ i 1)) (< (+ 2 i) N)), 363312#(or (< (+ j 1) M) (<= M j)), 363327#(or (<= N i) (< (+ i 1) N) (<= M j)), 363320#(or (< (+ i 1) N) (< (+ 2 j) M) (<= M (+ j 1))), 363325#(or (< i N) (<= M j)), 363316#(or (< (+ j 1) M) (< (+ i 1) N)), 363318#(or (< (+ j 1) M) (< (+ i 1) N) (<= M j)), 363311#(or (< (+ j 1) M) (< i N)), 363319#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 363309#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 363321#(or (<= N i) (< (+ i 1) N) (< (+ 2 j) M) (<= M (+ j 1))), 363328#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j))] [2022-03-15 21:47:34,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 21:47:34,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:34,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 21:47:34,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 21:47:34,272 INFO L87 Difference]: Start difference. First operand 13384 states and 58090 transitions. Second operand has 39 states, 39 states have (on average 5.282051282051282) internal successors, (206), 38 states have internal predecessors, (206), 0 states have call successors, (0), 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:47:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:35,319 INFO L93 Difference]: Finished difference Result 36085 states and 155819 transitions. [2022-03-15 21:47:35,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 21:47:35,320 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 5.282051282051282) internal successors, (206), 38 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:47:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:35,590 INFO L225 Difference]: With dead ends: 36085 [2022-03-15 21:47:35,591 INFO L226 Difference]: Without dead ends: 35810 [2022-03-15 21:47:35,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 381 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1639 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1147, Invalid=4109, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 21:47:35,593 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 704 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:35,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [704 Valid, 1 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:47:35,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35810 states. [2022-03-15 21:47:36,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35810 to 19853. [2022-03-15 21:47:36,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19853 states, 19852 states have (on average 4.4906306669353215) internal successors, (89148), 19852 states have internal predecessors, (89148), 0 states have call successors, (0), 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:47:36,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19853 states to 19853 states and 89148 transitions. [2022-03-15 21:47:36,386 INFO L78 Accepts]: Start accepts. Automaton has 19853 states and 89148 transitions. Word has length 30 [2022-03-15 21:47:36,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:36,386 INFO L470 AbstractCegarLoop]: Abstraction has 19853 states and 89148 transitions. [2022-03-15 21:47:36,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.282051282051282) internal successors, (206), 38 states have internal predecessors, (206), 0 states have call successors, (0), 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:47:36,386 INFO L276 IsEmpty]: Start isEmpty. Operand 19853 states and 89148 transitions. [2022-03-15 21:47:36,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:47:36,562 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:36,562 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:36,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 21:47:36,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:36,763 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:36,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:36,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1647280613, now seen corresponding path program 11 times [2022-03-15 21:47:36,764 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:36,764 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995385723] [2022-03-15 21:47:36,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:36,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:36,894 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:36,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995385723] [2022-03-15 21:47:36,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995385723] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:36,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732812427] [2022-03-15 21:47:36,894 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:47:36,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:36,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:36,896 INFO L229 MonitoredProcess]: Starting monitored process 24 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:47:36,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 21:47:36,933 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 21:47:36,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:36,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 21:47:36,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:37,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:47:37,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:47:37,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:47:37,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:47:37,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:47:37,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:47:37,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:47:37,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:47:37,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:47:37,264 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:37,264 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 89 [2022-03-15 21:47:37,443 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 26 treesize of output 20 [2022-03-15 21:47:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:37,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:37,652 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:37,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2022-03-15 21:47:37,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:37,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:47:37,960 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:37,960 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:37,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:37,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:37,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:37,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:47:37,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:47:37,964 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 46 treesize of output 26 [2022-03-15 21:47:37,993 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:37,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732812427] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:37,993 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:37,993 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2022-03-15 21:47:37,993 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [216683176] [2022-03-15 21:47:37,993 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:37,996 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:38,083 INFO L252 McrAutomatonBuilder]: Finished intersection with 360 states and 926 transitions. [2022-03-15 21:47:38,083 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:46,140 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [439402#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 439401#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 439390#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 439322#(or (< q1_front q1_back) (<= 1 (+ (select q2 q2_front) total))), 439387#(or (< (+ q1_front 3) q1_back) (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 2)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 439392#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 439396#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 439400#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 439403#(and (or (not (= (select q1 q1_back) C)) (= C (select q1 (+ q1_front 2)))) (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)))), 439381#(or (<= 1 total) (< q1_front q1_back)), 439333#(or (< (+ q1_front 2) q1_back) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< (+ q1_front 1) q1_back))), 439389#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 439382#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ (select q2 q2_front) total))), 439383#(or (not (= (+ C (select q2 q2_back)) 0)) (< q1_front q1_back) (<= 1 (+ (select q2 q2_front) total))), 439398#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 439404#(and (or (not (= (select q1 q1_back) C)) (= C (select q1 (+ q1_front 2))) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 439395#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 439405#(and (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (= C (select q1 (+ q1_front 2))) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (= (select q1 (+ q1_front 1)) C)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))))), 439399#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 439391#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 439397#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 439385#(or (not (= (+ C (select q2 q2_back)) 0)) (< (+ q1_front 2) q1_back) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back (+ q1_front 1))), 439326#(or (< (+ q1_front 1) q1_back) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front q1_back))), 439386#(or (< (+ q1_front 3) q1_back) (<= q1_back (+ q1_front 2)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 439394#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 439384#(or (not (= (+ C (select q2 q2_back)) 0)) (< (+ q1_front 1) q1_back) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front q1_back))), 439388#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 439393#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front))))] [2022-03-15 21:47:46,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 21:47:46,140 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:46,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 21:47:46,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=2548, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 21:47:46,141 INFO L87 Difference]: Start difference. First operand 19853 states and 89148 transitions. Second operand has 39 states, 38 states have (on average 5.315789473684211) internal successors, (202), 38 states have internal predecessors, (202), 0 states have call successors, (0), 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:47:49,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:49,840 INFO L93 Difference]: Finished difference Result 48659 states and 210647 transitions. [2022-03-15 21:47:49,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 21:47:49,841 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 5.315789473684211) internal successors, (202), 38 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:47:49,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:50,066 INFO L225 Difference]: With dead ends: 48659 [2022-03-15 21:47:50,066 INFO L226 Difference]: Without dead ends: 48604 [2022-03-15 21:47:50,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 268 SyntacticMatches, 76 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3727 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1062, Invalid=8444, Unknown=0, NotChecked=0, Total=9506 [2022-03-15 21:47:50,068 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 1247 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 3569 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 3770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 3569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:50,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1247 Valid, 466 Invalid, 3770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 3569 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 21:47:50,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48604 states. [2022-03-15 21:47:50,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48604 to 23163. [2022-03-15 21:47:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23163 states, 23162 states have (on average 4.506044383041188) internal successors, (104369), 23162 states have internal predecessors, (104369), 0 states have call successors, (0), 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:47:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23163 states to 23163 states and 104369 transitions. [2022-03-15 21:47:51,220 INFO L78 Accepts]: Start accepts. Automaton has 23163 states and 104369 transitions. Word has length 30 [2022-03-15 21:47:51,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:51,220 INFO L470 AbstractCegarLoop]: Abstraction has 23163 states and 104369 transitions. [2022-03-15 21:47:51,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 5.315789473684211) internal successors, (202), 38 states have internal predecessors, (202), 0 states have call successors, (0), 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:47:51,220 INFO L276 IsEmpty]: Start isEmpty. Operand 23163 states and 104369 transitions. [2022-03-15 21:47:51,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:47:51,279 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:51,279 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:51,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 21:47:51,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:51,495 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:51,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:51,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1313948025, now seen corresponding path program 12 times [2022-03-15 21:47:51,497 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:51,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845031734] [2022-03-15 21:47:51,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:51,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:51,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:51,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845031734] [2022-03-15 21:47:51,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845031734] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:51,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685053129] [2022-03-15 21:47:51,645 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:47:51,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:51,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:51,647 INFO L229 MonitoredProcess]: Starting monitored process 25 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:47:51,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 21:47:51,686 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:47:51,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:51,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:47:51,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:52,097 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 46 treesize of output 38 [2022-03-15 21:47:52,183 INFO L353 Elim1Store]: treesize reduction 14, result has 77.0 percent of original size [2022-03-15 21:47:52,184 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 74 [2022-03-15 21:47:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:52,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:52,519 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:52,519 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 27 treesize of output 31 [2022-03-15 21:47:52,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:47:52,963 INFO L353 Elim1Store]: treesize reduction 24, result has 75.3 percent of original size [2022-03-15 21:47:52,964 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 98 [2022-03-15 21:47:53,266 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:53,266 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685053129] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:53,266 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:53,266 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-03-15 21:47:53,266 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1185676148] [2022-03-15 21:47:53,266 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:53,269 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:53,336 INFO L252 McrAutomatonBuilder]: Finished intersection with 330 states and 838 transitions. [2022-03-15 21:47:53,336 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:00,561 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [534702#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 534694#(or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 1)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 534688#(or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 534693#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= (+ q1_back 2) q1_front)), 534700#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= (+ q1_back 2) q1_front)), 534705#(and (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (= C (select q1 (+ q1_front 2))) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (= (select q1 (+ q1_front 1)) C)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))))), 534689#(or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 534690#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 534691#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 534684#(or (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))), 534602#(or (<= 1 total) (< q1_front q1_back)), 534695#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 534703#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 534697#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 534685#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front)))), 534701#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 534704#(and (or (not (= (select q1 q1_back) C)) (= C (select q1 (+ q1_front 2))) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 534687#(or (<= q1_back (+ q1_front 1)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 534683#(or (< (+ q1_front 1) q1_back) (<= 1 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 534692#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 534686#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))), 534698#(and (or (not (= (select q1 q1_back) C)) (= C (select q1 (+ q1_front 2)))) (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)))), 534696#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 534699#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))))] [2022-03-15 21:48:00,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 21:48:00,561 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:00,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 21:48:00,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=2447, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 21:48:00,562 INFO L87 Difference]: Start difference. First operand 23163 states and 104369 transitions. Second operand has 35 states, 34 states have (on average 5.147058823529412) internal successors, (175), 34 states have internal predecessors, (175), 0 states have call successors, (0), 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:48:02,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:02,835 INFO L93 Difference]: Finished difference Result 42553 states and 185676 transitions. [2022-03-15 21:48:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 21:48:02,835 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 5.147058823529412) internal successors, (175), 34 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:48:02,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:03,017 INFO L225 Difference]: With dead ends: 42553 [2022-03-15 21:48:03,017 INFO L226 Difference]: Without dead ends: 42487 [2022-03-15 21:48:03,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 281 SyntacticMatches, 34 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2229 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=594, Invalid=4956, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 21:48:03,018 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 597 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 3193 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:03,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [597 Valid, 436 Invalid, 3288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3193 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 21:48:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42487 states. [2022-03-15 21:48:03,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42487 to 23269. [2022-03-15 21:48:03,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23269 states, 23268 states have (on average 4.509970775313736) internal successors, (104938), 23268 states have internal predecessors, (104938), 0 states have call successors, (0), 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:48:03,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23269 states to 23269 states and 104938 transitions. [2022-03-15 21:48:03,810 INFO L78 Accepts]: Start accepts. Automaton has 23269 states and 104938 transitions. Word has length 30 [2022-03-15 21:48:03,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:03,810 INFO L470 AbstractCegarLoop]: Abstraction has 23269 states and 104938 transitions. [2022-03-15 21:48:03,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 5.147058823529412) internal successors, (175), 34 states have internal predecessors, (175), 0 states have call successors, (0), 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:48:03,811 INFO L276 IsEmpty]: Start isEmpty. Operand 23269 states and 104938 transitions. [2022-03-15 21:48:03,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:48:03,865 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:03,865 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:03,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 21:48:04,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 21:48:04,085 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:48:04,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:04,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1414440515, now seen corresponding path program 13 times [2022-03-15 21:48:04,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:04,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075223977] [2022-03-15 21:48:04,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:04,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:04,187 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:04,187 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:04,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075223977] [2022-03-15 21:48:04,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075223977] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:04,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541988293] [2022-03-15 21:48:04,188 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:48:04,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:04,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:04,189 INFO L229 MonitoredProcess]: Starting monitored process 26 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:48:04,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 21:48:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:04,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:48:04,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:04,717 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 43 treesize of output 35 [2022-03-15 21:48:04,796 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:48:04,796 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 25 [2022-03-15 21:48:04,815 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:04,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:04,897 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:48:04,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-03-15 21:48:05,019 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:48:05,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, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 109 [2022-03-15 21:48:05,333 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:05,333 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541988293] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:05,333 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:05,333 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 21:48:05,333 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [188579014] [2022-03-15 21:48:05,333 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:05,336 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:05,395 INFO L252 McrAutomatonBuilder]: Finished intersection with 302 states and 754 transitions. [2022-03-15 21:48:05,395 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:11,848 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [624052#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< q1_front q1_back))), 624061#(or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_back 3) q1_front) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 624056#(and (or (not (= (select q1 q1_back) C)) (= C (select q1 (+ q1_front 2)))) (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)))), 624057#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 624062#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 624058#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 624063#(and (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (= C (select q1 (+ q1_front 2))) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (= (select q1 (+ q1_front 1)) C)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))))), 624047#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= (+ q1_back 2) q1_front)), 624044#(or (< (+ q1_front 2) q1_back) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back (+ q1_front 1))), 624046#(or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 624053#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 624054#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< q1_front (+ q1_back 1)))), 624050#(or (<= (+ q1_back 3) q1_front) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 624043#(or (< (+ q1_front 1) q1_back) (<= 1 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 624048#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 624055#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 624059#(and (or (not (= (select q1 q1_back) C)) (= C (select q1 (+ q1_front 2))) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 624049#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 624042#(or (<= 1 total) (< q1_front q1_back)), 624060#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 624045#(or (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< q1_front q1_back))), 624051#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))))] [2022-03-15 21:48:11,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:48:11,848 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:11,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:48:11,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=2028, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 21:48:11,849 INFO L87 Difference]: Start difference. First operand 23269 states and 104938 transitions. Second operand has 33 states, 32 states have (on average 5.125) internal successors, (164), 32 states have internal predecessors, (164), 0 states have call successors, (0), 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:48:13,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:13,093 INFO L93 Difference]: Finished difference Result 41878 states and 184023 transitions. [2022-03-15 21:48:13,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 21:48:13,093 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 5.125) internal successors, (164), 32 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:48:13,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:13,243 INFO L225 Difference]: With dead ends: 41878 [2022-03-15 21:48:13,243 INFO L226 Difference]: Without dead ends: 41782 [2022-03-15 21:48:13,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 234 SyntacticMatches, 57 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=567, Invalid=3723, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 21:48:13,244 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 627 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 1882 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:13,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [627 Valid, 282 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1882 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:48:13,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41782 states. [2022-03-15 21:48:14,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41782 to 23541. [2022-03-15 21:48:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23541 states, 23540 states have (on average 4.514868309260833) internal successors, (106280), 23540 states have internal predecessors, (106280), 0 states have call successors, (0), 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:48:14,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23541 states to 23541 states and 106280 transitions. [2022-03-15 21:48:14,219 INFO L78 Accepts]: Start accepts. Automaton has 23541 states and 106280 transitions. Word has length 30 [2022-03-15 21:48:14,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:14,219 INFO L470 AbstractCegarLoop]: Abstraction has 23541 states and 106280 transitions. [2022-03-15 21:48:14,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 5.125) internal successors, (164), 32 states have internal predecessors, (164), 0 states have call successors, (0), 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:48:14,219 INFO L276 IsEmpty]: Start isEmpty. Operand 23541 states and 106280 transitions. [2022-03-15 21:48:14,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:48:14,348 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:14,348 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:14,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 21:48:14,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 21:48:14,567 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:48:14,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash -829190401, now seen corresponding path program 14 times [2022-03-15 21:48:14,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:14,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374902565] [2022-03-15 21:48:14,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:14,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:14,700 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:14,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374902565] [2022-03-15 21:48:14,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374902565] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:14,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834647993] [2022-03-15 21:48:14,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:48:14,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:14,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:14,702 INFO L229 MonitoredProcess]: Starting monitored process 27 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:48:14,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 21:48:14,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:48:14,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:48:14,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:48:14,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:14,932 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 37 treesize of output 29 [2022-03-15 21:48:15,013 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:48:15,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 25 [2022-03-15 21:48:15,025 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:15,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:15,080 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:48:15,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-03-15 21:48:15,239 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:48:15,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 109 [2022-03-15 21:48:15,610 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:15,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834647993] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:15,610 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:15,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 21:48:15,611 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1241310795] [2022-03-15 21:48:15,611 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:15,613 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:15,683 INFO L252 McrAutomatonBuilder]: Finished intersection with 298 states and 730 transitions. [2022-03-15 21:48:15,683 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:19,962 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [713262#(or (< (+ q1_front 3) q1_back) (<= q1_back (+ q1_front 2)) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 713272#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 713278#(and (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (= C (select q1 (+ q1_front 2))) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (= (select q1 (+ q1_front 1)) C)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))))), 713259#(or (<= 1 total) (< q1_front q1_back)), 713265#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 713267#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 1))))), 713271#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 713261#(or (< (+ q1_front 2) q1_back) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back (+ q1_front 1))), 713276#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 713260#(or (< (+ q1_front 1) q1_back) (<= 1 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 713266#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 713263#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= q1_back (+ q1_front 1))), 713264#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 713269#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 713273#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 713275#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 713270#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))), 713268#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 713274#(and (or (not (= (select q1 q1_back) C)) (= C (select q1 (+ q1_front 2)))) (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)))), 713277#(and (or (not (= (select q1 q1_back) C)) (= C (select q1 (+ q1_front 2))) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))))] [2022-03-15 21:48:19,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 21:48:19,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:19,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 21:48:19,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1845, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 21:48:19,964 INFO L87 Difference]: Start difference. First operand 23541 states and 106280 transitions. Second operand has 31 states, 30 states have (on average 5.066666666666666) internal successors, (152), 30 states have internal predecessors, (152), 0 states have call successors, (0), 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:48:23,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:23,467 INFO L93 Difference]: Finished difference Result 54863 states and 239035 transitions. [2022-03-15 21:48:23,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-15 21:48:23,467 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 5.066666666666666) internal successors, (152), 30 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:48:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:23,843 INFO L225 Difference]: With dead ends: 54863 [2022-03-15 21:48:23,843 INFO L226 Difference]: Without dead ends: 54733 [2022-03-15 21:48:23,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 279 SyntacticMatches, 10 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2600 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1177, Invalid=7943, Unknown=0, NotChecked=0, Total=9120 [2022-03-15 21:48:23,846 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 1218 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 2849 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 3058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 2849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:23,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1218 Valid, 483 Invalid, 3058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 2849 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 21:48:23,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54733 states. [2022-03-15 21:48:24,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54733 to 24554. [2022-03-15 21:48:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24554 states, 24553 states have (on average 4.504948478800961) internal successors, (110610), 24553 states have internal predecessors, (110610), 0 states have call successors, (0), 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:48:24,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24554 states to 24554 states and 110610 transitions. [2022-03-15 21:48:24,855 INFO L78 Accepts]: Start accepts. Automaton has 24554 states and 110610 transitions. Word has length 30 [2022-03-15 21:48:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:24,856 INFO L470 AbstractCegarLoop]: Abstraction has 24554 states and 110610 transitions. [2022-03-15 21:48:24,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 5.066666666666666) internal successors, (152), 30 states have internal predecessors, (152), 0 states have call successors, (0), 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:48:24,856 INFO L276 IsEmpty]: Start isEmpty. Operand 24554 states and 110610 transitions. [2022-03-15 21:48:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:48:25,027 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:25,027 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:25,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 21:48:25,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 21:48:25,243 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:48:25,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:25,244 INFO L85 PathProgramCache]: Analyzing trace with hash -482100613, now seen corresponding path program 12 times [2022-03-15 21:48:25,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:25,244 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12388574] [2022-03-15 21:48:25,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:25,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:25,377 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:25,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12388574] [2022-03-15 21:48:25,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12388574] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:25,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583991241] [2022-03-15 21:48:25,377 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:48:25,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:25,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:25,388 INFO L229 MonitoredProcess]: Starting monitored process 28 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:48:25,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 21:48:25,418 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 21:48:25,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:48:25,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 21:48:25,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:25,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:48:25,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:48:25,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:48:25,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:48:25,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:48:25,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:48:25,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:48:25,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:48:25,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:48:25,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:48:25,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:48:25,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:48:25,824 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:48:25,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 50 treesize of output 120 [2022-03-15 21:48:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:26,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:26,817 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:48:26,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:48:26,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:48:26,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:48:26,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:48:26,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:48:26,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:48:26,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:48:26,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:48:26,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:48:26,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:48:26,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:48:26,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:48:26,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:48:26,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:48:26,836 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:48:26,836 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 51 treesize of output 61 [2022-03-15 21:48:27,474 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:27,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583991241] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:27,475 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:27,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-03-15 21:48:27,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1182143052] [2022-03-15 21:48:27,475 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:27,478 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:27,523 INFO L252 McrAutomatonBuilder]: Finished intersection with 264 states and 650 transitions. [2022-03-15 21:48:27,523 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:33,208 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [817480#(or (<= 1 total) (< q1_front q1_back)), 817560#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 3)))) (<= 1 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))), 817559#(or (not (= (select q1 q1_back) C)) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))), 817491#(or (< (+ q1_front 2) q1_back) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< (+ q1_front 1) q1_back))), 817557#(or (not (= (select q1 q1_back) C)) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 817561#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 3)))) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))), 817556#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (< (+ q1_front 1) q1_back) (not (= C (select q1 (+ q1_back 2)))) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))), 817555#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= 1 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= q1_back (+ q1_front 1))), 817553#(or (<= q1_back (+ q1_front 3)) (<= 1 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (< (+ q1_front 4) q1_back)), 817552#(or (< (+ q1_front 3) q1_back) (<= q1_back (+ q1_front 2)) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 817554#(or (< (+ q1_front 3) q1_back) (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 2)) (<= 1 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 817484#(or (< (+ q1_front 1) q1_back) (<= 1 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 817558#(or (not (= (select q1 q1_back) C)) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 1)))))] [2022-03-15 21:48:33,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:48:33,208 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:33,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:48:33,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1289, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 21:48:33,209 INFO L87 Difference]: Start difference. First operand 24554 states and 110610 transitions. Second operand has 24 states, 23 states have (on average 5.043478260869565) internal successors, (116), 23 states have internal predecessors, (116), 0 states have call successors, (0), 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:48:35,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:35,085 INFO L93 Difference]: Finished difference Result 51299 states and 224594 transitions. [2022-03-15 21:48:35,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 21:48:35,085 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.043478260869565) internal successors, (116), 23 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:48:35,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:35,286 INFO L225 Difference]: With dead ends: 51299 [2022-03-15 21:48:35,286 INFO L226 Difference]: Without dead ends: 51283 [2022-03-15 21:48:35,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 219 SyntacticMatches, 43 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1971 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=813, Invalid=4299, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 21:48:35,287 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 730 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:35,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [730 Valid, 387 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:48:35,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51283 states. [2022-03-15 21:48:36,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51283 to 28432. [2022-03-15 21:48:36,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28432 states, 28431 states have (on average 4.524955154584784) internal successors, (128649), 28431 states have internal predecessors, (128649), 0 states have call successors, (0), 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:48:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28432 states to 28432 states and 128649 transitions. [2022-03-15 21:48:36,515 INFO L78 Accepts]: Start accepts. Automaton has 28432 states and 128649 transitions. Word has length 30 [2022-03-15 21:48:36,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:36,515 INFO L470 AbstractCegarLoop]: Abstraction has 28432 states and 128649 transitions. [2022-03-15 21:48:36,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.043478260869565) internal successors, (116), 23 states have internal predecessors, (116), 0 states have call successors, (0), 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:48:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 28432 states and 128649 transitions. [2022-03-15 21:48:36,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:48:36,607 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:36,607 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:36,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 21:48:36,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 21:48:36,823 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:48:36,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:36,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1952668109, now seen corresponding path program 13 times [2022-03-15 21:48:36,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:36,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106737438] [2022-03-15 21:48:36,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:36,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:37,065 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:37,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106737438] [2022-03-15 21:48:37,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106737438] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:37,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685742939] [2022-03-15 21:48:37,066 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:48:37,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:37,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:37,086 INFO L229 MonitoredProcess]: Starting monitored process 29 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:48:37,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 21:48:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:37,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:48:37,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:37,702 INFO L353 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-03-15 21:48:37,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 20 [2022-03-15 21:48:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:37,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:38,113 INFO L353 Elim1Store]: treesize reduction 156, result has 49.5 percent of original size [2022-03-15 21:48:38,114 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 52 treesize of output 176 [2022-03-15 21:48:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:39,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685742939] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:39,430 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:39,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 21:48:39,430 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2068104388] [2022-03-15 21:48:39,430 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:39,433 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:39,468 INFO L252 McrAutomatonBuilder]: Finished intersection with 177 states and 396 transitions. [2022-03-15 21:48:39,468 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:44,005 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [925992#(or (< (+ q1_front 1) q1_back) (<= 4 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 926000#(and (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 2) q1_back)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 2))) (or (<= 4 (+ total (* C 4))) (not (= (select q1 q1_back) C)))), 925999#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 2)))) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))), 925994#(or (<= 4 (+ total (select q1 q1_front))) (<= q1_back q1_front)), 925996#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= q1_back (+ q1_front 1))), 925995#(or (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 925998#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= q1_back (+ q1_front 1))), 926003#(and (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (<= 4 (+ total (* C 4))) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))))), 925997#(or (< (+ q1_front 3) q1_back) (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 2)) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 926001#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 3)))) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))), 925991#(or (<= 4 total) (< q1_front q1_back)), 926002#(and (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= (+ q1_front 1) q1_back)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= q1_back (+ q1_front 1))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= 4 (+ total (* C 4))) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 925993#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= 4 (+ total (select q1 q1_front))))] [2022-03-15 21:48:44,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:48:44,006 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:44,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:48:44,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1356, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 21:48:44,011 INFO L87 Difference]: Start difference. First operand 28432 states and 128649 transitions. Second operand has 24 states, 23 states have (on average 4.695652173913044) internal successors, (108), 23 states have internal predecessors, (108), 0 states have call successors, (0), 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:48:46,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:46,627 INFO L93 Difference]: Finished difference Result 67337 states and 294452 transitions. [2022-03-15 21:48:46,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 21:48:46,627 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.695652173913044) internal successors, (108), 23 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:48:46,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:46,952 INFO L225 Difference]: With dead ends: 67337 [2022-03-15 21:48:46,952 INFO L226 Difference]: Without dead ends: 67294 [2022-03-15 21:48:46,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 153 SyntacticMatches, 21 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1498 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=822, Invalid=4290, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 21:48:46,953 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 724 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 1826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:46,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [724 Valid, 386 Invalid, 1826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 21:48:47,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67294 states. [2022-03-15 21:48:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67294 to 32484. [2022-03-15 21:48:48,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32484 states, 32483 states have (on average 4.5469630268140255) internal successors, (147699), 32483 states have internal predecessors, (147699), 0 states have call successors, (0), 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:48:48,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32484 states to 32484 states and 147699 transitions. [2022-03-15 21:48:48,615 INFO L78 Accepts]: Start accepts. Automaton has 32484 states and 147699 transitions. Word has length 30 [2022-03-15 21:48:48,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:48,615 INFO L470 AbstractCegarLoop]: Abstraction has 32484 states and 147699 transitions. [2022-03-15 21:48:48,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.695652173913044) internal successors, (108), 23 states have internal predecessors, (108), 0 states have call successors, (0), 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:48:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 32484 states and 147699 transitions. [2022-03-15 21:48:48,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:48:48,712 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:48,712 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:48,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 21:48:48,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:48,929 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:48:48,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:48,929 INFO L85 PathProgramCache]: Analyzing trace with hash -604152367, now seen corresponding path program 14 times [2022-03-15 21:48:48,930 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:48,930 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853945438] [2022-03-15 21:48:48,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:48,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:49,084 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:49,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853945438] [2022-03-15 21:48:49,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853945438] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:49,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242962870] [2022-03-15 21:48:49,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:48:49,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:49,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:49,085 INFO L229 MonitoredProcess]: Starting monitored process 30 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:48:49,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 21:48:49,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:48:49,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:48:49,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:48:49,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:49,720 INFO L353 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-03-15 21:48:49,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 20 [2022-03-15 21:48:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:49,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:50,100 INFO L353 Elim1Store]: treesize reduction 156, result has 49.5 percent of original size [2022-03-15 21:48:50,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 52 treesize of output 176 [2022-03-15 21:48:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:51,454 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242962870] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:51,454 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:51,454 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 21:48:51,454 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1395415024] [2022-03-15 21:48:51,454 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:51,463 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:51,498 INFO L252 McrAutomatonBuilder]: Finished intersection with 177 states and 396 transitions. [2022-03-15 21:48:51,499 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:56,711 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [1058576#(or (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q1_back q1_front)), 1058577#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= q1_back (+ q1_front 1))), 1058575#(or (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 2) q1_back) (<= q1_back (+ q1_front 1))), 1058579#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= q1_back (+ q1_front 1))), 1058582#(and (or (not (= (select q1 q1_back) C)) (= C (select q1 (+ q1_front 2))) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= q1_back (+ q1_front 1))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= (select q1 (+ q1_front 1)) C)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= 4 (+ total (* C 4))) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 1058573#(or (<= 4 total) (< q1_front q1_back)), 1058578#(or (< (+ q1_front 3) q1_back) (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 2)) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 1058580#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 2)))) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))), 1058574#(or (< (+ q1_front 1) q1_back) (<= 4 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 1058581#(and (or (not (= (select q1 q1_back) C)) (= C (select q1 (+ q1_front 2)))) (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 2))) (or (<= 4 (+ total (* C 4))) (not (= (select q1 q1_back) C)))), 1058583#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 3)))) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))), 1058584#(and (or (not (= (select q1 q1_back) C)) (= C (select q1 (+ q1_front 2))) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (<= 4 (+ total (* C 4))) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))))] [2022-03-15 21:48:56,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:48:56,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:56,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:48:56,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1316, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 21:48:56,712 INFO L87 Difference]: Start difference. First operand 32484 states and 147699 transitions. Second operand has 23 states, 22 states have (on average 4.7727272727272725) internal successors, (105), 22 states have internal predecessors, (105), 0 states have call successors, (0), 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:48:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:59,158 INFO L93 Difference]: Finished difference Result 61846 states and 272751 transitions. [2022-03-15 21:48:59,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 21:48:59,158 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.7727272727272725) internal successors, (105), 22 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:48:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:59,446 INFO L225 Difference]: With dead ends: 61846 [2022-03-15 21:48:59,447 INFO L226 Difference]: Without dead ends: 61785 [2022-03-15 21:48:59,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 156 SyntacticMatches, 19 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=708, Invalid=3984, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 21:48:59,447 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 726 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:59,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [726 Valid, 320 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1358 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:48:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61785 states. [2022-03-15 21:49:00,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61785 to 33268. [2022-03-15 21:49:00,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33268 states, 33267 states have (on average 4.555715874590435) internal successors, (151555), 33267 states have internal predecessors, (151555), 0 states have call successors, (0), 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:49:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33268 states to 33268 states and 151555 transitions. [2022-03-15 21:49:01,090 INFO L78 Accepts]: Start accepts. Automaton has 33268 states and 151555 transitions. Word has length 30 [2022-03-15 21:49:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:01,090 INFO L470 AbstractCegarLoop]: Abstraction has 33268 states and 151555 transitions. [2022-03-15 21:49:01,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.7727272727272725) internal successors, (105), 22 states have internal predecessors, (105), 0 states have call successors, (0), 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:49:01,090 INFO L276 IsEmpty]: Start isEmpty. Operand 33268 states and 151555 transitions. [2022-03-15 21:49:01,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:49:01,177 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:01,177 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:01,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:01,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:01,394 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:49:01,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:01,395 INFO L85 PathProgramCache]: Analyzing trace with hash -987336491, now seen corresponding path program 15 times [2022-03-15 21:49:01,395 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:01,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441445811] [2022-03-15 21:49:01,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:01,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:01,528 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:01,528 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:01,528 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441445811] [2022-03-15 21:49:01,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441445811] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:01,528 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460232866] [2022-03-15 21:49:01,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:49:01,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:01,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:01,530 INFO L229 MonitoredProcess]: Starting monitored process 31 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:49:01,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 21:49:01,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 21:49:01,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:01,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 21:49:01,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:01,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:01,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:01,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:01,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:01,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:01,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:01,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:01,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:01,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:01,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:01,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:01,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:01,907 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:01,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 50 treesize of output 120 [2022-03-15 21:49:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:02,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:03,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:03,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:03,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:03,439 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:03,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:03,440 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:03,440 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:03,440 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:03,440 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:03,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:03,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:03,442 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:03,442 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:03,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:03,454 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:03,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 51 treesize of output 61 [2022-03-15 21:49:04,089 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:04,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460232866] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:04,090 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:04,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-03-15 21:49:04,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1911388134] [2022-03-15 21:49:04,090 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:04,093 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:04,126 INFO L252 McrAutomatonBuilder]: Finished intersection with 177 states and 396 transitions. [2022-03-15 21:49:04,126 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:07,684 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [1187237#(and (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 2) q1_back)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 2))) (or (<= 4 (+ total (* C 4))) (not (= (select q1 q1_back) C)))), 1187238#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 2)))) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))), 1187239#(and (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= (+ q1_front 1) q1_back)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= q1_back (+ q1_front 1))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= 4 (+ total (* C 4))) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 1187229#(or (<= 4 total) (< q1_front q1_back)), 1187236#(or (<= 4 (+ total (select q1 q1_front))) (<= q1_back q1_front)), 1187230#(or (< (+ q1_front 1) q1_back) (<= 4 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 1187232#(or (< (+ q1_front 3) q1_back) (<= q1_back (+ q1_front 2)) (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 1187234#(or (< (+ q1_front 3) q1_back) (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 2)) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 1187231#(or (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 2) q1_back) (<= q1_back (+ q1_front 1))), 1187240#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 3)))) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))), 1187235#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= q1_back (+ q1_front 1))), 1187233#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= q1_back (+ q1_front 1))), 1187241#(and (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (<= 4 (+ total (* C 4))) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))))] [2022-03-15 21:49:07,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:49:07,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:07,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:49:07,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1533, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 21:49:07,685 INFO L87 Difference]: Start difference. First operand 33268 states and 151555 transitions. Second operand has 24 states, 23 states have (on average 4.695652173913044) internal successors, (108), 23 states have internal predecessors, (108), 0 states have call successors, (0), 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:49:10,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:10,264 INFO L93 Difference]: Finished difference Result 70999 states and 312262 transitions. [2022-03-15 21:49:10,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-15 21:49:10,265 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.695652173913044) internal successors, (108), 23 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:49:10,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:10,719 INFO L225 Difference]: With dead ends: 70999 [2022-03-15 21:49:10,719 INFO L226 Difference]: Without dead ends: 70920 [2022-03-15 21:49:10,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 154 SyntacticMatches, 18 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=770, Invalid=4930, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 21:49:10,720 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 765 mSDsluCounter, 1746 mSDsCounter, 0 mSdLazyCounter, 2303 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 2449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 2303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:10,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 573 Invalid, 2449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2303 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:49:10,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70920 states. [2022-03-15 21:49:11,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70920 to 33519. [2022-03-15 21:49:11,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33519 states, 33518 states have (on average 4.5540008353720385) internal successors, (152641), 33518 states have internal predecessors, (152641), 0 states have call successors, (0), 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:49:12,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33519 states to 33519 states and 152641 transitions. [2022-03-15 21:49:12,131 INFO L78 Accepts]: Start accepts. Automaton has 33519 states and 152641 transitions. Word has length 30 [2022-03-15 21:49:12,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:12,131 INFO L470 AbstractCegarLoop]: Abstraction has 33519 states and 152641 transitions. [2022-03-15 21:49:12,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.695652173913044) internal successors, (108), 23 states have internal predecessors, (108), 0 states have call successors, (0), 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:49:12,132 INFO L276 IsEmpty]: Start isEmpty. Operand 33519 states and 152641 transitions. [2022-03-15 21:49:12,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:49:12,206 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:12,206 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:12,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:12,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-03-15 21:49:12,422 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:49:12,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:12,423 INFO L85 PathProgramCache]: Analyzing trace with hash -163251441, now seen corresponding path program 15 times [2022-03-15 21:49:12,424 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:12,424 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77935086] [2022-03-15 21:49:12,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:12,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:12,607 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:12,607 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:12,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77935086] [2022-03-15 21:49:12,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77935086] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:12,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368621967] [2022-03-15 21:49:12,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:49:12,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:12,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:12,609 INFO L229 MonitoredProcess]: Starting monitored process 32 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:49:12,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 21:49:12,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 21:49:12,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:12,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:49:12,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:13,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:13,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:13,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:13,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:13,094 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:13,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 95 [2022-03-15 21:49:14,172 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 26 treesize of output 20 [2022-03-15 21:49:14,195 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:14,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:14,439 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:14,440 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 25 treesize of output 29 [2022-03-15 21:49:14,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:14,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:14,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:14,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:14,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:14,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:14,826 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:14,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:14,836 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:14,836 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 52 [2022-03-15 21:49:15,311 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:15,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368621967] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:15,312 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:15,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2022-03-15 21:49:15,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [289176446] [2022-03-15 21:49:15,312 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:15,316 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:15,388 INFO L252 McrAutomatonBuilder]: Finished intersection with 269 states and 650 transitions. [2022-03-15 21:49:15,388 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:23,164 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [1325565#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 1325553#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front)))), 1325564#(and (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 1325557#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front)))), 1325573#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 1325492#(or (< q1_front q1_back) (<= 1 (+ (select q2 q2_front) total))), 1325563#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 1325556#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front))) (<= q1_back q1_front)), 1325569#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ C total (select q1 q1_front)))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (select q1 (+ q1_front 1)) C)) (or (not (= (+ C (select q2 q2_back)) 0)) (= q1_back (+ q1_front 2))) (or (not (= (+ C (select q2 q2_back)) 0)) (= C (select q1 q1_front)))), 1325552#(or (not (= (+ C (select q2 q2_back)) 0)) (< (+ q1_front 1) q1_back) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front q1_back))), 1325566#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 1325571#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 1325554#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))), 1325549#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ (select q2 q2_front) total))), 1325572#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1)))))), 1325567#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))))), 1325555#(or (<= 1 (+ (select q2 q2_front) total (select q1 q1_front))) (<= q1_back q1_front)), 1325548#(or (<= 1 total) (< q1_front q1_back)), 1325570#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1))) (or (not (= (+ C (select q2 q2_back)) 0)) (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back))), 1325574#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))))), 1325558#(and (or (not (= (+ C (select q2 q2_back)) 0)) (not (= C (select q1 q1_front))) (<= 2 total)) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (* (- 1) q1_front) q1_back) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= C (select q1 q1_front))))), 1325550#(or (not (= (+ C (select q2 q2_back)) 0)) (< q1_front q1_back) (<= 1 (+ (select q2 q2_front) total))), 1325562#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 1325561#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 1325568#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ C total))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ q1_front 1) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (= C (select q1 q1_front)))), 1325559#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 1325560#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 1325551#(or (< (+ q1_front 1) q1_back) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front q1_back)))] [2022-03-15 21:49:23,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 21:49:23,164 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:23,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 21:49:23,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=2650, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 21:49:23,165 INFO L87 Difference]: Start difference. First operand 33519 states and 152641 transitions. Second operand has 39 states, 38 states have (on average 5.078947368421052) internal successors, (193), 38 states have internal predecessors, (193), 0 states have call successors, (0), 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:49:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:26,668 INFO L93 Difference]: Finished difference Result 68399 states and 299700 transitions. [2022-03-15 21:49:26,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-15 21:49:26,668 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 5.078947368421052) internal successors, (193), 38 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:49:26,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:27,117 INFO L225 Difference]: With dead ends: 68399 [2022-03-15 21:49:27,118 INFO L226 Difference]: Without dead ends: 68344 [2022-03-15 21:49:27,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 223 SyntacticMatches, 28 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3158 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1331, Invalid=9381, Unknown=0, NotChecked=0, Total=10712 [2022-03-15 21:49:27,119 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 1178 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 2805 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 3068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 2805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:27,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1178 Valid, 350 Invalid, 3068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 2805 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 21:49:27,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68344 states. [2022-03-15 21:49:28,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68344 to 36310. [2022-03-15 21:49:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36310 states, 36309 states have (on average 4.566718995290424) internal successors, (165813), 36309 states have internal predecessors, (165813), 0 states have call successors, (0), 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:49:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36310 states to 36310 states and 165813 transitions. [2022-03-15 21:49:28,556 INFO L78 Accepts]: Start accepts. Automaton has 36310 states and 165813 transitions. Word has length 30 [2022-03-15 21:49:28,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:28,557 INFO L470 AbstractCegarLoop]: Abstraction has 36310 states and 165813 transitions. [2022-03-15 21:49:28,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 5.078947368421052) internal successors, (193), 38 states have internal predecessors, (193), 0 states have call successors, (0), 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:49:28,557 INFO L276 IsEmpty]: Start isEmpty. Operand 36310 states and 165813 transitions. [2022-03-15 21:49:28,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:49:28,821 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:28,821 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:28,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:29,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:29,035 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:49:29,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:29,036 INFO L85 PathProgramCache]: Analyzing trace with hash 27639107, now seen corresponding path program 16 times [2022-03-15 21:49:29,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:29,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321883881] [2022-03-15 21:49:29,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:29,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:29,204 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:29,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:29,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321883881] [2022-03-15 21:49:29,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321883881] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:29,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124350128] [2022-03-15 21:49:29,204 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:49:29,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:29,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:29,205 INFO L229 MonitoredProcess]: Starting monitored process 33 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:49:29,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 21:49:29,243 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:49:29,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:29,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:49:29,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:29,611 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 48 treesize of output 40 [2022-03-15 21:49:29,645 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:49:29,645 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 25 [2022-03-15 21:49:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:29,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:29,762 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:29,763 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-03-15 21:49:29,901 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:49:29,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 109 [2022-03-15 21:49:30,453 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:30,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124350128] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:30,453 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:30,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 21:49:30,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [200516199] [2022-03-15 21:49:30,454 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:30,456 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:30,502 INFO L252 McrAutomatonBuilder]: Finished intersection with 227 states and 517 transitions. [2022-03-15 21:49:30,502 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:35,972 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [1466909#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1))) (or (not (= (+ C (select q2 q2_back)) 0)) (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back))), 1466907#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ C total))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ q1_front 1) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (= C (select q1 q1_front)))), 1466896#(or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 1466900#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))))), 1466908#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ C total (select q1 q1_front)))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (select q1 (+ q1_front 1)) C)) (or (not (= (+ C (select q2 q2_back)) 0)) (= q1_back (+ q1_front 2))) (or (not (= (+ C (select q2 q2_back)) 0)) (= C (select q1 q1_front)))), 1466893#(or (not (= (select q1 q1_back) C)) (<= 1 (+ total (select q1 q1_front)))), 1466903#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))), 1466894#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front)))), 1466912#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1)))))), 1466891#(or (< (+ q1_front 1) q1_back) (<= 1 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 1466905#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 1466910#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 1466913#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))))), 1466895#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))), 1466892#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= 1 (+ total (select q1 q1_front)))), 1466911#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 1466902#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front)))), 1466906#(and (or (not (= (+ C (select q2 q2_back)) 0)) (not (= C (select q1 q1_front))) (<= 2 total)) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (* (- 1) q1_front) q1_back) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= C (select q1 q1_front))))), 1466904#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 1466899#(and (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 1466890#(or (<= 1 total) (< q1_front q1_back)), 1466898#(or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 1466901#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 1 (+ (select q2 q2_front) total (select q1 q1_front)))), 1466897#(or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))))] [2022-03-15 21:49:35,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 21:49:35,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:35,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 21:49:35,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=2107, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 21:49:35,973 INFO L87 Difference]: Start difference. First operand 36310 states and 165813 transitions. Second operand has 35 states, 34 states have (on average 4.735294117647059) internal successors, (161), 34 states have internal predecessors, (161), 0 states have call successors, (0), 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:49:39,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:39,407 INFO L93 Difference]: Finished difference Result 62264 states and 274893 transitions. [2022-03-15 21:49:39,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-15 21:49:39,407 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.735294117647059) internal successors, (161), 34 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:49:39,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:39,672 INFO L225 Difference]: With dead ends: 62264 [2022-03-15 21:49:39,672 INFO L226 Difference]: Without dead ends: 62174 [2022-03-15 21:49:39,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 198 SyntacticMatches, 17 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3046 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1281, Invalid=8225, Unknown=0, NotChecked=0, Total=9506 [2022-03-15 21:49:39,673 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 1033 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:39,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1033 Valid, 310 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 2590 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 21:49:39,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62174 states. [2022-03-15 21:49:40,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62174 to 36240. [2022-03-15 21:49:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36240 states, 36239 states have (on average 4.568751897127404) internal successors, (165567), 36239 states have internal predecessors, (165567), 0 states have call successors, (0), 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:49:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36240 states to 36240 states and 165567 transitions. [2022-03-15 21:49:40,994 INFO L78 Accepts]: Start accepts. Automaton has 36240 states and 165567 transitions. Word has length 30 [2022-03-15 21:49:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:40,994 INFO L470 AbstractCegarLoop]: Abstraction has 36240 states and 165567 transitions. [2022-03-15 21:49:40,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.735294117647059) internal successors, (161), 34 states have internal predecessors, (161), 0 states have call successors, (0), 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:49:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 36240 states and 165567 transitions. [2022-03-15 21:49:41,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:49:41,307 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:41,307 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:41,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:41,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:41,523 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:49:41,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:41,524 INFO L85 PathProgramCache]: Analyzing trace with hash 963992851, now seen corresponding path program 17 times [2022-03-15 21:49:41,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:41,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724326226] [2022-03-15 21:49:41,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:41,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:41,652 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:41,652 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:41,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724326226] [2022-03-15 21:49:41,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724326226] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:41,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924042356] [2022-03-15 21:49:41,653 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:49:41,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:41,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:41,654 INFO L229 MonitoredProcess]: Starting monitored process 34 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:49:41,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 21:49:41,683 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 21:49:41,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:41,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:49:41,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:41,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:41,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:41,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:41,951 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:41,951 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 65 treesize of output 107 [2022-03-15 21:49:42,286 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 17 treesize of output 13 [2022-03-15 21:49:42,299 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:42,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:42,697 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:42,697 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 27 treesize of output 31 [2022-03-15 21:49:42,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:42,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:42,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:42,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:42,964 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:42,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 68 [2022-03-15 21:49:43,082 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:43,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924042356] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:43,082 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:43,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-03-15 21:49:43,082 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [576876537] [2022-03-15 21:49:43,082 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:43,085 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:43,143 INFO L252 McrAutomatonBuilder]: Finished intersection with 269 states and 650 transitions. [2022-03-15 21:49:43,143 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:50,227 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [1601965#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) total)) (< q1_front q1_back)), 1601966#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 1601984#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1)))))), 1601967#(or (not (= (+ C (select q2 q2_back)) 0)) (< (+ q1_front 2) q1_back) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back (+ q1_front 1))), 1601971#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) total (select q1 q1_front))) (<= q1_back q1_front)), 1601972#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) total (select q1 q1_front)))), 1601983#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))))), 1601962#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back q1_front)), 1601960#(or (<= 2 (+ (select q2 q2_front) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 1601977#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 1601975#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ C total (select q1 q1_front)))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 2) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 2))) (or (not (= (+ C (select q2 q2_back)) 0)) (= C (select q1 q1_front))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0))), 1601970#(or (<= 2 (+ (select q2 q2_front) total (select q1 q1_front))) (<= q1_back q1_front)), 1601978#(and (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 1601959#(or (<= 2 (+ (select q2 q2_front) total)) (< q1_front q1_back)), 1601968#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back q1_front)), 1601979#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1))) (or (not (= (+ C (select q2 q2_back)) 0)) (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back))), 1601976#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 1601973#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 1601981#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 1601964#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) total))), 1601969#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= q1_back (+ q1_front 1)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 1601958#(or (< q1_front q1_back) (<= 2 total)), 1601980#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 1601974#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ C total))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 1) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 1)))), 1601985#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))))), 1601961#(or (< (+ q1_front 2) q1_back) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back (+ q1_front 1))), 1601963#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= q1_back (+ q1_front 1)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 1601982#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))))] [2022-03-15 21:49:50,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 21:49:50,228 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:50,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 21:49:50,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=2955, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 21:49:50,229 INFO L87 Difference]: Start difference. First operand 36240 states and 165567 transitions. Second operand has 39 states, 38 states have (on average 5.078947368421052) internal successors, (193), 38 states have internal predecessors, (193), 0 states have call successors, (0), 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:49:53,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:53,923 INFO L93 Difference]: Finished difference Result 75367 states and 331555 transitions. [2022-03-15 21:49:53,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-03-15 21:49:53,923 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 5.078947368421052) internal successors, (193), 38 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:49:53,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:54,253 INFO L225 Difference]: With dead ends: 75367 [2022-03-15 21:49:54,254 INFO L226 Difference]: Without dead ends: 75282 [2022-03-15 21:49:54,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 220 SyntacticMatches, 29 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3380 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1104, Invalid=9816, Unknown=0, NotChecked=0, Total=10920 [2022-03-15 21:49:54,255 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 1323 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 3687 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 3968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 3687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:54,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1323 Valid, 492 Invalid, 3968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 3687 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 21:49:54,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75282 states. [2022-03-15 21:49:55,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75282 to 38665. [2022-03-15 21:49:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38665 states, 38664 states have (on average 4.566133871301469) internal successors, (176545), 38664 states have internal predecessors, (176545), 0 states have call successors, (0), 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:49:56,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38665 states to 38665 states and 176545 transitions. [2022-03-15 21:49:56,024 INFO L78 Accepts]: Start accepts. Automaton has 38665 states and 176545 transitions. Word has length 30 [2022-03-15 21:49:56,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:56,024 INFO L470 AbstractCegarLoop]: Abstraction has 38665 states and 176545 transitions. [2022-03-15 21:49:56,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 5.078947368421052) internal successors, (193), 38 states have internal predecessors, (193), 0 states have call successors, (0), 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:49:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 38665 states and 176545 transitions. [2022-03-15 21:49:56,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:49:56,292 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:56,292 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:56,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:56,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-03-15 21:49:56,501 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:49:56,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:56,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1154883399, now seen corresponding path program 18 times [2022-03-15 21:49:56,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:56,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23815582] [2022-03-15 21:49:56,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:56,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:56,667 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:56,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23815582] [2022-03-15 21:49:56,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23815582] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:56,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850834247] [2022-03-15 21:49:56,667 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:49:56,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:56,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:56,668 INFO L229 MonitoredProcess]: Starting monitored process 35 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:49:56,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 21:49:56,701 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 21:49:56,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:56,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:49:56,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:57,116 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 46 treesize of output 38 [2022-03-15 21:49:57,191 INFO L353 Elim1Store]: treesize reduction 14, result has 77.0 percent of original size [2022-03-15 21:49:57,191 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 74 [2022-03-15 21:49:57,289 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:57,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:57,647 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:57,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2022-03-15 21:49:58,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:49:58,169 INFO L353 Elim1Store]: treesize reduction 24, result has 75.3 percent of original size [2022-03-15 21:49:58,169 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 40 treesize of output 96 [2022-03-15 21:49:58,892 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:58,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850834247] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:58,893 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:58,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-03-15 21:49:58,893 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2131632250] [2022-03-15 21:49:58,893 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:58,895 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:58,946 INFO L252 McrAutomatonBuilder]: Finished intersection with 223 states and 507 transitions. [2022-03-15 21:49:58,946 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:03,258 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [1754997#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ C total))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 1) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 1)))), 1754988#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= (+ q1_back 2) q1_front)), 1754983#(or (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))), 1754991#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))), 1755002#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))))), 1755001#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 1754989#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))))), 1754986#(or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 1755000#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1)))))), 1754982#(or (<= 2 (+ total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 1754993#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< q1_front q1_back))), 1754981#(or (< q1_front q1_back) (<= 2 total)), 1754998#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ C total (select q1 q1_front)))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 2) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 2))) (or (not (= (+ C (select q2 q2_back)) 0)) (= C (select q1 q1_front))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0))), 1754995#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= (+ q1_back 2) q1_front)), 1754996#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 1754990#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) total (select q1 q1_front)))), 1754987#(and (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 1754994#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< q1_front (+ q1_back 1)))), 1754984#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= (+ q1_back 1) q1_front)), 1754985#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< q1_front q1_back))), 1754999#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1))) (or (not (= (+ C (select q2 q2_back)) 0)) (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back))), 1754992#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= (+ q1_back 1) q1_front))] [2022-03-15 21:50:03,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:50:03,258 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:03,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:50:03,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=2409, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 21:50:03,259 INFO L87 Difference]: Start difference. First operand 38665 states and 176545 transitions. Second operand has 33 states, 32 states have (on average 4.78125) internal successors, (153), 32 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:05,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:05,705 INFO L93 Difference]: Finished difference Result 54593 states and 242951 transitions. [2022-03-15 21:50:05,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 21:50:05,705 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.78125) internal successors, (153), 32 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:50:05,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:05,990 INFO L225 Difference]: With dead ends: 54593 [2022-03-15 21:50:05,990 INFO L226 Difference]: Without dead ends: 54541 [2022-03-15 21:50:05,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 175 SyntacticMatches, 34 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=478, Invalid=4924, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 21:50:05,991 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 528 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 3398 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 3498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 3398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:05,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [528 Valid, 422 Invalid, 3498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 3398 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 21:50:06,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54541 states. [2022-03-15 21:50:07,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54541 to 38843. [2022-03-15 21:50:07,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38843 states, 38842 states have (on average 4.565109932547243) internal successors, (177318), 38842 states have internal predecessors, (177318), 0 states have call successors, (0), 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:50:07,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38843 states to 38843 states and 177318 transitions. [2022-03-15 21:50:07,528 INFO L78 Accepts]: Start accepts. Automaton has 38843 states and 177318 transitions. Word has length 30 [2022-03-15 21:50:07,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:07,529 INFO L470 AbstractCegarLoop]: Abstraction has 38843 states and 177318 transitions. [2022-03-15 21:50:07,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.78125) internal successors, (153), 32 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:07,529 INFO L276 IsEmpty]: Start isEmpty. Operand 38843 states and 177318 transitions. [2022-03-15 21:50:07,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:50:07,625 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:07,625 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:07,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-15 21:50:07,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-15 21:50:07,840 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:50:07,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:07,840 INFO L85 PathProgramCache]: Analyzing trace with hash 702828291, now seen corresponding path program 19 times [2022-03-15 21:50:07,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:07,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195573902] [2022-03-15 21:50:07,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:07,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:07,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:07,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195573902] [2022-03-15 21:50:07,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195573902] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:07,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942408060] [2022-03-15 21:50:07,965 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:50:07,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:07,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:07,966 INFO L229 MonitoredProcess]: Starting monitored process 36 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:50:07,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 21:50:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:07,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:50:07,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:08,299 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 43 treesize of output 35 [2022-03-15 21:50:08,366 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:50:08,366 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 25 [2022-03-15 21:50:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:08,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:50:08,494 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:50:08,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-03-15 21:50:08,628 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:50:08,628 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 43 treesize of output 107 [2022-03-15 21:50:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:09,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942408060] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:50:09,098 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:50:09,102 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 21:50:09,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1052871177] [2022-03-15 21:50:09,103 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:50:09,105 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:50:09,152 INFO L252 McrAutomatonBuilder]: Finished intersection with 235 states and 545 transitions. [2022-03-15 21:50:09,152 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:14,943 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [1887532#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 1887531#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (<= q1_back q1_front)), 1887539#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< q1_front q1_back))), 1887540#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ C total (select q1 q1_front)))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 2) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 2))) (or (not (= (+ C (select q2 q2_back)) 0)) (= C (select q1 q1_front))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0))), 1887535#(or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 1887542#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< q1_front (+ q1_back 1)))), 1887533#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 1887544#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= (+ q1_back 2) q1_front)), 1887541#(and (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 1887543#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1))) (or (not (= (+ C (select q2 q2_back)) 0)) (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back))), 1887529#(or (<= 2 (+ total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 1887530#(or (< (+ q1_front 2) q1_back) (<= 2 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back (+ q1_front 1))), 1887537#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 1887538#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ C total))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 1) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 1)))), 1887547#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))))), 1887549#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))))), 1887536#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 1887546#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 1887528#(or (< q1_front q1_back) (<= 2 total)), 1887534#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< q1_front q1_back))), 1887545#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= (+ q1_back 2) q1_front)), 1887548#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))))] [2022-03-15 21:50:14,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:50:14,943 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:14,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:50:14,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=2159, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 21:50:14,944 INFO L87 Difference]: Start difference. First operand 38843 states and 177318 transitions. Second operand has 33 states, 32 states have (on average 4.90625) internal successors, (157), 32 states have internal predecessors, (157), 0 states have call successors, (0), 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:50:17,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:17,524 INFO L93 Difference]: Finished difference Result 60619 states and 269519 transitions. [2022-03-15 21:50:17,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 21:50:17,524 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.90625) internal successors, (157), 32 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:50:17,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:17,939 INFO L225 Difference]: With dead ends: 60619 [2022-03-15 21:50:17,940 INFO L226 Difference]: Without dead ends: 60521 [2022-03-15 21:50:17,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 186 SyntacticMatches, 37 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2585 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=727, Invalid=5753, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 21:50:17,940 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 721 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 2437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:17,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [721 Valid, 307 Invalid, 2437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 21:50:18,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60521 states. [2022-03-15 21:50:19,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60521 to 37901. [2022-03-15 21:50:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37901 states, 37900 states have (on average 4.564511873350924) internal successors, (172995), 37900 states have internal predecessors, (172995), 0 states have call successors, (0), 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:50:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37901 states to 37901 states and 172995 transitions. [2022-03-15 21:50:19,579 INFO L78 Accepts]: Start accepts. Automaton has 37901 states and 172995 transitions. Word has length 30 [2022-03-15 21:50:19,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:19,579 INFO L470 AbstractCegarLoop]: Abstraction has 37901 states and 172995 transitions. [2022-03-15 21:50:19,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.90625) internal successors, (157), 32 states have internal predecessors, (157), 0 states have call successors, (0), 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:50:19,579 INFO L276 IsEmpty]: Start isEmpty. Operand 37901 states and 172995 transitions. [2022-03-15 21:50:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:50:19,670 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:19,670 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:19,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-15 21:50:19,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 21:50:19,886 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:50:19,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:19,887 INFO L85 PathProgramCache]: Analyzing trace with hash -176947697, now seen corresponding path program 20 times [2022-03-15 21:50:19,887 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:19,887 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503969449] [2022-03-15 21:50:19,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:19,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:20,037 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:20,038 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:20,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503969449] [2022-03-15 21:50:20,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503969449] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:20,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805633305] [2022-03-15 21:50:20,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:50:20,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:20,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:20,039 INFO L229 MonitoredProcess]: Starting monitored process 37 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:50:20,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 21:50:20,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:50:20,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:50:20,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:50:20,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:20,288 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-15 21:50:20,386 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:50:20,386 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 25 [2022-03-15 21:50:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:20,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:50:20,530 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:50:20,530 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-03-15 21:50:20,663 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:50:20,664 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 109 [2022-03-15 21:50:21,368 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:21,368 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805633305] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:50:21,368 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:50:21,368 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 21:50:21,368 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1441699227] [2022-03-15 21:50:21,368 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:50:21,370 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:50:21,404 INFO L252 McrAutomatonBuilder]: Finished intersection with 177 states and 394 transitions. [2022-03-15 21:50:21,404 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:27,337 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [2024234#(and (or (<= 2 (+ C total (select q1 q1_front))) (not (< q1_front q1_back)) (not (= (select q1 (+ q1_front 1)) C))) (<= q1_back (+ q1_front 1))), 2024243#(or (< q2_front q2_back) (<= q1_back q1_front) (<= 1 (+ total (select q1 q1_front)))), 2024245#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ C total))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 1) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 1)))), 2024253#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ C total (select q1 q1_front)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1))) (or (not (= (+ C (select q2 q2_back)) 0)) (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back))), 2024242#(or (< (+ q1_front 1) q1_back) (< q2_front q2_back) (<= 1 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 2024251#(and (or (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1))) (or (not (= (select q1 q1_back) C)) (<= 2 (+ C total (select q1 q1_front))))), 2024244#(or (< q2_front q2_back) (<= 1 (+ total (select q1 q1_front)))), 2024255#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 2024240#(or (<= 1 total) (< q2_front q2_back)), 2024238#(or (< (+ q1_front 1) q1_back) (<= 1 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 2024247#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ C total (select q1 q1_front)))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 2) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 2))) (or (not (= (+ C (select q2 q2_back)) 0)) (= C (select q1 q1_front))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0))), 2024246#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 2) q1_back) (not (< q1_front q1_back))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 2))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (< q1_front q1_back))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (< q1_front q1_back))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ C total (select q1 q1_front))) (not (< q1_front q1_back)))), 2024236#(and (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= 2 (+ C total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 2024237#(or (<= 1 total) (< q1_front q1_back)), 2024235#(and (<= q1_back (+ q1_front 2)) (or (<= (+ q1_front 2) q1_back) (not (< q1_front q1_back))) (or (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (< q1_front q1_back))) (or (= (+ (select q2 q2_front) C) 0) (not (< q1_front q1_back))) (or (<= 2 (+ C total (select q1 q1_front))) (not (< q1_front q1_back)))), 2024248#(and (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ C total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 1))))), 2024254#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ C total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))))), 2024252#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= 2 (+ C total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1))))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))))), 2024256#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))))), 2024241#(or (<= 1 total) (< q1_front q1_back) (< q2_front q2_back)), 2024239#(or (<= q1_back q1_front) (<= 1 (+ total (select q1 q1_front)))), 2024250#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ C total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (<= (+ q1_back 2) q1_front)) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))))), 2024249#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= 2 (+ C total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (<= (+ q1_back 2) q1_front)))] [2022-03-15 21:50:27,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 21:50:27,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:27,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 21:50:27,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=2145, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 21:50:27,338 INFO L87 Difference]: Start difference. First operand 37901 states and 172995 transitions. Second operand has 34 states, 33 states have (on average 4.454545454545454) internal successors, (147), 33 states have internal predecessors, (147), 0 states have call successors, (0), 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:50:29,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:29,466 INFO L93 Difference]: Finished difference Result 53711 states and 239499 transitions. [2022-03-15 21:50:29,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 21:50:29,467 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 4.454545454545454) internal successors, (147), 33 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:50:29,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:29,714 INFO L225 Difference]: With dead ends: 53711 [2022-03-15 21:50:29,714 INFO L226 Difference]: Without dead ends: 53673 [2022-03-15 21:50:29,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 147 SyntacticMatches, 18 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=753, Invalid=4649, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 21:50:29,715 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 566 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 2050 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 2050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:29,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [566 Valid, 268 Invalid, 2259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 2050 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:50:29,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53673 states. [2022-03-15 21:50:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53673 to 37881. [2022-03-15 21:50:30,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37881 states, 37880 states have (on average 4.565549102428722) internal successors, (172943), 37880 states have internal predecessors, (172943), 0 states have call successors, (0), 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:50:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37881 states to 37881 states and 172943 transitions. [2022-03-15 21:50:31,194 INFO L78 Accepts]: Start accepts. Automaton has 37881 states and 172943 transitions. Word has length 30 [2022-03-15 21:50:31,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:31,194 INFO L470 AbstractCegarLoop]: Abstraction has 37881 states and 172943 transitions. [2022-03-15 21:50:31,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.454545454545454) internal successors, (147), 33 states have internal predecessors, (147), 0 states have call successors, (0), 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:50:31,194 INFO L276 IsEmpty]: Start isEmpty. Operand 37881 states and 172943 transitions. [2022-03-15 21:50:31,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:50:31,290 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:31,290 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:31,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-03-15 21:50:31,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:31,503 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:50:31,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:31,504 INFO L85 PathProgramCache]: Analyzing trace with hash 207068947, now seen corresponding path program 21 times [2022-03-15 21:50:31,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:31,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522082129] [2022-03-15 21:50:31,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:31,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:31,694 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:31,694 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:31,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522082129] [2022-03-15 21:50:31,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522082129] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:31,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449738378] [2022-03-15 21:50:31,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:50:31,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:31,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:31,695 INFO L229 MonitoredProcess]: Starting monitored process 38 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:50:31,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 21:50:31,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 21:50:31,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:50:31,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 21:50:31,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:31,920 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:50:32,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:50:32,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:50:32,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:50:32,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:50:32,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:50:32,084 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:50:32,084 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 85 [2022-03-15 21:50:32,284 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:32,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:50:32,720 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:50:32,721 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 26 treesize of output 30 [2022-03-15 21:50:32,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:50:32,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:50:32,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:50:32,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:50:32,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:50:32,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:50:32,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:50:32,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:50:32,929 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:50:32,929 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 53 [2022-03-15 21:50:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:33,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449738378] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:50:33,231 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:50:33,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-03-15 21:50:33,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2075238420] [2022-03-15 21:50:33,231 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:50:33,234 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:50:33,268 INFO L252 McrAutomatonBuilder]: Finished intersection with 181 states and 404 transitions. [2022-03-15 21:50:33,268 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:39,143 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [2153992#(and (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 2153914#(or (< (+ q1_front 1) q1_back) (<= 1 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 2153995#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q1 (+ q1_front 1)) C total (select q1 q1_front))) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 1)))))), 2153986#(or (< q2_front q2_back) (<= q1_back q1_front) (<= 1 (+ total (select q1 q1_front)))), 2153987#(and (or (<= 2 (+ C total (select q1 q1_front))) (not (< q1_front q1_back)) (not (= (select q1 (+ q1_front 1)) C))) (<= q1_back (+ q1_front 1))), 2153994#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back))), 2153989#(or (< q2_front q2_back) (<= 1 (+ total (select q1 q1_front)))), 2153998#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 2153996#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= 2 (+ (* 3 C) total)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))))), 2153990#(and (or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q1 (+ q1_front 1)) C total (select q1 q1_front))) (not (= C (select q1 (+ q1_front 2)))) (<= q1_back q1_front)) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 2153991#(and (or (not (= (select q1 q1_back) C)) (<= 2 (+ (* 3 C) total))) (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 2153983#(or (<= 1 total) (< q2_front q2_back)), 2153999#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1)))))), 2153997#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))))), 2153985#(or (< (+ q1_front 1) q1_back) (< q2_front q2_back) (<= 1 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 2153988#(and (or (<= 2 (+ (select q1 (+ q1_front 1)) C total (select q1 q1_front))) (not (= C (select q1 (+ q1_front 2)))) (not (< (+ q1_front 1) q1_back))) (<= q1_back (+ q1_front 2))), 2153907#(or (<= 1 total) (< q1_front q1_back)), 2153982#(or (<= q1_back q1_front) (<= 1 (+ total (select q1 q1_front)))), 2153984#(or (<= 1 total) (< q1_front q1_back) (< q2_front q2_back)), 2154000#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))))), 2153993#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (= (select q1 (+ q1_front 1)) C)) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 2) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 2))))] [2022-03-15 21:50:39,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 21:50:39,143 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:39,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 21:50:39,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=2077, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 21:50:39,144 INFO L87 Difference]: Start difference. First operand 37881 states and 172943 transitions. Second operand has 32 states, 31 states have (on average 4.387096774193548) internal successors, (136), 31 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:50:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:43,573 INFO L93 Difference]: Finished difference Result 69129 states and 306155 transitions. [2022-03-15 21:50:43,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-15 21:50:43,573 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.387096774193548) internal successors, (136), 31 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) Word has length 30 [2022-03-15 21:50:43,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:43,889 INFO L225 Difference]: With dead ends: 69129 [2022-03-15 21:50:43,889 INFO L226 Difference]: Without dead ends: 69091 [2022-03-15 21:50:43,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 146 SyntacticMatches, 24 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3036 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1321, Invalid=8981, Unknown=0, NotChecked=0, Total=10302 [2022-03-15 21:50:43,890 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 1040 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 2649 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 3032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 2649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:43,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1040 Valid, 380 Invalid, 3032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 2649 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 21:50:43,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69091 states. [2022-03-15 21:50:45,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69091 to 38507. [2022-03-15 21:50:45,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38507 states, 38506 states have (on average 4.574144289201683) internal successors, (176132), 38506 states have internal predecessors, (176132), 0 states have call successors, (0), 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:50:45,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38507 states to 38507 states and 176132 transitions. [2022-03-15 21:50:45,559 INFO L78 Accepts]: Start accepts. Automaton has 38507 states and 176132 transitions. Word has length 30 [2022-03-15 21:50:45,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:45,560 INFO L470 AbstractCegarLoop]: Abstraction has 38507 states and 176132 transitions. [2022-03-15 21:50:45,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.387096774193548) internal successors, (136), 31 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:50:45,560 INFO L276 IsEmpty]: Start isEmpty. Operand 38507 states and 176132 transitions. [2022-03-15 21:50:45,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:50:45,652 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:45,653 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:45,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 21:50:45,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 21:50:45,861 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:50:45,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:45,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1266784275, now seen corresponding path program 22 times [2022-03-15 21:50:45,862 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:45,862 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595058774] [2022-03-15 21:50:45,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:45,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:46,002 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:46,002 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595058774] [2022-03-15 21:50:46,002 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595058774] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:46,002 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812341555] [2022-03-15 21:50:46,002 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:50:46,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:46,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:46,003 INFO L229 MonitoredProcess]: Starting monitored process 39 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:50:46,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 21:50:46,031 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:50:46,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:50:46,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:50:46,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:46,416 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:50:46,549 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:50:46,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 25 [2022-03-15 21:50:46,564 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:46,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:50:46,702 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:50:46,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-03-15 21:50:46,838 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:50:46,838 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 43 treesize of output 107 [2022-03-15 21:50:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:47,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812341555] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:50:47,229 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:50:47,229 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 21:50:47,229 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [889074101] [2022-03-15 21:50:47,229 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:50:47,232 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:50:47,267 INFO L252 McrAutomatonBuilder]: Finished intersection with 181 states and 404 transitions. [2022-03-15 21:50:47,268 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:52,569 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [2300459#(or (<= 2 (+ total (select q1 q1_front))) (<= q1_back q1_front)), 2300468#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= 2 (+ (* 3 C) total)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))))), 2300460#(or (< q1_front q1_back) (< q2_front q2_back) (<= 2 total)), 2300463#(or (<= 2 (+ total (select q1 q1_front))) (< q2_front q2_back)), 2300455#(and (or (not (= (select q1 q1_back) C)) (<= 2 (+ (* 3 C) total))) (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 2300465#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (= (select q1 (+ q1_front 1)) C)) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 2) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 2)))), 2300461#(or (<= 2 (+ total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (< q2_front q2_back) (not (< q1_front q1_back))), 2300458#(or (<= 2 (+ total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 2300466#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back))), 2300471#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1)))))), 2300464#(or (<= 2 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< q2_front q2_back)), 2300456#(and (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 2300467#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (select q1 q1_front) (* 2 C))) (not (= C (select q1 (+ q1_back 1)))) (<= (+ q1_back 2) q1_front))), 2300462#(or (<= 2 (+ total (select q1 q1_front))) (< q2_front q2_back) (<= q1_back q1_front)), 2300452#(or (< q2_front q2_back) (<= 2 total)), 2300470#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 2300472#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))))), 2300453#(and (or (<= 2 (+ total (select q1 q1_front) (* 2 C))) (not (< q1_front q1_back))) (<= q1_back (+ q1_front 2)) (or (<= (+ q1_front 2) q1_back) (not (< q1_front q1_back))) (or (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (< q1_front q1_back)))), 2300469#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))))), 2300454#(and (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (select q1 q1_front) (* 2 C))) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 2300457#(or (< q1_front q1_back) (<= 2 total))] [2022-03-15 21:50:52,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 21:50:52,569 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:52,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 21:50:52,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2108, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 21:50:52,570 INFO L87 Difference]: Start difference. First operand 38507 states and 176132 transitions. Second operand has 32 states, 31 states have (on average 4.387096774193548) internal successors, (136), 31 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:50:55,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:55,670 INFO L93 Difference]: Finished difference Result 80807 states and 357310 transitions. [2022-03-15 21:50:55,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 21:50:55,670 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.387096774193548) internal successors, (136), 31 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) Word has length 30 [2022-03-15 21:50:55,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:56,047 INFO L225 Difference]: With dead ends: 80807 [2022-03-15 21:50:56,047 INFO L226 Difference]: Without dead ends: 80721 [2022-03-15 21:50:56,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 143 SyntacticMatches, 27 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2802 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1266, Invalid=8436, Unknown=0, NotChecked=0, Total=9702 [2022-03-15 21:50:56,048 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 994 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 2539 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 2842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 2539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:56,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [994 Valid, 411 Invalid, 2842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 2539 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 21:50:56,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80721 states. [2022-03-15 21:50:57,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80721 to 38219. [2022-03-15 21:50:57,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38219 states, 38218 states have (on average 4.570359516458214) internal successors, (174670), 38218 states have internal predecessors, (174670), 0 states have call successors, (0), 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:50:58,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38219 states to 38219 states and 174670 transitions. [2022-03-15 21:50:58,021 INFO L78 Accepts]: Start accepts. Automaton has 38219 states and 174670 transitions. Word has length 30 [2022-03-15 21:50:58,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:58,021 INFO L470 AbstractCegarLoop]: Abstraction has 38219 states and 174670 transitions. [2022-03-15 21:50:58,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.387096774193548) internal successors, (136), 31 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:50:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand 38219 states and 174670 transitions. [2022-03-15 21:50:58,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:50:58,120 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:58,120 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:58,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-03-15 21:50:58,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 21:50:58,335 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:50:58,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:58,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1632915759, now seen corresponding path program 16 times [2022-03-15 21:50:58,335 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:58,351 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573896544] [2022-03-15 21:50:58,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:58,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:58,481 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:58,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:58,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573896544] [2022-03-15 21:50:58,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573896544] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:58,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81218286] [2022-03-15 21:50:58,481 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:50:58,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:58,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:58,482 INFO L229 MonitoredProcess]: Starting monitored process 40 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:50:58,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 21:50:58,505 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:50:58,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:50:58,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:50:58,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:58,802 INFO L353 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-03-15 21:50:58,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 20 [2022-03-15 21:50:58,823 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:58,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:50:59,219 INFO L353 Elim1Store]: treesize reduction 156, result has 49.5 percent of original size [2022-03-15 21:50:59,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 52 treesize of output 176 [2022-03-15 21:51:00,332 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:00,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81218286] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:00,332 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:00,332 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 21:51:00,333 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2106047099] [2022-03-15 21:51:00,333 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:00,336 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:00,372 INFO L252 McrAutomatonBuilder]: Finished intersection with 171 states and 382 transitions. [2022-03-15 21:51:00,372 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:03,370 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [2458020#(or (<= 4 total) (< q1_front q1_back)), 2458031#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1))))) (or (<= 4 (+ total (* C 4))) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 2458022#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= 4 (+ total (select q1 q1_front)))), 2458024#(or (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))), 2458025#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front q1_back))), 2458023#(or (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 2458029#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 3)))) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))), 2458026#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= q1_back (+ q1_front 1))), 2458028#(and (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (<= 4 (+ total (* C 4))) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 2458021#(or (< (+ q1_front 1) q1_back) (<= 4 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 2458027#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 2)))) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))), 2458030#(or (<= 4 (+ total (select q1 q1_front))) (<= q1_back q1_front))] [2022-03-15 21:51:03,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:51:03,371 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:03,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:51:03,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1283, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 21:51:03,371 INFO L87 Difference]: Start difference. First operand 38219 states and 174670 transitions. Second operand has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 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:51:05,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:05,859 INFO L93 Difference]: Finished difference Result 71041 states and 313741 transitions. [2022-03-15 21:51:05,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 21:51:05,859 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:51:05,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:06,385 INFO L225 Difference]: With dead ends: 71041 [2022-03-15 21:51:06,385 INFO L226 Difference]: Without dead ends: 70998 [2022-03-15 21:51:06,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 148 SyntacticMatches, 21 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1399 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=607, Invalid=3553, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 21:51:06,386 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 625 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:06,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [625 Valid, 422 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 21:51:06,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70998 states. [2022-03-15 21:51:07,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70998 to 41393. [2022-03-15 21:51:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41393 states, 41392 states have (on average 4.572429454967144) internal successors, (189262), 41392 states have internal predecessors, (189262), 0 states have call successors, (0), 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:51:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41393 states to 41393 states and 189262 transitions. [2022-03-15 21:51:08,204 INFO L78 Accepts]: Start accepts. Automaton has 41393 states and 189262 transitions. Word has length 30 [2022-03-15 21:51:08,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:08,204 INFO L470 AbstractCegarLoop]: Abstraction has 41393 states and 189262 transitions. [2022-03-15 21:51:08,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 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:51:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand 41393 states and 189262 transitions. [2022-03-15 21:51:08,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:51:08,308 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:08,309 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:08,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 21:51:08,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:08,511 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:51:08,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:08,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1841816815, now seen corresponding path program 17 times [2022-03-15 21:51:08,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:08,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769888088] [2022-03-15 21:51:08,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:08,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:08,640 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:08,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769888088] [2022-03-15 21:51:08,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769888088] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:08,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360473891] [2022-03-15 21:51:08,640 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:51:08,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:08,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:08,641 INFO L229 MonitoredProcess]: Starting monitored process 41 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:51:08,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 21:51:08,670 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 21:51:08,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:08,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:51:08,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:09,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:09,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:09,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:09,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:09,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:09,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:09,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:09,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:09,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:09,055 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:51:09,056 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 46 treesize of output 144 [2022-03-15 21:51:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:09,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:10,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:10,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:10,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:10,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:10,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:10,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:10,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:10,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:10,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:10,145 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:51:10,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 49 treesize of output 89 [2022-03-15 21:51:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:10,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360473891] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:10,277 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:10,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-03-15 21:51:10,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [974688372] [2022-03-15 21:51:10,277 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:10,281 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:10,318 INFO L252 McrAutomatonBuilder]: Finished intersection with 171 states and 382 transitions. [2022-03-15 21:51:10,318 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:14,645 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [2612118#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front q1_back))), 2612121#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 3)))) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))), 2612123#(and (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (<= 4 (+ total (* C 4))) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 2612114#(or (< (+ q1_front 1) q1_back) (<= 4 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 2612124#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1))))) (or (<= 4 (+ total (* C 4))) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 2612122#(or (<= 4 (+ total (select q1 q1_front))) (<= q1_back q1_front)), 2612113#(or (<= 4 total) (< q1_front q1_back)), 2612120#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 2)))) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))), 2612116#(or (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q1_back q1_front)), 2612117#(or (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))), 2612119#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= q1_back (+ q1_front 1))), 2612115#(or (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 2) q1_back) (<= q1_back (+ q1_front 1)))] [2022-03-15 21:51:14,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:51:14,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:14,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:51:14,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1450, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 21:51:14,646 INFO L87 Difference]: Start difference. First operand 41393 states and 189262 transitions. Second operand has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 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:51:17,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:17,561 INFO L93 Difference]: Finished difference Result 70393 states and 310989 transitions. [2022-03-15 21:51:17,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 21:51:17,561 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:51:17,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:17,892 INFO L225 Difference]: With dead ends: 70393 [2022-03-15 21:51:17,892 INFO L226 Difference]: Without dead ends: 70316 [2022-03-15 21:51:17,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 143 SyntacticMatches, 24 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1587 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=668, Invalid=4162, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 21:51:17,894 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 570 mSDsluCounter, 1717 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 2433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:17,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [570 Valid, 602 Invalid, 2433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 21:51:17,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70316 states. [2022-03-15 21:51:19,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70316 to 42117. [2022-03-15 21:51:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42117 states, 42116 states have (on average 4.575149586855352) internal successors, (192687), 42116 states have internal predecessors, (192687), 0 states have call successors, (0), 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:51:19,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42117 states to 42117 states and 192687 transitions. [2022-03-15 21:51:19,624 INFO L78 Accepts]: Start accepts. Automaton has 42117 states and 192687 transitions. Word has length 30 [2022-03-15 21:51:19,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:19,624 INFO L470 AbstractCegarLoop]: Abstraction has 42117 states and 192687 transitions. [2022-03-15 21:51:19,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 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:51:19,624 INFO L276 IsEmpty]: Start isEmpty. Operand 42117 states and 192687 transitions. [2022-03-15 21:51:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:51:19,725 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:19,725 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:19,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-03-15 21:51:19,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-03-15 21:51:19,941 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:51:19,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:19,941 INFO L85 PathProgramCache]: Analyzing trace with hash -505671467, now seen corresponding path program 18 times [2022-03-15 21:51:19,942 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:19,967 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461237600] [2022-03-15 21:51:19,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:19,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:20,118 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:20,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461237600] [2022-03-15 21:51:20,118 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461237600] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:20,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83779204] [2022-03-15 21:51:20,118 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:51:20,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:20,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:20,119 INFO L229 MonitoredProcess]: Starting monitored process 42 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:51:20,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 21:51:20,148 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 21:51:20,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:20,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 21:51:20,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:20,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:20,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:20,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:20,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:20,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:20,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:20,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:20,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:20,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:20,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:20,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:20,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:20,719 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:51:20,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 52 [2022-03-15 21:51:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:20,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:21,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:21,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:21,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:21,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:21,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:21,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:21,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:21,299 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:21,299 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:21,299 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:21,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:21,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:21,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:21,355 INFO L353 Elim1Store]: treesize reduction 18, result has 80.2 percent of original size [2022-03-15 21:51:21,356 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 51 treesize of output 97 [2022-03-15 21:51:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:21,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83779204] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:21,667 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:21,667 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-03-15 21:51:21,667 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [465869985] [2022-03-15 21:51:21,667 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:21,671 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:21,703 INFO L252 McrAutomatonBuilder]: Finished intersection with 171 states and 382 transitions. [2022-03-15 21:51:21,703 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:24,987 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [2767017#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))), 2767018#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= q1_back (+ q1_front 1))), 2767019#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 2)))) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))), 2767023#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1))))) (or (<= 4 (+ total (* C 4))) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 2767013#(or (< (+ q1_front 1) q1_back) (<= 4 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 2767015#(or (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 2767016#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= q1_back (+ q1_front 1))), 2767022#(or (<= 4 (+ total (select q1 q1_front))) (<= q1_back q1_front)), 2767014#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= 4 (+ total (select q1 q1_front)))), 2767021#(and (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (<= 4 (+ total (* C 4))) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 2767012#(or (<= 4 total) (< q1_front q1_back)), 2767020#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 3)))) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))))] [2022-03-15 21:51:24,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:51:24,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:24,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:51:24,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1443, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 21:51:24,988 INFO L87 Difference]: Start difference. First operand 42117 states and 192687 transitions. Second operand has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 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:51:27,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:27,190 INFO L93 Difference]: Finished difference Result 80984 states and 358349 transitions. [2022-03-15 21:51:27,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 21:51:27,190 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:51:27,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:27,564 INFO L225 Difference]: With dead ends: 80984 [2022-03-15 21:51:27,564 INFO L226 Difference]: Without dead ends: 80941 [2022-03-15 21:51:27,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 146 SyntacticMatches, 21 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=630, Invalid=3926, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 21:51:27,565 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 627 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:27,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [627 Valid, 341 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:51:27,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80941 states. [2022-03-15 21:51:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80941 to 46601. [2022-03-15 21:51:29,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46601 states, 46600 states have (on average 4.5793562231759655) internal successors, (213398), 46600 states have internal predecessors, (213398), 0 states have call successors, (0), 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:51:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46601 states to 46601 states and 213398 transitions. [2022-03-15 21:51:29,776 INFO L78 Accepts]: Start accepts. Automaton has 46601 states and 213398 transitions. Word has length 30 [2022-03-15 21:51:29,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:29,776 INFO L470 AbstractCegarLoop]: Abstraction has 46601 states and 213398 transitions. [2022-03-15 21:51:29,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 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:51:29,776 INFO L276 IsEmpty]: Start isEmpty. Operand 46601 states and 213398 transitions. [2022-03-15 21:51:29,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:51:29,905 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:29,905 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:29,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-03-15 21:51:30,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:30,122 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:51:30,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:30,122 INFO L85 PathProgramCache]: Analyzing trace with hash -714572523, now seen corresponding path program 19 times [2022-03-15 21:51:30,123 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:30,123 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332382521] [2022-03-15 21:51:30,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:30,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:30,248 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:30,248 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:30,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332382521] [2022-03-15 21:51:30,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332382521] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:30,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218501839] [2022-03-15 21:51:30,248 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:51:30,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:30,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:30,249 INFO L229 MonitoredProcess]: Starting monitored process 43 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:51:30,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 21:51:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:30,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:51:30,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:30,594 INFO L353 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-03-15 21:51:30,594 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 20 [2022-03-15 21:51:30,619 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:30,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:30,963 INFO L353 Elim1Store]: treesize reduction 156, result has 49.5 percent of original size [2022-03-15 21:51:30,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 52 treesize of output 176 [2022-03-15 21:51:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:32,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218501839] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:32,217 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:32,217 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 21:51:32,217 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [483592118] [2022-03-15 21:51:32,217 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:32,220 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:32,249 INFO L252 McrAutomatonBuilder]: Finished intersection with 171 states and 382 transitions. [2022-03-15 21:51:32,250 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:35,400 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [2941463#(or (<= 1 total) (< q1_front q1_back)), 2941466#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (<= q1_back q1_front)), 2941467#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= q1_back (+ q1_front 1))), 2941471#(and (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (<= 4 (+ total (* C 4))) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 2941470#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (< (+ q1_front 1) q1_back) (not (= C (select q1 (+ q1_back 2)))) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))), 2941464#(or (< (+ q1_front 1) q1_back) (<= 1 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 2941468#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 2941469#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= 1 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= q1_back (+ q1_front 1))), 2941473#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 3)))) (<= 1 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))), 2941474#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1))))) (or (<= 4 (+ total (* C 4))) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 2941472#(or (<= q1_back q1_front) (<= 1 (+ total (select q1 q1_front)))), 2941465#(or (< (+ q1_front 2) q1_back) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back (+ q1_front 1)))] [2022-03-15 21:51:35,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:51:35,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:35,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:51:35,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1201, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 21:51:35,400 INFO L87 Difference]: Start difference. First operand 46601 states and 213398 transitions. Second operand has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 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:51:37,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:37,624 INFO L93 Difference]: Finished difference Result 86082 states and 380794 transitions. [2022-03-15 21:51:37,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 21:51:37,624 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:51:37,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:38,228 INFO L225 Difference]: With dead ends: 86082 [2022-03-15 21:51:38,228 INFO L226 Difference]: Without dead ends: 86021 [2022-03-15 21:51:38,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 148 SyntacticMatches, 22 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=689, Invalid=3471, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 21:51:38,228 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 672 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 2052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:38,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [672 Valid, 482 Invalid, 2052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1920 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 21:51:38,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86021 states. [2022-03-15 21:51:40,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86021 to 46630. [2022-03-15 21:51:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46630 states, 46629 states have (on average 4.579038795599305) internal successors, (213516), 46629 states have internal predecessors, (213516), 0 states have call successors, (0), 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:51:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46630 states to 46630 states and 213516 transitions. [2022-03-15 21:51:40,435 INFO L78 Accepts]: Start accepts. Automaton has 46630 states and 213516 transitions. Word has length 30 [2022-03-15 21:51:40,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:40,436 INFO L470 AbstractCegarLoop]: Abstraction has 46630 states and 213516 transitions. [2022-03-15 21:51:40,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 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:51:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 46630 states and 213516 transitions. [2022-03-15 21:51:40,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:51:40,804 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:40,804 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:40,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-03-15 21:51:41,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:41,020 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:51:41,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:41,020 INFO L85 PathProgramCache]: Analyzing trace with hash 394975573, now seen corresponding path program 20 times [2022-03-15 21:51:41,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:41,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980511785] [2022-03-15 21:51:41,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:41,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:41,134 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:41,134 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:41,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980511785] [2022-03-15 21:51:41,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980511785] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:41,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771847676] [2022-03-15 21:51:41,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:51:41,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:41,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:41,136 INFO L229 MonitoredProcess]: Starting monitored process 44 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:51:41,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 21:51:41,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:51:41,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:41,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:51:41,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:41,485 INFO L353 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-03-15 21:51:41,486 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 20 [2022-03-15 21:51:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:41,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:41,865 INFO L353 Elim1Store]: treesize reduction 156, result has 49.5 percent of original size [2022-03-15 21:51:41,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 52 treesize of output 176 [2022-03-15 21:51:43,450 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:43,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771847676] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:43,451 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:43,451 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 21:51:43,451 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [744318971] [2022-03-15 21:51:43,451 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:43,453 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:43,485 INFO L252 McrAutomatonBuilder]: Finished intersection with 171 states and 382 transitions. [2022-03-15 21:51:43,485 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:46,209 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [3121072#(or (< (+ q1_front 2) q1_back) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back (+ q1_front 1))), 3121076#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= 1 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= q1_back (+ q1_front 1))), 3121075#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 3121079#(and (or (not (= (select q1 q1_back) C)) (<= (+ q1_front 1) q1_back)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (<= 4 (+ total (* C 4))) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back (+ q1_front 1)))), 3121081#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= C (select q1 (+ q1_back 1))))) (or (<= 4 (+ total (* C 4))) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 3121073#(or (< (+ q1_front 3) q1_back) (<= q1_back (+ q1_front 2)) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 3121074#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= 1 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= q1_back (+ q1_front 1))), 3121070#(or (<= 1 total) (< q1_front q1_back)), 3121071#(or (< (+ q1_front 1) q1_back) (<= 1 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 3121080#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 3)))) (<= 1 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))), 3121077#(or (<= q1_back q1_front) (<= 1 (+ total (select q1 q1_front)))), 3121078#(or (not (= (select q1 q1_back) C)) (<= 1 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (< (+ q1_front 1) q1_back) (not (= C (select q1 (+ q1_back 2)))) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1)))))] [2022-03-15 21:51:46,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:51:46,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:46,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:51:46,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1206, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 21:51:46,210 INFO L87 Difference]: Start difference. First operand 46630 states and 213516 transitions. Second operand has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 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:51:48,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:48,522 INFO L93 Difference]: Finished difference Result 79628 states and 353890 transitions. [2022-03-15 21:51:48,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-15 21:51:48,523 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:51:48,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:49,129 INFO L225 Difference]: With dead ends: 79628 [2022-03-15 21:51:49,129 INFO L226 Difference]: Without dead ends: 79549 [2022-03-15 21:51:49,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 150 SyntacticMatches, 20 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1768 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=799, Invalid=4313, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 21:51:49,130 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 692 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 2176 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 2307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 2176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:49,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [692 Valid, 521 Invalid, 2307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 2176 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 21:51:49,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79549 states. [2022-03-15 21:51:50,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79549 to 46459. [2022-03-15 21:51:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46459 states, 46458 states have (on average 4.580395195660596) internal successors, (212796), 46458 states have internal predecessors, (212796), 0 states have call successors, (0), 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:51:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46459 states to 46459 states and 212796 transitions. [2022-03-15 21:51:50,924 INFO L78 Accepts]: Start accepts. Automaton has 46459 states and 212796 transitions. Word has length 30 [2022-03-15 21:51:50,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:50,924 INFO L470 AbstractCegarLoop]: Abstraction has 46459 states and 212796 transitions. [2022-03-15 21:51:50,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 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:51:50,924 INFO L276 IsEmpty]: Start isEmpty. Operand 46459 states and 212796 transitions. [2022-03-15 21:51:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:51:51,301 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:51,301 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:51,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-03-15 21:51:51,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-03-15 21:51:51,511 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:51:51,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:51,512 INFO L85 PathProgramCache]: Analyzing trace with hash 124167571, now seen corresponding path program 23 times [2022-03-15 21:51:51,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:51,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863698951] [2022-03-15 21:51:51,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:51,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:51,668 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:51,668 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:51,668 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863698951] [2022-03-15 21:51:51,668 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863698951] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:51,668 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275374196] [2022-03-15 21:51:51,669 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:51:51,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:51,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:51,670 INFO L229 MonitoredProcess]: Starting monitored process 45 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:51:51,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 21:51:51,698 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 21:51:51,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:51,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:51:51,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:52,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:52,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:52,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:52,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:52,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:52,033 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:51:52,033 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 87 [2022-03-15 21:51:52,440 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 17 treesize of output 13 [2022-03-15 21:51:52,450 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:52,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:52,764 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:51:52,764 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 27 treesize of output 31 [2022-03-15 21:51:53,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:53,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:53,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:53,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:53,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:53,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:53,199 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:51:53,200 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 50 [2022-03-15 21:51:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:53,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275374196] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:53,285 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:53,285 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-03-15 21:51:53,285 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1987495462] [2022-03-15 21:51:53,285 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:53,288 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:53,344 INFO L252 McrAutomatonBuilder]: Finished intersection with 259 states and 624 transitions. [2022-03-15 21:51:53,344 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:00,988 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [3293901#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) total (select q1 q1_front))) (< q1_front q1_back) (<= (+ q1_back 1) q1_front)), 3293903#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) total)) (< q1_front q1_back)), 3293923#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 3293900#(or (<= 2 (+ (select q2 q2_front) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 3293912#(and (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) total (select q1 q1_front)))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back q1_front)) (or (not (= (+ C (select q2 q2_back)) 0)) (< q1_front (+ q1_back 1))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= C (select q1 q1_front))))), 3293908#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))), 3293909#(or (<= 2 (+ (select q2 q2_front) total (select q1 q1_front))) (<= q1_back q1_front)), 3293913#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< q1_front q1_back))), 3293907#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))), 3293902#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) total))), 3293915#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))), 3293918#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ C total))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 1) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 1)))), 3293917#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 3293921#(and (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 3293914#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 3293910#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) total (select q1 q1_front))) (<= q1_back q1_front)), 3293899#(or (<= 2 (+ (select q2 q2_front) total)) (< q1_front q1_back)), 3293904#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 3293919#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_front q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back q1_front)) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ C total)))), 3293922#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 3293905#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) total (select q1 q1_front))) (< q1_front q1_back) (<= (+ q1_back 1) q1_front)), 3293916#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< q1_front q1_back))), 3293911#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) total (select q1 q1_front)))), 3293906#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))), 3293920#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 1) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (= C (select q1 q1_front))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 1)))), 3293898#(or (< q1_front q1_back) (<= 2 total))] [2022-03-15 21:52:00,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 21:52:00,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:00,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 21:52:00,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=2708, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 21:52:00,989 INFO L87 Difference]: Start difference. First operand 46459 states and 212796 transitions. Second operand has 37 states, 36 states have (on average 5.111111111111111) internal successors, (184), 36 states have internal predecessors, (184), 0 states have call successors, (0), 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:52:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:05,101 INFO L93 Difference]: Finished difference Result 74889 states and 332254 transitions. [2022-03-15 21:52:05,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 21:52:05,102 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 5.111111111111111) internal successors, (184), 36 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:52:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:05,464 INFO L225 Difference]: With dead ends: 74889 [2022-03-15 21:52:05,464 INFO L226 Difference]: Without dead ends: 74834 [2022-03-15 21:52:05,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 197 SyntacticMatches, 44 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3312 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1037, Invalid=7519, Unknown=0, NotChecked=0, Total=8556 [2022-03-15 21:52:05,465 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 906 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 3990 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 4210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 3990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:05,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [906 Valid, 520 Invalid, 4210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 3990 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 21:52:05,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74834 states. [2022-03-15 21:52:07,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74834 to 46851. [2022-03-15 21:52:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46851 states, 46850 states have (on average 4.57948772678762) internal successors, (214549), 46850 states have internal predecessors, (214549), 0 states have call successors, (0), 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:52:07,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46851 states to 46851 states and 214549 transitions. [2022-03-15 21:52:07,544 INFO L78 Accepts]: Start accepts. Automaton has 46851 states and 214549 transitions. Word has length 30 [2022-03-15 21:52:07,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:07,544 INFO L470 AbstractCegarLoop]: Abstraction has 46851 states and 214549 transitions. [2022-03-15 21:52:07,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 5.111111111111111) internal successors, (184), 36 states have internal predecessors, (184), 0 states have call successors, (0), 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:52:07,544 INFO L276 IsEmpty]: Start isEmpty. Operand 46851 states and 214549 transitions. [2022-03-15 21:52:07,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:52:07,663 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:07,663 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:07,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:07,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-15 21:52:07,894 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:52:07,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:07,895 INFO L85 PathProgramCache]: Analyzing trace with hash 315058119, now seen corresponding path program 24 times [2022-03-15 21:52:07,896 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:07,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401422395] [2022-03-15 21:52:07,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:07,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:08,034 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:08,035 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:08,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401422395] [2022-03-15 21:52:08,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401422395] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:08,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261854384] [2022-03-15 21:52:08,035 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:52:08,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:08,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:08,036 INFO L229 MonitoredProcess]: Starting monitored process 46 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:52:08,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-15 21:52:08,065 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 21:52:08,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:08,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 21:52:08,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:08,696 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 48 treesize of output 40 [2022-03-15 21:52:08,734 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:52:08,735 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 25 [2022-03-15 21:52:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:08,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:08,888 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:52:08,888 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2022-03-15 21:52:08,973 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:52:08,974 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 44 treesize of output 108 [2022-03-15 21:52:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:09,233 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261854384] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:09,233 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:09,233 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 21:52:09,233 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [714858548] [2022-03-15 21:52:09,233 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:09,261 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:09,315 INFO L252 McrAutomatonBuilder]: Finished intersection with 221 states and 501 transitions. [2022-03-15 21:52:09,315 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:13,563 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [3462791#(or (< q1_front q1_back) (<= 2 total)), 3462795#(or (not (= (select q1 q1_back) C)) (<= 2 (+ total (select q1 q1_front)))), 3462805#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< q1_front q1_back))), 3462793#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) total (select q1 q1_front)))), 3462807#(and (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) total (select q1 q1_front)))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back q1_front)) (or (not (= (+ C (select q2 q2_back)) 0)) (< q1_front (+ q1_back 1))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= C (select q1 q1_front))))), 3462803#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))), 3462802#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) total (select q1 q1_front)))), 3462798#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))), 3462800#(or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 3462792#(or (<= 2 (+ total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 3462801#(and (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 3462799#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< q1_front q1_back))), 3462797#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))), 3462810#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 1) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (= C (select q1 q1_front))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 1)))), 3462804#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))), 3462796#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) total (select q1 q1_front)))), 3462806#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 3462794#(or (not (= (select q1 q1_back) C)) (<= 2 (+ total (select q1 q1_front))) (< q1_front q1_back) (<= (+ q1_back 1) q1_front)), 3462811#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 3462809#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_front q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back q1_front)) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ C total)))), 3462808#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ C total))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 1) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 1)))), 3462812#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front)))] [2022-03-15 21:52:13,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:52:13,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:13,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:52:13,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=2147, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 21:52:13,564 INFO L87 Difference]: Start difference. First operand 46851 states and 214549 transitions. Second operand has 33 states, 32 states have (on average 4.8125) internal successors, (154), 32 states have internal predecessors, (154), 0 states have call successors, (0), 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:52:16,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:16,103 INFO L93 Difference]: Finished difference Result 64818 states and 290030 transitions. [2022-03-15 21:52:16,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 21:52:16,104 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.8125) internal successors, (154), 32 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:52:16,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:16,411 INFO L225 Difference]: With dead ends: 64818 [2022-03-15 21:52:16,411 INFO L226 Difference]: Without dead ends: 64752 [2022-03-15 21:52:16,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 182 SyntacticMatches, 27 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2259 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=729, Invalid=5913, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 21:52:16,412 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 565 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 2904 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 3041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 2904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:16,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 364 Invalid, 3041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 2904 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 21:52:16,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64752 states. [2022-03-15 21:52:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64752 to 46717. [2022-03-15 21:52:17,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46717 states, 46716 states have (on average 4.582669749122356) internal successors, (214084), 46716 states have internal predecessors, (214084), 0 states have call successors, (0), 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:52:18,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46717 states to 46717 states and 214084 transitions. [2022-03-15 21:52:18,229 INFO L78 Accepts]: Start accepts. Automaton has 46717 states and 214084 transitions. Word has length 30 [2022-03-15 21:52:18,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:18,229 INFO L470 AbstractCegarLoop]: Abstraction has 46717 states and 214084 transitions. [2022-03-15 21:52:18,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.8125) internal successors, (154), 32 states have internal predecessors, (154), 0 states have call successors, (0), 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:52:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 46717 states and 214084 transitions. [2022-03-15 21:52:18,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:52:18,339 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:18,339 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:18,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:18,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-03-15 21:52:18,555 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:52:18,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:18,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1247998419, now seen corresponding path program 25 times [2022-03-15 21:52:18,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:18,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131419207] [2022-03-15 21:52:18,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:18,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:18,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:18,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131419207] [2022-03-15 21:52:18,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131419207] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:18,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688574167] [2022-03-15 21:52:18,705 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:52:18,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:18,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:18,712 INFO L229 MonitoredProcess]: Starting monitored process 47 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:52:18,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-15 21:52:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:18,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:52:18,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:19,037 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:52:19,038 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 37 [2022-03-15 21:52:19,094 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 17 treesize of output 13 [2022-03-15 21:52:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:19,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:19,273 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:52:19,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-03-15 21:52:19,384 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:52:19,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 42 treesize of output 106 [2022-03-15 21:52:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:20,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688574167] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:20,012 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:20,012 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 21:52:20,013 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1636449251] [2022-03-15 21:52:20,013 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:20,015 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:20,072 INFO L252 McrAutomatonBuilder]: Finished intersection with 259 states and 624 transitions. [2022-03-15 21:52:20,073 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:26,736 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [3621355#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 3621343#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))), 3621339#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) total)) (< q1_front q1_back)), 3621333#(or (<= 2 (+ (select q2 q2_front) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 3621345#(or (<= 2 (+ (select q2 q2_front) total (select q1 q1_front))) (<= q1_back q1_front)), 3621352#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 3621353#(and (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 3621349#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ C total))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 1) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (= C (select q1 q1_front))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 1)))), 3621341#(or (not (= (+ C (select q2 q2_back)) 0)) (< (+ q1_front 2) q1_back) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back (+ q1_front 1))), 3621346#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) total (select q1 q1_front))) (<= q1_back q1_front)), 3621338#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) total))), 3621337#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< q1_front q1_back))), 3621334#(or (< (+ q1_front 2) q1_back) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back (+ q1_front 1))), 3621336#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))), 3621354#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 3621342#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back q1_front)), 3621348#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 3621335#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back q1_front)), 3621351#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 1) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 1)))), 3621344#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< q1_front q1_back))), 3621331#(or (< q1_front q1_back) (<= 2 total)), 3621332#(or (<= 2 (+ (select q2 q2_front) total)) (< q1_front q1_back)), 3621347#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) total (select q1 q1_front)))), 3621340#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 3621356#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 3621350#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back q1_front)) (or (not (= (+ C (select q2 q2_back)) 0)) (< q1_front (+ q1_back 1))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= C (select q1 q1_front)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= C (select q1 q1_front))) (<= 2 (+ C total))))] [2022-03-15 21:52:26,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 21:52:26,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:26,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 21:52:26,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=2492, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 21:52:26,737 INFO L87 Difference]: Start difference. First operand 46717 states and 214084 transitions. Second operand has 37 states, 36 states have (on average 5.111111111111111) internal successors, (184), 36 states have internal predecessors, (184), 0 states have call successors, (0), 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:52:30,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:30,121 INFO L93 Difference]: Finished difference Result 81219 states and 360908 transitions. [2022-03-15 21:52:30,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-15 21:52:30,122 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 5.111111111111111) internal successors, (184), 36 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:52:30,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:30,559 INFO L225 Difference]: With dead ends: 81219 [2022-03-15 21:52:30,560 INFO L226 Difference]: Without dead ends: 81134 [2022-03-15 21:52:30,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 196 SyntacticMatches, 47 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3399 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1046, Invalid=8656, Unknown=0, NotChecked=0, Total=9702 [2022-03-15 21:52:30,560 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 1220 mSDsluCounter, 1907 mSDsCounter, 0 mSdLazyCounter, 3765 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 4018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 3765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:30,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1220 Valid, 510 Invalid, 4018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 3765 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 21:52:30,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81134 states. [2022-03-15 21:52:32,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81134 to 49691. [2022-03-15 21:52:32,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49691 states, 49690 states have (on average 4.596478164620648) internal successors, (228399), 49690 states have internal predecessors, (228399), 0 states have call successors, (0), 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:52:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49691 states to 49691 states and 228399 transitions. [2022-03-15 21:52:32,942 INFO L78 Accepts]: Start accepts. Automaton has 49691 states and 228399 transitions. Word has length 30 [2022-03-15 21:52:32,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:32,942 INFO L470 AbstractCegarLoop]: Abstraction has 49691 states and 228399 transitions. [2022-03-15 21:52:32,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 5.111111111111111) internal successors, (184), 36 states have internal predecessors, (184), 0 states have call successors, (0), 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:52:32,942 INFO L276 IsEmpty]: Start isEmpty. Operand 49691 states and 228399 transitions. [2022-03-15 21:52:33,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:52:33,142 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:33,142 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:33,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:33,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:33,355 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:52:33,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:33,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1438888967, now seen corresponding path program 26 times [2022-03-15 21:52:33,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:33,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342061714] [2022-03-15 21:52:33,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:33,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:33,481 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:33,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:33,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342061714] [2022-03-15 21:52:33,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342061714] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:33,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988542039] [2022-03-15 21:52:33,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:52:33,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:33,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:33,490 INFO L229 MonitoredProcess]: Starting monitored process 48 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:52:33,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-15 21:52:33,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:52:33,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:33,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:52:33,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:33,930 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 48 treesize of output 40 [2022-03-15 21:52:33,968 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:52:33,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 25 [2022-03-15 21:52:33,983 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:33,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:34,169 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:52:34,169 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-03-15 21:52:34,296 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:52:34,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 42 treesize of output 106 [2022-03-15 21:52:34,758 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:34,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988542039] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:34,758 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:34,758 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 21:52:34,758 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [836079533] [2022-03-15 21:52:34,758 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:34,761 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:34,979 INFO L252 McrAutomatonBuilder]: Finished intersection with 213 states and 481 transitions. [2022-03-15 21:52:34,979 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:40,240 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [3802266#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 3802265#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 1) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 1)))), 3802252#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) total (select q1 q1_front)))), 3802269#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 3802255#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (<= (+ q1_back 2) q1_front)), 3802258#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))), 3802263#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ C total))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 1) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (= C (select q1 q1_front))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 1)))), 3802267#(and (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 3802257#(or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 3802268#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 3802262#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 3802253#(or (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))), 3802259#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= (+ q1_back 1) q1_front)), 3802250#(or (< q1_front q1_back) (<= 2 total)), 3802261#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< q1_front q1_back))), 3802251#(or (<= 2 (+ total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 3802264#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back q1_front)) (or (not (= (+ C (select q2 q2_back)) 0)) (< q1_front (+ q1_back 1))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= C (select q1 q1_front)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= C (select q1 q1_front))) (<= 2 (+ C total)))), 3802260#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (<= (+ q1_back 2) q1_front)), 3802256#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< q1_front q1_back))), 3802254#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= (+ q1_back 1) q1_front))] [2022-03-15 21:52:40,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 21:52:40,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:40,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 21:52:40,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1990, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 21:52:40,241 INFO L87 Difference]: Start difference. First operand 49691 states and 228399 transitions. Second operand has 31 states, 30 states have (on average 4.8) internal successors, (144), 30 states have internal predecessors, (144), 0 states have call successors, (0), 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:52:42,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:42,533 INFO L93 Difference]: Finished difference Result 66728 states and 299400 transitions. [2022-03-15 21:52:42,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 21:52:42,533 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.8) internal successors, (144), 30 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:52:42,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:42,833 INFO L225 Difference]: With dead ends: 66728 [2022-03-15 21:52:42,833 INFO L226 Difference]: Without dead ends: 66634 [2022-03-15 21:52:42,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 175 SyntacticMatches, 28 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1654 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=454, Invalid=3836, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 21:52:42,833 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 451 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 2759 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 2853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:42,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [451 Valid, 346 Invalid, 2853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2759 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 21:52:42,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66634 states. [2022-03-15 21:52:44,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66634 to 49663. [2022-03-15 21:52:44,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49663 states, 49662 states have (on average 4.600841689823205) internal successors, (228487), 49662 states have internal predecessors, (228487), 0 states have call successors, (0), 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:52:44,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49663 states to 49663 states and 228487 transitions. [2022-03-15 21:52:44,728 INFO L78 Accepts]: Start accepts. Automaton has 49663 states and 228487 transitions. Word has length 30 [2022-03-15 21:52:44,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:44,728 INFO L470 AbstractCegarLoop]: Abstraction has 49663 states and 228487 transitions. [2022-03-15 21:52:44,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.8) internal successors, (144), 30 states have internal predecessors, (144), 0 states have call successors, (0), 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:52:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 49663 states and 228487 transitions. [2022-03-15 21:52:44,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:52:44,840 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:44,840 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:44,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:45,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-03-15 21:52:45,055 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:52:45,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:45,056 INFO L85 PathProgramCache]: Analyzing trace with hash 986833859, now seen corresponding path program 27 times [2022-03-15 21:52:45,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:45,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484939038] [2022-03-15 21:52:45,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:45,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:45,200 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:45,200 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:45,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484939038] [2022-03-15 21:52:45,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484939038] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:45,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585917951] [2022-03-15 21:52:45,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:52:45,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:45,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:45,202 INFO L229 MonitoredProcess]: Starting monitored process 49 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:52:45,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-15 21:52:45,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:52:45,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:45,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:52:45,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:45,582 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2022-03-15 21:52:45,717 INFO L353 Elim1Store]: treesize reduction 14, result has 77.0 percent of original size [2022-03-15 21:52:45,718 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 74 [2022-03-15 21:52:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:46,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:46,481 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:52:46,481 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 27 treesize of output 31 [2022-03-15 21:52:46,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:52:46,763 INFO L353 Elim1Store]: treesize reduction 24, result has 75.3 percent of original size [2022-03-15 21:52:46,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 40 treesize of output 96 [2022-03-15 21:52:46,919 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:46,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585917951] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:46,919 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:46,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-03-15 21:52:46,920 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [596119663] [2022-03-15 21:52:46,920 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:46,922 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:46,970 INFO L252 McrAutomatonBuilder]: Finished intersection with 233 states and 539 transitions. [2022-03-15 21:52:46,970 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:51,168 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [3968573#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< q1_front q1_back))), 3968576#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1))))), 3968567#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (<= q1_back q1_front)), 3968572#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1))))), 3968568#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 3968571#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1))))), 3968580#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 1) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 1)))), 3968564#(or (< q1_front q1_back) (<= 2 total)), 3968566#(or (< (+ q1_front 2) q1_back) (<= 2 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back (+ q1_front 1))), 3968569#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 3968577#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< q1_front q1_back))), 3968583#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 3968575#(or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 3968581#(or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))))), 3968585#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 3968565#(or (<= 2 (+ total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 3968578#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ C total))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 1) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (= C (select q1 q1_front))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 1)))), 3968574#(or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))), 3968579#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back q1_front)) (or (not (= (+ C (select q2 q2_back)) 0)) (< q1_front (+ q1_back 1))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= C (select q1 q1_front)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= C (select q1 q1_front))) (<= 2 (+ C total)))), 3968582#(and (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 3968584#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 3968570#(or (not (= (select q1 q1_back) C)) (<= 2 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))))] [2022-03-15 21:52:51,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:52:51,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:51,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:52:51,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2344, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 21:52:51,169 INFO L87 Difference]: Start difference. First operand 49663 states and 228487 transitions. Second operand has 33 states, 32 states have (on average 4.875) internal successors, (156), 32 states have internal predecessors, (156), 0 states have call successors, (0), 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:52:53,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:53,932 INFO L93 Difference]: Finished difference Result 77375 states and 347495 transitions. [2022-03-15 21:52:53,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 21:52:53,933 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.875) internal successors, (156), 32 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:52:53,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:54,508 INFO L225 Difference]: With dead ends: 77375 [2022-03-15 21:52:54,508 INFO L226 Difference]: Without dead ends: 77291 [2022-03-15 21:52:54,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 188 SyntacticMatches, 31 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2444 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=836, Invalid=6820, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 21:52:54,509 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 650 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 2659 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 2798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 2659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:54,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [650 Valid, 395 Invalid, 2798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 2659 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 21:52:54,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77291 states. [2022-03-15 21:52:55,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77291 to 49115. [2022-03-15 21:52:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49115 states, 49114 states have (on average 4.603616076882355) internal successors, (226102), 49114 states have internal predecessors, (226102), 0 states have call successors, (0), 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:52:56,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49115 states to 49115 states and 226102 transitions. [2022-03-15 21:52:56,531 INFO L78 Accepts]: Start accepts. Automaton has 49115 states and 226102 transitions. Word has length 30 [2022-03-15 21:52:56,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:56,531 INFO L470 AbstractCegarLoop]: Abstraction has 49115 states and 226102 transitions. [2022-03-15 21:52:56,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.875) internal successors, (156), 32 states have internal predecessors, (156), 0 states have call successors, (0), 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:52:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 49115 states and 226102 transitions. [2022-03-15 21:52:56,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:52:56,663 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:56,663 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:56,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:56,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-03-15 21:52:56,867 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:52:56,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:56,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1678191661, now seen corresponding path program 28 times [2022-03-15 21:52:56,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:56,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358411410] [2022-03-15 21:52:56,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:56,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:57,005 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:57,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358411410] [2022-03-15 21:52:57,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358411410] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:57,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065292504] [2022-03-15 21:52:57,006 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:52:57,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:57,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:57,007 INFO L229 MonitoredProcess]: Starting monitored process 50 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:52:57,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-15 21:52:57,042 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:52:57,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:57,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:52:57,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:57,212 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:52:57,385 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:52:57,385 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 25 [2022-03-15 21:52:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:57,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:57,625 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:52:57,625 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-03-15 21:52:57,752 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:52:57,753 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 42 treesize of output 106 [2022-03-15 21:52:58,351 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:58,351 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065292504] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:58,351 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:58,351 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 21:52:58,352 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [479963131] [2022-03-15 21:52:58,352 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:58,354 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:58,382 INFO L252 McrAutomatonBuilder]: Finished intersection with 151 states and 328 transitions. [2022-03-15 21:52:58,382 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:01,615 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [4144474#(and (or (< q2_front q2_back) (< q1_front (+ q1_back 1))) (or (< q2_front q2_back) (<= q1_back q1_front)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (select q1 q1_front))) (< q2_front q2_back))), 4144481#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 4144480#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 4144479#(and (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 4144469#(or (< q2_front q2_back) (<= 2 total)), 4144472#(or (<= 2 (+ total (select q1 q1_front))) (< q2_front q2_back) (<= q1_back q1_front)), 4144477#(and (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (select q1 q1_front) (* 2 C))) (<= (+ q1_back 1) q1_front) (not (= (select q1 (+ q1_front 1)) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 4144471#(or (<= 2 (+ total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (< q2_front q2_back) (not (< q1_front q1_back))), 4144476#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 1) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 1)))), 4144467#(or (<= 2 (+ total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 4144468#(or (<= 2 (+ total (select q1 q1_front))) (<= q1_back q1_front)), 4144473#(or (<= 2 (+ total (select q1 q1_front))) (< q2_front q2_back)), 4144465#(and (or (<= 2 (+ total (select q1 q1_front) (* 2 C))) (not (< q1_front q1_back)) (not (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0))) (<= q1_back (+ q1_front 1))), 4144478#(and (or (not (= (select q1 q1_back) C)) (<= 2 (+ (* 3 C) total))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 4144475#(and (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (< q2_front q2_back)) (or (< q2_front q2_back) (<= (+ q1_front 1) q1_back)) (or (< q2_front q2_back) (<= 2 (+ total (* 2 C)))) (or (< q2_front q2_back) (<= q1_back (+ q1_front 1)))), 4144466#(or (< q1_front q1_back) (<= 2 total)), 4144470#(or (< q1_front q1_back) (< q2_front q2_back) (<= 2 total))] [2022-03-15 21:53:01,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 21:53:01,615 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:01,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 21:53:01,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1731, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 21:53:01,615 INFO L87 Difference]: Start difference. First operand 49115 states and 226102 transitions. Second operand has 28 states, 27 states have (on average 4.333333333333333) internal successors, (117), 27 states have internal predecessors, (117), 0 states have call successors, (0), 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:53:03,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:03,962 INFO L93 Difference]: Finished difference Result 96031 states and 427229 transitions. [2022-03-15 21:53:03,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 21:53:03,962 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.333333333333333) internal successors, (117), 27 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:53:03,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:04,421 INFO L225 Difference]: With dead ends: 96031 [2022-03-15 21:53:04,422 INFO L226 Difference]: Without dead ends: 95977 [2022-03-15 21:53:04,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 119 SyntacticMatches, 25 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1738 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=720, Invalid=4536, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 21:53:04,422 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 610 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 2033 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 2033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:04,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [610 Valid, 296 Invalid, 2244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 2033 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 21:53:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95977 states. [2022-03-15 21:53:06,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95977 to 56977. [2022-03-15 21:53:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56977 states, 56976 states have (on average 4.573855658522887) internal successors, (260600), 56976 states have internal predecessors, (260600), 0 states have call successors, (0), 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:53:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56977 states to 56977 states and 260600 transitions. [2022-03-15 21:53:07,138 INFO L78 Accepts]: Start accepts. Automaton has 56977 states and 260600 transitions. Word has length 30 [2022-03-15 21:53:07,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:07,140 INFO L470 AbstractCegarLoop]: Abstraction has 56977 states and 260600 transitions. [2022-03-15 21:53:07,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.333333333333333) internal successors, (117), 27 states have internal predecessors, (117), 0 states have call successors, (0), 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:53:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 56977 states and 260600 transitions. [2022-03-15 21:53:07,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:53:07,368 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:07,368 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:07,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-15 21:53:07,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:07,584 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:53:07,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:07,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1271705581, now seen corresponding path program 29 times [2022-03-15 21:53:07,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:07,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206733408] [2022-03-15 21:53:07,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:07,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:07,743 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:07,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206733408] [2022-03-15 21:53:07,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206733408] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:07,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475482018] [2022-03-15 21:53:07,743 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:53:07,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:07,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:07,776 INFO L229 MonitoredProcess]: Starting monitored process 51 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:53:07,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-03-15 21:53:07,839 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:53:07,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:07,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:53:07,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:08,025 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:53:08,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:08,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:08,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:08,193 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:53:08,194 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 26 treesize of output 44 [2022-03-15 21:53:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:08,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:08,834 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:53:08,834 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 27 treesize of output 31 [2022-03-15 21:53:09,112 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:09,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:09,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:09,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:09,130 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:53:09,130 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 68 [2022-03-15 21:53:09,349 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:09,350 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475482018] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:09,350 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:09,350 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-03-15 21:53:09,350 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1300729976] [2022-03-15 21:53:09,350 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:09,352 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:09,502 INFO L252 McrAutomatonBuilder]: Finished intersection with 151 states and 328 transitions. [2022-03-15 21:53:09,502 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:12,158 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [4354737#(and (or (= C (select q1 q1_front)) (< q2_front q2_back)) (or (< q2_front q2_back) (<= (+ q1_front 1) q1_back)) (or (< q2_front q2_back) (<= 2 (+ total (* 2 C)))) (or (< q2_front q2_back) (<= q1_back (+ q1_front 1)))), 4354727#(and (or (<= 2 (+ total (select q1 q1_front) (* 2 C))) (not (< q1_front q1_back)) (not (= (select q1 (+ q1_front 1)) C))) (<= q1_back (+ q1_front 1))), 4354733#(or (<= 2 (+ total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (< q2_front q2_back) (not (< q1_front q1_back))), 4354735#(or (<= 2 (+ total (select q1 q1_front))) (< q2_front q2_back)), 4354730#(or (<= 2 (+ total (select q1 q1_front))) (<= q1_back q1_front)), 4354742#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 4354734#(or (<= 2 (+ total (select q1 q1_front))) (< q2_front q2_back) (<= q1_back q1_front)), 4354743#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 4354728#(or (< q1_front q1_back) (<= 2 total)), 4354736#(or (<= 2 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< q2_front q2_back)), 4354731#(or (< q2_front q2_back) (<= 2 total)), 4354741#(and (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (select q2 q2_front) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ q1_front 1) q1_back)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 2 (+ total (* 2 C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q1_back (+ q1_front 1)))), 4354732#(or (< q1_front q1_back) (< q2_front q2_back) (<= 2 total)), 4354740#(and (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (* 2 C)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 4354729#(or (<= 2 (+ total (select q1 q1_front))) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 4354738#(and (or (not (= (select q1 q1_back) C)) (<= 2 (+ total (select q1 q1_front) (* 2 C))) (<= (+ q1_back 1) q1_front) (not (= (select q1 (+ q1_front 1)) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 4354739#(and (or (not (= (select q1 q1_back) C)) (<= 2 (+ (* 3 C) total))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front)))] [2022-03-15 21:53:12,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 21:53:12,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:12,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 21:53:12,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1946, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 21:53:12,158 INFO L87 Difference]: Start difference. First operand 56977 states and 260600 transitions. Second operand has 28 states, 27 states have (on average 4.333333333333333) internal successors, (117), 27 states have internal predecessors, (117), 0 states have call successors, (0), 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:53:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:14,070 INFO L93 Difference]: Finished difference Result 88429 states and 392600 transitions. [2022-03-15 21:53:14,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 21:53:14,070 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.333333333333333) internal successors, (117), 27 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:53:14,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:14,485 INFO L225 Difference]: With dead ends: 88429 [2022-03-15 21:53:14,485 INFO L226 Difference]: Without dead ends: 88375 [2022-03-15 21:53:14,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 120 SyntacticMatches, 22 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1446 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=550, Invalid=4142, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 21:53:14,485 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 617 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:14,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [617 Valid, 263 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:53:14,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88375 states. [2022-03-15 21:53:16,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88375 to 56831. [2022-03-15 21:53:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56831 states, 56830 states have (on average 4.5725673060003516) internal successors, (259859), 56830 states have internal predecessors, (259859), 0 states have call successors, (0), 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:53:16,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56831 states to 56831 states and 259859 transitions. [2022-03-15 21:53:16,788 INFO L78 Accepts]: Start accepts. Automaton has 56831 states and 259859 transitions. Word has length 30 [2022-03-15 21:53:16,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:16,789 INFO L470 AbstractCegarLoop]: Abstraction has 56831 states and 259859 transitions. [2022-03-15 21:53:16,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.333333333333333) internal successors, (117), 27 states have internal predecessors, (117), 0 states have call successors, (0), 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:53:16,789 INFO L276 IsEmpty]: Start isEmpty. Operand 56831 states and 259859 transitions. [2022-03-15 21:53:16,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:53:16,928 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:16,928 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:16,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-03-15 21:53:17,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-03-15 21:53:17,144 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:53:17,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:17,144 INFO L85 PathProgramCache]: Analyzing trace with hash -372503275, now seen corresponding path program 21 times [2022-03-15 21:53:17,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:17,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329027175] [2022-03-15 21:53:17,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:17,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:17,577 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:17,578 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:17,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329027175] [2022-03-15 21:53:17,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329027175] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:17,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269217211] [2022-03-15 21:53:17,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:53:17,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:17,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:17,579 INFO L229 MonitoredProcess]: Starting monitored process 52 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:53:17,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-03-15 21:53:17,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 21:53:17,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:17,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 21:53:17,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:17,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:17,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:17,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:17,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:17,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:17,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:17,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:17,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:17,988 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:53:17,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 50 treesize of output 96 [2022-03-15 21:53:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:18,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:18,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:18,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:18,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:18,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:18,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:18,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:18,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:18,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:18,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:18,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:18,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:18,905 INFO L353 Elim1Store]: treesize reduction 18, result has 80.2 percent of original size [2022-03-15 21:53:18,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 51 treesize of output 97 [2022-03-15 21:53:19,316 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:19,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269217211] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:19,316 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:19,317 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-03-15 21:53:19,317 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2072415024] [2022-03-15 21:53:19,317 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:19,323 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:19,354 INFO L252 McrAutomatonBuilder]: Finished intersection with 165 states and 368 transitions. [2022-03-15 21:53:19,354 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:23,891 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [4557092#(or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 3)))) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))), 4557084#(or (< (+ q1_front 1) q1_back) (<= 4 (+ total (select q1 q1_front))) (not (< q1_front q1_back))), 4557089#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))), 4557086#(or (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))), 4557085#(or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= 4 (+ total (select q1 q1_front)))), 4557088#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front q1_back))), 4557090#(or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= 4 (+ (select q1 (+ q1_front 3)) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front q1_back))), 4557093#(and (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= 4 (+ total (* C 4))) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 4557083#(or (<= 4 total) (< q1_front q1_back)), 4557087#(or (<= 4 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))), 4557091#(or (<= 4 (+ total (select q1 q1_front))) (<= q1_back q1_front))] [2022-03-15 21:53:23,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 21:53:23,891 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:23,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 21:53:23,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1373, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 21:53:23,891 INFO L87 Difference]: Start difference. First operand 56831 states and 259859 transitions. Second operand has 22 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 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:53:25,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:25,929 INFO L93 Difference]: Finished difference Result 86463 states and 384074 transitions. [2022-03-15 21:53:25,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 21:53:25,929 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 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 30 [2022-03-15 21:53:25,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:26,336 INFO L225 Difference]: With dead ends: 86463 [2022-03-15 21:53:26,336 INFO L226 Difference]: Without dead ends: 86420 [2022-03-15 21:53:26,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 138 SyntacticMatches, 24 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=485, Invalid=2707, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 21:53:26,337 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 507 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:26,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [507 Valid, 290 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:53:26,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86420 states.