/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/buffer-mult.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:53:30,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:53:30,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:53:30,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:53:30,306 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:53:30,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:53:30,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:53:30,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:53:30,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:53:30,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:53:30,310 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:53:30,311 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:53:30,311 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:53:30,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:53:30,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:53:30,313 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:53:30,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:53:30,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:53:30,315 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:53:30,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:53:30,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:53:30,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:53:30,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:53:30,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:53:30,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:53:30,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:53:30,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:53:30,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:53:30,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:53:30,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:53:30,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:53:30,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:53:30,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:53:30,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:53:30,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:53:30,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:53:30,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:53:30,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:53:30,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:53:30,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:53:30,327 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:53:30,328 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:53:30,341 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:53:30,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:53:30,342 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:53:30,342 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:53:30,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:53:30,343 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:53:30,343 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:53:30,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:53:30,343 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:53:30,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:53:30,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:53:30,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:53:30,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:53:30,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:53:30,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:53:30,344 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:53:30,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:53:30,344 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:53:30,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:53:30,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:53:30,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:53:30,345 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:53:30,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:53:30,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:53:30,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:53:30,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:53:30,345 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:53:30,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:53:30,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:53:30,346 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:53:30,346 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:53:30,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:53:30,346 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:53:30,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:53:30,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:53:30,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:53:30,552 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:53:30,554 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:53:30,555 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/buffer-mult.wvr.bpl [2022-03-15 21:53:30,555 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/buffer-mult.wvr.bpl' [2022-03-15 21:53:30,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:53:30,583 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:53:30,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:53:30,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:53:30,584 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:53:30,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:30" (1/1) ... [2022-03-15 21:53:30,606 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:30" (1/1) ... [2022-03-15 21:53:30,611 INFO L137 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:53:30,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:53:30,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:53:30,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:53:30,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:53:30,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:30" (1/1) ... [2022-03-15 21:53:30,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:30" (1/1) ... [2022-03-15 21:53:30,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:30" (1/1) ... [2022-03-15 21:53:30,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:30" (1/1) ... [2022-03-15 21:53:30,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:30" (1/1) ... [2022-03-15 21:53:30,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:30" (1/1) ... [2022-03-15 21:53:30,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:30" (1/1) ... [2022-03-15 21:53:30,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:53:30,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:53:30,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:53:30,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:53:30,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:30" (1/1) ... [2022-03-15 21:53:30,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:53:30,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:30,677 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:53:30,681 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:53:30,707 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:53:30,707 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:53:30,707 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:53:30,707 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:53:30,707 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:53:30,707 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:53:30,707 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:53:30,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:53:30,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:53:30,708 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 21:53:30,708 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 21:53:30,708 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 21:53:30,708 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2022-03-15 21:53:30,709 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 21:53:30,709 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 21:53:30,710 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:53:30,747 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:53:30,748 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:53:30,834 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:53:30,847 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:53:30,848 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 21:53:30,849 INFO L202 PluginConnector]: Adding new model buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:53:30 BoogieIcfgContainer [2022-03-15 21:53:30,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:53:30,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:53:30,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:53:30,853 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:53:30,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:53:30" (1/2) ... [2022-03-15 21:53:30,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1987f20c and model type buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:53:30, skipping insertion in model container [2022-03-15 21:53:30,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:53:30" (2/2) ... [2022-03-15 21:53:30,855 INFO L111 eAbstractionObserver]: Analyzing ICFG buffer-mult.wvr.bpl [2022-03-15 21:53:30,858 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:53:30,858 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:53:30,858 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:53:30,858 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:53:30,924 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-15 21:53:30,982 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:53:30,987 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:53:30,987 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 21:53:31,002 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:53:31,012 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 102 flow [2022-03-15 21:53:31,017 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 102 flow [2022-03-15 21:53:31,019 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 102 flow [2022-03-15 21:53:31,037 INFO L129 PetriNetUnfolder]: 4/31 cut-off events. [2022-03-15 21:53:31,037 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-03-15 21:53:31,040 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 53 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2022-03-15 21:53:31,041 INFO L116 LiptonReduction]: Number of co-enabled transitions 350 [2022-03-15 21:53:31,150 INFO L131 LiptonReduction]: Checked pairs total: 559 [2022-03-15 21:53:31,150 INFO L133 LiptonReduction]: Total number of compositions: 9 [2022-03-15 21:53:31,161 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 86 flow [2022-03-15 21:53:31,215 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:53:31,217 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:53:31,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:53:31,224 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:31,225 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:31,225 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:53:31,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:31,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1791700969, now seen corresponding path program 1 times [2022-03-15 21:53:31,255 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:31,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334469383] [2022-03-15 21:53:31,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:31,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:31,375 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:53:31,375 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:31,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334469383] [2022-03-15 21:53:31,376 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334469383] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:53:31,376 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:53:31,376 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 21:53:31,377 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [932508992] [2022-03-15 21:53:31,377 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:31,380 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:31,430 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 98 transitions. [2022-03-15 21:53:31,430 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:31,995 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:53:31,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:53:31,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:32,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:53:32,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:53:32,018 INFO L87 Difference]: Start difference. First operand has 163 states, 162 states have (on average 3.765432098765432) internal successors, (610), 162 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:32,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:32,068 INFO L93 Difference]: Finished difference Result 311 states and 1184 transitions. [2022-03-15 21:53:32,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:53:32,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 21:53:32,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:32,080 INFO L225 Difference]: With dead ends: 311 [2022-03-15 21:53:32,080 INFO L226 Difference]: Without dead ends: 296 [2022-03-15 21:53:32,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:53:32,083 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:32,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 9 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:53:32,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-03-15 21:53:32,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 221. [2022-03-15 21:53:32,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 3.8045454545454547) internal successors, (837), 220 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:32,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 837 transitions. [2022-03-15 21:53:32,154 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 837 transitions. Word has length 14 [2022-03-15 21:53:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:32,154 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 837 transitions. [2022-03-15 21:53:32,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:32,155 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 837 transitions. [2022-03-15 21:53:32,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:53:32,156 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:32,156 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:53:32,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:53:32,157 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:53:32,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:32,157 INFO L85 PathProgramCache]: Analyzing trace with hash -237980391, now seen corresponding path program 1 times [2022-03-15 21:53:32,159 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:32,159 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595515757] [2022-03-15 21:53:32,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:32,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:32,201 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:53:32,201 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:32,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595515757] [2022-03-15 21:53:32,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595515757] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:53:32,202 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:53:32,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:53:32,202 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1399437958] [2022-03-15 21:53:32,202 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:32,205 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:32,214 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 196 transitions. [2022-03-15 21:53:32,214 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:33,153 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [1134#(or (< q1_front q1_back) (< i N)), 1135#(or (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (< i N)), 1136#(or (= q1_front q1_back) (< i N)), 1133#(< i N)] [2022-03-15 21:53:33,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:53:33,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:33,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:53:33,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:53:33,159 INFO L87 Difference]: Start difference. First operand 221 states and 837 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:33,288 INFO L93 Difference]: Finished difference Result 443 states and 1536 transitions. [2022-03-15 21:53:33,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 21:53:33,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:53:33,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:33,293 INFO L225 Difference]: With dead ends: 443 [2022-03-15 21:53:33,293 INFO L226 Difference]: Without dead ends: 436 [2022-03-15 21:53:33,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:53:33,295 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 80 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:33,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 15 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:53:33,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-03-15 21:53:33,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 305. [2022-03-15 21:53:33,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 3.713815789473684) internal successors, (1129), 304 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:33,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 1129 transitions. [2022-03-15 21:53:33,323 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 1129 transitions. Word has length 16 [2022-03-15 21:53:33,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:33,323 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 1129 transitions. [2022-03-15 21:53:33,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:33,323 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 1129 transitions. [2022-03-15 21:53:33,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:53:33,325 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:33,325 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:53:33,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 21:53:33,325 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:53:33,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:33,326 INFO L85 PathProgramCache]: Analyzing trace with hash 436556309, now seen corresponding path program 1 times [2022-03-15 21:53:33,326 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:33,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400421289] [2022-03-15 21:53:33,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:33,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:33,371 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:53:33,371 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:33,371 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400421289] [2022-03-15 21:53:33,372 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400421289] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:53:33,372 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:53:33,372 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:53:33,372 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1658126625] [2022-03-15 21:53:33,372 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:33,373 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:33,380 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 176 transitions. [2022-03-15 21:53:33,380 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:33,912 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2196#(< j N), 2197#(or (< j N) (= q2_back q2_front))] [2022-03-15 21:53:33,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:53:33,913 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:33,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:53:33,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 21:53:33,913 INFO L87 Difference]: Start difference. First operand 305 states and 1129 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:34,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:34,003 INFO L93 Difference]: Finished difference Result 471 states and 1653 transitions. [2022-03-15 21:53:34,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:53:34,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:53:34,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:34,006 INFO L225 Difference]: With dead ends: 471 [2022-03-15 21:53:34,006 INFO L226 Difference]: Without dead ends: 455 [2022-03-15 21:53:34,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-15 21:53:34,008 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:34,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 12 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:53:34,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-03-15 21:53:34,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 430. [2022-03-15 21:53:34,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 3.6386946386946386) internal successors, (1561), 429 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:34,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1561 transitions. [2022-03-15 21:53:34,022 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1561 transitions. Word has length 16 [2022-03-15 21:53:34,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:34,022 INFO L470 AbstractCegarLoop]: Abstraction has 430 states and 1561 transitions. [2022-03-15 21:53:34,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1561 transitions. [2022-03-15 21:53:34,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:53:34,024 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:34,024 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:53:34,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 21:53:34,024 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:53:34,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:34,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1538419362, now seen corresponding path program 1 times [2022-03-15 21:53:34,026 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:34,026 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930820949] [2022-03-15 21:53:34,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:34,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:34,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:53:34,073 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:34,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930820949] [2022-03-15 21:53:34,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930820949] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:34,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517494574] [2022-03-15 21:53:34,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:34,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:34,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:34,088 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:53:34,105 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:53:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:34,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 21:53:34,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:34,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:53:34,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:34,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:53:34,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517494574] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:34,261 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:34,262 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-03-15 21:53:34,262 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1100684991] [2022-03-15 21:53:34,262 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:34,263 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:34,272 INFO L252 McrAutomatonBuilder]: Finished intersection with 102 states and 236 transitions. [2022-03-15 21:53:34,272 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:35,269 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [3639#(< i N), 3642#(or (<= N i) (< (+ i 1) N)), 3641#(< (+ i 1) N), 3643#(or (<= (+ j 1) N) (< (+ i 1) N)), 3640#(or (<= (+ j 1) N) (< i N)), 3644#(or (<= N i) (< (+ i 1) N) (< j N))] [2022-03-15 21:53:35,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 21:53:35,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:35,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 21:53:35,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:53:35,270 INFO L87 Difference]: Start difference. First operand 430 states and 1561 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:35,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:35,516 INFO L93 Difference]: Finished difference Result 702 states and 2285 transitions. [2022-03-15 21:53:35,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 21:53:35,516 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:53:35,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:35,519 INFO L225 Difference]: With dead ends: 702 [2022-03-15 21:53:35,519 INFO L226 Difference]: Without dead ends: 621 [2022-03-15 21:53:35,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 91 SyntacticMatches, 19 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:53:35,520 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 88 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:35,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 1 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:53:35,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2022-03-15 21:53:35,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 501. [2022-03-15 21:53:35,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 3.466) internal successors, (1733), 500 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1733 transitions. [2022-03-15 21:53:35,533 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 1733 transitions. Word has length 18 [2022-03-15 21:53:35,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:35,533 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 1733 transitions. [2022-03-15 21:53:35,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:35,533 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 1733 transitions. [2022-03-15 21:53:35,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:53:35,534 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:35,534 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:53:35,570 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:53:35,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:35,770 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:53:35,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:35,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2081986343, now seen corresponding path program 1 times [2022-03-15 21:53:35,772 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:35,772 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874335067] [2022-03-15 21:53:35,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:35,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:35,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:53:35,807 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:35,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874335067] [2022-03-15 21:53:35,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874335067] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:53:35,807 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:53:35,808 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:53:35,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1075535188] [2022-03-15 21:53:35,812 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:35,814 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:35,821 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 195 transitions. [2022-03-15 21:53:35,821 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:36,392 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [5372#(or (<= N j) (< i N)), 5369#(< j N), 5370#(< i N), 5371#(or (< j N) (< i N))] [2022-03-15 21:53:36,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:53:36,393 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:36,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:53:36,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:53:36,393 INFO L87 Difference]: Start difference. First operand 501 states and 1733 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:36,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:36,571 INFO L93 Difference]: Finished difference Result 547 states and 1818 transitions. [2022-03-15 21:53:36,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 21:53:36,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:53:36,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:36,574 INFO L225 Difference]: With dead ends: 547 [2022-03-15 21:53:36,574 INFO L226 Difference]: Without dead ends: 532 [2022-03-15 21:53:36,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-03-15 21:53:36,575 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 91 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:36,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 1 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:53:36,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-03-15 21:53:36,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 412. [2022-03-15 21:53:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 3.435523114355231) internal successors, (1412), 411 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1412 transitions. [2022-03-15 21:53:36,585 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1412 transitions. Word has length 18 [2022-03-15 21:53:36,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:36,585 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 1412 transitions. [2022-03-15 21:53:36,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:36,585 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1412 transitions. [2022-03-15 21:53:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:53:36,586 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:36,586 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:53:36,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 21:53:36,587 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:53:36,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:36,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1057526178, now seen corresponding path program 1 times [2022-03-15 21:53:36,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:36,588 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458639739] [2022-03-15 21:53:36,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:36,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:53:36,610 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:36,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458639739] [2022-03-15 21:53:36,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458639739] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:36,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976704002] [2022-03-15 21:53:36,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:36,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:36,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:36,612 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:53:36,637 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:53:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:36,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 21:53:36,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:36,698 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:53:36,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 21:53:36,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976704002] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:53:36,698 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 21:53:36,698 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-03-15 21:53:36,698 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [890157419] [2022-03-15 21:53:36,698 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:36,700 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:36,715 INFO L252 McrAutomatonBuilder]: Finished intersection with 158 states and 388 transitions. [2022-03-15 21:53:36,716 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:37,764 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:53:37,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:53:37,764 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:37,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:53:37,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:53:37,765 INFO L87 Difference]: Start difference. First operand 412 states and 1412 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:37,789 INFO L93 Difference]: Finished difference Result 532 states and 1840 transitions. [2022-03-15 21:53:37,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 21:53:37,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:53:37,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:37,792 INFO L225 Difference]: With dead ends: 532 [2022-03-15 21:53:37,792 INFO L226 Difference]: Without dead ends: 532 [2022-03-15 21:53:37,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:53:37,792 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:37,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 9 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:53:37,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-03-15 21:53:37,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 362. [2022-03-15 21:53:37,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 3.409972299168975) internal successors, (1231), 361 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 1231 transitions. [2022-03-15 21:53:37,801 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 1231 transitions. Word has length 20 [2022-03-15 21:53:37,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:37,802 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 1231 transitions. [2022-03-15 21:53:37,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:37,802 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 1231 transitions. [2022-03-15 21:53:37,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:53:37,803 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:37,803 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:53:37,821 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:53:38,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-15 21:53:38,020 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:53:38,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:38,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1968354338, now seen corresponding path program 1 times [2022-03-15 21:53:38,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:38,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634770447] [2022-03-15 21:53:38,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:38,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:38,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:53:38,039 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:38,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634770447] [2022-03-15 21:53:38,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634770447] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:38,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230448192] [2022-03-15 21:53:38,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:38,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:38,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:38,041 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:53:38,042 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:53:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:38,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 21:53:38,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:53:38,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 21:53:38,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230448192] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:53:38,093 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 21:53:38,093 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-03-15 21:53:38,093 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1103979242] [2022-03-15 21:53:38,093 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:38,094 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:38,106 INFO L252 McrAutomatonBuilder]: Finished intersection with 117 states and 263 transitions. [2022-03-15 21:53:38,106 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:38,728 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:53:38,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:53:38,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:38,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:53:38,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:53:38,729 INFO L87 Difference]: Start difference. First operand 362 states and 1231 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:38,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:38,758 INFO L93 Difference]: Finished difference Result 540 states and 1842 transitions. [2022-03-15 21:53:38,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 21:53:38,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:53:38,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:38,761 INFO L225 Difference]: With dead ends: 540 [2022-03-15 21:53:38,761 INFO L226 Difference]: Without dead ends: 540 [2022-03-15 21:53:38,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 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:53:38,761 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:38,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 9 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:53:38,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-03-15 21:53:38,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 423. [2022-03-15 21:53:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 3.5) internal successors, (1477), 422 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1477 transitions. [2022-03-15 21:53:38,771 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1477 transitions. Word has length 20 [2022-03-15 21:53:38,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:38,771 INFO L470 AbstractCegarLoop]: Abstraction has 423 states and 1477 transitions. [2022-03-15 21:53:38,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:38,771 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1477 transitions. [2022-03-15 21:53:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:53:38,772 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:38,772 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:53:38,789 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:53:38,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:38,989 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:53:38,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:38,989 INFO L85 PathProgramCache]: Analyzing trace with hash -325286663, now seen corresponding path program 2 times [2022-03-15 21:53:38,990 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:38,990 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943021587] [2022-03-15 21:53:38,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:38,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:53:39,014 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:39,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943021587] [2022-03-15 21:53:39,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943021587] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:53:39,014 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:53:39,014 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:53:39,014 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [746604491] [2022-03-15 21:53:39,014 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:39,015 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:39,025 INFO L252 McrAutomatonBuilder]: Finished intersection with 99 states and 224 transitions. [2022-03-15 21:53:39,025 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:39,588 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [9527#(<= q1_back q1_front), 9530#(and (or (not (< i N)) (< j N)) (or (< j N) (not (< q1_front q1_back)))), 9529#(and (not (< i N)) (not (< q1_front q1_back))), 9531#(and (or (= (+ (* (- 1) q1_front) q1_back) 0) (< j N)) (or (<= N i) (< j N))), 9528#(or (< j N) (<= q1_back q1_front)), 9524#(< j N), 9526#(or (< j N) (< i N)), 9525#(< i N)] [2022-03-15 21:53:39,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 21:53:39,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:39,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 21:53:39,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:53:39,590 INFO L87 Difference]: Start difference. First operand 423 states and 1477 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:39,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:39,802 INFO L93 Difference]: Finished difference Result 335 states and 1191 transitions. [2022-03-15 21:53:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 21:53:39,803 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:53:39,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:39,804 INFO L225 Difference]: With dead ends: 335 [2022-03-15 21:53:39,805 INFO L226 Difference]: Without dead ends: 330 [2022-03-15 21:53:39,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:53:39,805 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 135 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:39,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 1 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:53:39,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-03-15 21:53:39,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 317. [2022-03-15 21:53:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 3.607594936708861) internal successors, (1140), 316 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 1140 transitions. [2022-03-15 21:53:39,813 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 1140 transitions. Word has length 20 [2022-03-15 21:53:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:39,813 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 1140 transitions. [2022-03-15 21:53:39,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 1140 transitions. [2022-03-15 21:53:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:53:39,814 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:39,814 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:53:39,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 21:53:39,814 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:53:39,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:39,815 INFO L85 PathProgramCache]: Analyzing trace with hash 552255584, now seen corresponding path program 1 times [2022-03-15 21:53:39,815 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:39,815 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842322249] [2022-03-15 21:53:39,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:39,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:39,905 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:39,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842322249] [2022-03-15 21:53:39,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842322249] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:39,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186364629] [2022-03-15 21:53:39,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:39,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:39,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:39,907 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:53:39,929 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:53:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:39,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:53:39,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:40,068 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 13 [2022-03-15 21:53:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:40,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:40,190 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:53:40,190 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 21:53:40,254 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:53:40,254 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 9 treesize of output 14 [2022-03-15 21:53:40,265 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-03-15 21:53:40,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:40,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186364629] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:40,275 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:40,275 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-03-15 21:53:40,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2085699198] [2022-03-15 21:53:40,275 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:40,276 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:40,295 INFO L252 McrAutomatonBuilder]: Finished intersection with 147 states and 339 transitions. [2022-03-15 21:53:40,295 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:44,742 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [10653#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1))) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0))), 10657#(and (or (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total))) (or (< q1_front q1_back) (<= (+ (select q2 q2_front) total) 0))), 10659#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ (select q2 q2_front) total) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 0 (+ (select q2 q2_front) total)))), 10660#(and (or (not (= (+ C (select q2 q2_back)) 0)) (< q1_front q1_back) (<= (+ (select q2 q2_front) total) 0)) (or (not (= (+ C (select q2 q2_back)) 0)) (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total)))), 10666#(and (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front)))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)))), 10667#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C)))), 10664#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))))), 10662#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (+ C (select q2 q2_back)) 0))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))))), 10654#(and (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0)) (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)))), 10652#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 10661#(and (or (not (= (+ C (select q2 q2_back)) 0)) (< (+ q1_front 1) q1_back) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (+ C (select q2 q2_back)) 0)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 10658#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front q1_back)))), 10656#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front))), 10665#(and (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front))), 10663#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1))))), 10655#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))))] [2022-03-15 21:53:44,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:53:44,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:44,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:53:44,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2022-03-15 21:53:44,744 INFO L87 Difference]: Start difference. First operand 317 states and 1140 transitions. Second operand has 23 states, 22 states have (on average 4.954545454545454) internal successors, (109), 22 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call 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:46,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:46,216 INFO L93 Difference]: Finished difference Result 1427 states and 4916 transitions. [2022-03-15 21:53:46,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 21:53:46,217 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.954545454545454) internal successors, (109), 22 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have 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:53:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:46,223 INFO L225 Difference]: With dead ends: 1427 [2022-03-15 21:53:46,223 INFO L226 Difference]: Without dead ends: 1409 [2022-03-15 21:53:46,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 141 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=503, Invalid=2047, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 21:53:46,224 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 443 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:46,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 117 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:53:46,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2022-03-15 21:53:46,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 516. [2022-03-15 21:53:46,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 3.7067961165048544) internal successors, (1909), 515 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:46,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1909 transitions. [2022-03-15 21:53:46,240 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 1909 transitions. Word has length 22 [2022-03-15 21:53:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:46,240 INFO L470 AbstractCegarLoop]: Abstraction has 516 states and 1909 transitions. [2022-03-15 21:53:46,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.954545454545454) internal successors, (109), 22 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call 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:46,241 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 1909 transitions. [2022-03-15 21:53:46,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:53:46,242 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:46,242 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:53:46,268 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:53:46,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:46,459 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:53:46,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:46,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1798397536, now seen corresponding path program 2 times [2022-03-15 21:53:46,460 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:46,460 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821193949] [2022-03-15 21:53:46,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:46,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:46,533 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:46,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821193949] [2022-03-15 21:53:46,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821193949] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:46,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146735655] [2022-03-15 21:53:46,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:53:46,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:46,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:46,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:53:46,549 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:53:46,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:53:46,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:46,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:53:46,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:46,684 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 20 treesize of output 14 [2022-03-15 21:53:46,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:46,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:46,776 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:53:46,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 21:53:46,837 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:53:46,837 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 9 treesize of output 14 [2022-03-15 21:53:46,847 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-03-15 21:53:46,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:46,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146735655] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:46,859 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:46,859 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-03-15 21:53:46,859 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1884302029] [2022-03-15 21:53:46,859 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:46,861 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:46,879 INFO L252 McrAutomatonBuilder]: Finished intersection with 150 states and 351 transitions. [2022-03-15 21:53:46,879 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:50,837 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [13317#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 13322#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (+ C (select q2 q2_back)) 0))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))))), 13320#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (< q1_front (+ q1_back 1)))) (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front))), 13321#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))))), 13315#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 13323#(and (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front)))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)))), 13319#(and (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) 0)) (or (<= 0 (+ total (select q1 q1_front))) (not (= (select q1 q1_back) C)))), 13316#(and (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (< 0 (+ total (select q1 q1_front) 1)) (not (< q1_front q1_back)))), 13318#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (< 0 (+ total (select q1 q1_front) 1))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front (+ q1_back 1))))), 13324#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))))] [2022-03-15 21:53:50,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 21:53:50,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:50,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 21:53:50,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-03-15 21:53:50,838 INFO L87 Difference]: Start difference. First operand 516 states and 1909 transitions. Second operand has 17 states, 16 states have (on average 5.125) internal successors, (82), 16 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:53:52,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:52,474 INFO L93 Difference]: Finished difference Result 2341 states and 8248 transitions. [2022-03-15 21:53:52,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 21:53:52,474 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.125) internal successors, (82), 16 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 22 [2022-03-15 21:53:52,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:52,484 INFO L225 Difference]: With dead ends: 2341 [2022-03-15 21:53:52,485 INFO L226 Difference]: Without dead ends: 2323 [2022-03-15 21:53:52,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 150 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=443, Invalid=1909, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 21:53:52,486 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 359 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:52,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 149 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:53:52,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2022-03-15 21:53:52,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 760. [2022-03-15 21:53:52,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 759 states have (on average 3.8274044795783926) internal successors, (2905), 759 states have internal predecessors, (2905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 2905 transitions. [2022-03-15 21:53:52,510 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 2905 transitions. Word has length 22 [2022-03-15 21:53:52,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:52,510 INFO L470 AbstractCegarLoop]: Abstraction has 760 states and 2905 transitions. [2022-03-15 21:53:52,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.125) internal successors, (82), 16 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:53:52,510 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 2905 transitions. [2022-03-15 21:53:52,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 21:53:52,513 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:52,513 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:53:52,529 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:53:52,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 21:53:52,727 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:53:52,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:52,728 INFO L85 PathProgramCache]: Analyzing trace with hash 496835682, now seen corresponding path program 3 times [2022-03-15 21:53:52,729 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:52,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803218811] [2022-03-15 21:53:52,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:52,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:52,764 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:53:52,764 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:52,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803218811] [2022-03-15 21:53:52,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803218811] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:52,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118663093] [2022-03-15 21:53:52,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:53:52,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:52,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:52,766 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:53:52,767 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:53:52,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:53:52,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:52,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 21:53:52,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:52,819 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:53:52,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:52,846 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:53:52,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118663093] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:52,846 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:52,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 6 [2022-03-15 21:53:52,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1590457087] [2022-03-15 21:53:52,849 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:52,850 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:52,877 INFO L252 McrAutomatonBuilder]: Finished intersection with 187 states and 441 transitions. [2022-03-15 21:53:52,877 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:55,141 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [17400#(or (<= N i) (< (+ i 1) N) (< (+ q1_front 1) q1_back) (<= q1_back q1_front)), 17398#(or (< i N) (<= q1_back (+ q1_front 1))), 17395#(< i N), 17396#(or (< (+ q1_front 2) q1_back) (< (+ i 1) N) (<= q1_back (+ q1_front 1))), 17392#(or (< q1_front q1_back) (< i N)), 17397#(or (<= q1_back q1_front) (< i N)), 17394#(or (< (+ q1_front 2) q1_back) (< i N) (<= q1_back (+ q1_front 1))), 17393#(or (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (< i N)), 17399#(or (< (+ i 1) N) (<= q1_back (+ q1_front 1))), 17401#(or (< (+ i 1) N) (not (< i N)) (<= q1_back q1_front))] [2022-03-15 21:53:55,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:53:55,142 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:55,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:53:55,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-03-15 21:53:55,150 INFO L87 Difference]: Start difference. First operand 760 states and 2905 transitions. Second operand has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:55,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:55,401 INFO L93 Difference]: Finished difference Result 1600 states and 5937 transitions. [2022-03-15 21:53:55,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 21:53:55,402 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 21:53:55,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:55,408 INFO L225 Difference]: With dead ends: 1600 [2022-03-15 21:53:55,409 INFO L226 Difference]: Without dead ends: 1546 [2022-03-15 21:53:55,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 194 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:53:55,409 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 243 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:55,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 41 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:53:55,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2022-03-15 21:53:55,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1152. [2022-03-15 21:53:55,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1151 states have (on average 3.835794960903562) internal successors, (4415), 1151 states have internal predecessors, (4415), 0 states have call successors, (0), 0 states have call 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:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 4415 transitions. [2022-03-15 21:53:55,434 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 4415 transitions. Word has length 24 [2022-03-15 21:53:55,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:55,435 INFO L470 AbstractCegarLoop]: Abstraction has 1152 states and 4415 transitions. [2022-03-15 21:53:55,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 4415 transitions. [2022-03-15 21:53:55,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 21:53:55,437 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:55,437 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:53:55,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 21:53:55,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:55,652 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:53:55,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:55,653 INFO L85 PathProgramCache]: Analyzing trace with hash 318519198, now seen corresponding path program 4 times [2022-03-15 21:53:55,654 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:55,654 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467826849] [2022-03-15 21:53:55,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:55,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:53:55,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:55,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467826849] [2022-03-15 21:53:55,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467826849] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:53:55,677 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:53:55,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 21:53:55,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1601396761] [2022-03-15 21:53:55,677 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:55,679 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:55,698 INFO L252 McrAutomatonBuilder]: Finished intersection with 141 states and 321 transitions. [2022-03-15 21:53:55,699 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:56,417 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:53:56,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 21:53:56,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:56,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 21:53:56,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:53:56,418 INFO L87 Difference]: Start difference. First operand 1152 states and 4415 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:56,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:56,474 INFO L93 Difference]: Finished difference Result 2230 states and 8484 transitions. [2022-03-15 21:53:56,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 21:53:56,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 21:53:56,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:56,484 INFO L225 Difference]: With dead ends: 2230 [2022-03-15 21:53:56,484 INFO L226 Difference]: Without dead ends: 2144 [2022-03-15 21:53:56,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:53:56,485 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:56,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 16 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:53:56,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2144 states. [2022-03-15 21:53:56,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2144 to 1967. [2022-03-15 21:53:56,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1966 states have (on average 3.901322482197355) internal successors, (7670), 1966 states have internal predecessors, (7670), 0 states have call successors, (0), 0 states have call 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:56,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 7670 transitions. [2022-03-15 21:53:56,525 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 7670 transitions. Word has length 24 [2022-03-15 21:53:56,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:56,526 INFO L470 AbstractCegarLoop]: Abstraction has 1967 states and 7670 transitions. [2022-03-15 21:53:56,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:56,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 7670 transitions. [2022-03-15 21:53:56,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:53:56,530 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:56,530 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:53:56,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 21:53:56,530 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:53:56,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:56,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1806428071, now seen corresponding path program 5 times [2022-03-15 21:53:56,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:56,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28384188] [2022-03-15 21:53:56,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:56,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:56,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:53:56,555 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:56,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28384188] [2022-03-15 21:53:56,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28384188] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:56,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768863701] [2022-03-15 21:53:56,555 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:53:56,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:56,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:56,559 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:53:56,560 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:53:56,586 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:53:56,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:56,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:53:56,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:53:56,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:53:56,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768863701] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:56,736 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:56,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-03-15 21:53:56,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [214170255] [2022-03-15 21:53:56,736 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:56,738 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:56,772 INFO L252 McrAutomatonBuilder]: Finished intersection with 207 states and 483 transitions. [2022-03-15 21:53:56,772 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:59,522 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [27661#(or (<= N j) (< (+ i 1) N) (<= (+ 2 j) N)), 27662#(or (<= N j) (<= N i) (< (+ i 1) N) (< (+ j 1) N)), 27663#(or (<= N (+ i 1)) (<= N j) (< (+ 2 i) N) (< (+ j 1) N)), 27653#(or (<= N i) (< (+ i 1) N)), 27659#(or (<= N j) (<= (+ 2 j) N)), 27649#(or (< (+ j 1) N) (< i N)), 27650#(< (+ i 1) N), 27647#(< i N), 27660#(or (<= N j) (<= (+ 2 j) N) (< i N)), 27656#(or (<= N (+ i 1)) (< (+ 2 i) N)), 27657#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j N)), 27652#(or (< (+ i 1) N) (< (+ j 1) N)), 27654#(or (<= N i) (< (+ i 1) N) (< j N)), 27655#(or (<= N i) (< (+ i 1) N) (< (+ j 1) N)), 27648#(or (< j N) (< i N)), 27658#(or (<= N (+ i 1)) (< (+ 2 i) N) (< (+ j 1) N)), 27651#(or (< (+ i 1) N) (< j N))] [2022-03-15 21:53:59,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:53:59,523 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:59,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:53:59,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2022-03-15 21:53:59,524 INFO L87 Difference]: Start difference. First operand 1967 states and 7670 transitions. Second operand has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 22 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:00,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:00,273 INFO L93 Difference]: Finished difference Result 6512 states and 24602 transitions. [2022-03-15 21:54:00,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 21:54:00,274 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 22 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 21:54:00,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:00,300 INFO L225 Difference]: With dead ends: 6512 [2022-03-15 21:54:00,301 INFO L226 Difference]: Without dead ends: 5733 [2022-03-15 21:54:00,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 199 SyntacticMatches, 11 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=612, Invalid=2144, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 21:54:00,302 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 414 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:00,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [414 Valid, 1 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:54:00,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5733 states. [2022-03-15 21:54:00,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5733 to 4004. [2022-03-15 21:54:00,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4004 states, 4003 states have (on average 4.111666250312266) internal successors, (16459), 4003 states have internal predecessors, (16459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4004 states to 4004 states and 16459 transitions. [2022-03-15 21:54:00,413 INFO L78 Accepts]: Start accepts. Automaton has 4004 states and 16459 transitions. Word has length 26 [2022-03-15 21:54:00,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:00,414 INFO L470 AbstractCegarLoop]: Abstraction has 4004 states and 16459 transitions. [2022-03-15 21:54:00,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 22 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4004 states and 16459 transitions. [2022-03-15 21:54:00,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:54:00,423 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:00,423 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:54:00,442 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:54:00,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:00,642 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:54:00,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:00,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1789966490, now seen corresponding path program 6 times [2022-03-15 21:54:00,643 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:00,643 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535506914] [2022-03-15 21:54:00,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:00,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:00,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:54:00,676 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:00,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535506914] [2022-03-15 21:54:00,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535506914] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:00,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892230212] [2022-03-15 21:54:00,677 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:54:00,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:00,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:00,678 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:54:00,679 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:54:00,720 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:54:00,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:00,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:54:00,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:54:00,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:54:00,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892230212] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:00,824 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:00,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-03-15 21:54:00,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1383705469] [2022-03-15 21:54:00,824 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:00,826 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:00,877 INFO L252 McrAutomatonBuilder]: Finished intersection with 153 states and 347 transitions. [2022-03-15 21:54:00,877 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:02,338 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [42400#(or (<= N (+ j 1)) (< i N)), 42398#(or (< j N) (< i N)), 42399#(or (<= N j) (< i N)), 42397#(< i N), 42396#(< j N), 42402#(or (<= N i) (< (+ i 1) N) (<= N (+ j 1))), 42401#(or (< (+ i 1) N) (<= N (+ j 1)))] [2022-03-15 21:54:02,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 21:54:02,338 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:02,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 21:54:02,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-03-15 21:54:02,339 INFO L87 Difference]: Start difference. First operand 4004 states and 16459 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:02,674 INFO L93 Difference]: Finished difference Result 7688 states and 30933 transitions. [2022-03-15 21:54:02,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 21:54:02,682 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 21:54:02,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:02,722 INFO L225 Difference]: With dead ends: 7688 [2022-03-15 21:54:02,722 INFO L226 Difference]: Without dead ends: 7567 [2022-03-15 21:54:02,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2022-03-15 21:54:02,723 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 236 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:02,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 1 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:54:02,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7567 states. [2022-03-15 21:54:02,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7567 to 6180. [2022-03-15 21:54:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6180 states, 6179 states have (on average 4.2155688622754495) internal successors, (26048), 6179 states have internal predecessors, (26048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6180 states to 6180 states and 26048 transitions. [2022-03-15 21:54:02,916 INFO L78 Accepts]: Start accepts. Automaton has 6180 states and 26048 transitions. Word has length 26 [2022-03-15 21:54:02,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:02,916 INFO L470 AbstractCegarLoop]: Abstraction has 6180 states and 26048 transitions. [2022-03-15 21:54:02,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 6180 states and 26048 transitions. [2022-03-15 21:54:02,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:54:02,936 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:02,936 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:54:02,952 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:54:03,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 21:54:03,151 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:54:03,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:03,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1299524028, now seen corresponding path program 7 times [2022-03-15 21:54:03,153 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:03,153 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555788602] [2022-03-15 21:54:03,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:03,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:03,178 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:54:03,179 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:03,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555788602] [2022-03-15 21:54:03,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555788602] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:03,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556347942] [2022-03-15 21:54:03,179 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:54:03,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:03,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:03,180 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:54:03,208 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:54:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:03,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:54:03,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:54:03,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:54:03,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556347942] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:03,343 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:03,343 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 8 [2022-03-15 21:54:03,343 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1910703089] [2022-03-15 21:54:03,343 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:03,345 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:03,368 INFO L252 McrAutomatonBuilder]: Finished intersection with 155 states and 350 transitions. [2022-03-15 21:54:03,368 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:04,259 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [62643#(or (< (+ i 1) N) (< j N)), 62639#(or (<= N (+ j 1)) (< i N)), 62645#(or (<= N j) (<= i j)), 62640#(<= i (+ j 1)), 62642#(< (+ i 1) N), 62635#(< i N), 62638#(or (<= N j) (< i N)), 62634#(< j N), 62636#(or (< j N) (< i N)), 62644#(or (<= N i) (<= i j)), 62637#(<= N (+ j 1)), 62641#(or (<= N j) (<= i (+ j 1)))] [2022-03-15 21:54:04,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 21:54:04,259 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:04,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 21:54:04,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2022-03-15 21:54:04,260 INFO L87 Difference]: Start difference. First operand 6180 states and 26048 transitions. Second operand has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 16 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:04,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:04,605 INFO L93 Difference]: Finished difference Result 9441 states and 38140 transitions. [2022-03-15 21:54:04,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 21:54:04,605 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 16 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 21:54:04,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:04,680 INFO L225 Difference]: With dead ends: 9441 [2022-03-15 21:54:04,681 INFO L226 Difference]: Without dead ends: 9363 [2022-03-15 21:54:04,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 21:54:04,683 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 277 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:04,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 1 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:54:04,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9363 states. [2022-03-15 21:54:04,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9363 to 6496. [2022-03-15 21:54:04,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6496 states, 6495 states have (on average 4.2415704387990765) internal successors, (27549), 6495 states have internal predecessors, (27549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6496 states to 6496 states and 27549 transitions. [2022-03-15 21:54:04,929 INFO L78 Accepts]: Start accepts. Automaton has 6496 states and 27549 transitions. Word has length 26 [2022-03-15 21:54:04,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:04,929 INFO L470 AbstractCegarLoop]: Abstraction has 6496 states and 27549 transitions. [2022-03-15 21:54:04,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 16 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 6496 states and 27549 transitions. [2022-03-15 21:54:04,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 21:54:04,947 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:04,947 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:54:04,963 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:54:05,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 21:54:05,163 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:54:05,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:05,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1446283875, now seen corresponding path program 8 times [2022-03-15 21:54:05,179 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:05,180 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012021532] [2022-03-15 21:54:05,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:05,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:05,206 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 21:54:05,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:05,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012021532] [2022-03-15 21:54:05,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012021532] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:05,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350725867] [2022-03-15 21:54:05,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:54:05,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:05,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:05,209 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:54:05,235 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:54:05,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:54:05,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:05,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:54:05,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:05,272 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 21:54:05,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 21:54:05,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350725867] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:54:05,272 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 21:54:05,272 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-03-15 21:54:05,272 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2112638063] [2022-03-15 21:54:05,272 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:05,275 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:05,332 INFO L252 McrAutomatonBuilder]: Finished intersection with 251 states and 589 transitions. [2022-03-15 21:54:05,332 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:07,346 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [85198#(or (<= (+ q2_front 2) q2_back) (<= q2_back q2_front))] [2022-03-15 21:54:07,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:54:07,347 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:07,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:54:07,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 21:54:07,347 INFO L87 Difference]: Start difference. First operand 6496 states and 27549 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:07,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:07,447 INFO L93 Difference]: Finished difference Result 8656 states and 36645 transitions. [2022-03-15 21:54:07,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:54:07,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 21:54:07,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:07,473 INFO L225 Difference]: With dead ends: 8656 [2022-03-15 21:54:07,474 INFO L226 Difference]: Without dead ends: 8656 [2022-03-15 21:54:07,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:54:07,474 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:07,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 20 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:54:07,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8656 states. [2022-03-15 21:54:07,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8656 to 6338. [2022-03-15 21:54:07,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6338 states, 6337 states have (on average 4.2171374467413605) internal successors, (26724), 6337 states have internal predecessors, (26724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6338 states to 6338 states and 26724 transitions. [2022-03-15 21:54:07,635 INFO L78 Accepts]: Start accepts. Automaton has 6338 states and 26724 transitions. Word has length 28 [2022-03-15 21:54:07,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:07,636 INFO L470 AbstractCegarLoop]: Abstraction has 6338 states and 26724 transitions. [2022-03-15 21:54:07,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 6338 states and 26724 transitions. [2022-03-15 21:54:07,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 21:54:07,651 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:07,651 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:54:07,669 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:54:07,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 21:54:07,867 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:54:07,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:07,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1882834591, now seen corresponding path program 9 times [2022-03-15 21:54:07,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:07,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180054030] [2022-03-15 21:54:07,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:07,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:07,892 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:54:07,892 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:07,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180054030] [2022-03-15 21:54:07,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180054030] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:07,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577940586] [2022-03-15 21:54:07,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:54:07,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:07,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:07,893 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:54:07,932 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:54:07,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:54:07,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:07,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:54:07,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:08,005 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:54:08,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:54:08,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577940586] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:08,028 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:08,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-03-15 21:54:08,028 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1205013109] [2022-03-15 21:54:08,028 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:08,030 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:08,059 INFO L252 McrAutomatonBuilder]: Finished intersection with 169 states and 381 transitions. [2022-03-15 21:54:08,059 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:08,982 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [106702#(or (<= (+ q1_back 1) q1_front) (<= (+ q1_front 1) q1_back)), 106701#(or (<= q1_back q1_front) (<= (+ q1_front 2) q1_back)), 106541#(<= q1_front q1_back), 106703#(or (<= q1_front q1_back) (<= (+ q1_back 2) q1_front))] [2022-03-15 21:54:08,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 21:54:08,983 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:08,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 21:54:08,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:54:08,984 INFO L87 Difference]: Start difference. First operand 6338 states and 26724 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:09,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:09,076 INFO L93 Difference]: Finished difference Result 9829 states and 41765 transitions. [2022-03-15 21:54:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:54:09,076 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 21:54:09,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:09,121 INFO L225 Difference]: With dead ends: 9829 [2022-03-15 21:54:09,121 INFO L226 Difference]: Without dead ends: 9829 [2022-03-15 21:54:09,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 189 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:54:09,122 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 63 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:09,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 27 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:54:09,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9829 states. [2022-03-15 21:54:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9829 to 8685. [2022-03-15 21:54:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8685 states, 8684 states have (on average 4.269115614923998) internal successors, (37073), 8684 states have internal predecessors, (37073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:09,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8685 states to 8685 states and 37073 transitions. [2022-03-15 21:54:09,371 INFO L78 Accepts]: Start accepts. Automaton has 8685 states and 37073 transitions. Word has length 28 [2022-03-15 21:54:09,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:09,372 INFO L470 AbstractCegarLoop]: Abstraction has 8685 states and 37073 transitions. [2022-03-15 21:54:09,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:09,372 INFO L276 IsEmpty]: Start isEmpty. Operand 8685 states and 37073 transitions. [2022-03-15 21:54:09,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 21:54:09,393 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:09,393 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:09,422 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:54:09,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 21:54:09,609 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:54:09,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:09,610 INFO L85 PathProgramCache]: Analyzing trace with hash -175319710, now seen corresponding path program 10 times [2022-03-15 21:54:09,610 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:09,610 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017552484] [2022-03-15 21:54:09,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:09,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 21:54:09,639 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:09,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017552484] [2022-03-15 21:54:09,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017552484] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:09,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451243855] [2022-03-15 21:54:09,639 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:54:09,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:09,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:09,640 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:54:09,671 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:54:09,673 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:54:09,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:09,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:54:09,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:54:09,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:54:09,811 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451243855] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:09,811 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:09,811 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-03-15 21:54:09,812 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [817977431] [2022-03-15 21:54:09,812 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:09,815 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:09,848 INFO L252 McrAutomatonBuilder]: Finished intersection with 162 states and 353 transitions. [2022-03-15 21:54:09,848 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:10,794 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [134080#(<= q1_front q1_back), 134079#(or (<= q1_back q1_front) (<= (+ q1_front 2) q1_back))] [2022-03-15 21:54:10,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:54:10,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:10,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:54:10,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:54:10,810 INFO L87 Difference]: Start difference. First operand 8685 states and 37073 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:11,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:11,000 INFO L93 Difference]: Finished difference Result 13904 states and 59553 transitions. [2022-03-15 21:54:11,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:54:11,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 21:54:11,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:11,046 INFO L225 Difference]: With dead ends: 13904 [2022-03-15 21:54:11,047 INFO L226 Difference]: Without dead ends: 13904 [2022-03-15 21:54:11,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:54:11,048 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 66 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:11,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 27 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:54:11,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13904 states. [2022-03-15 21:54:11,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13904 to 10433. [2022-03-15 21:54:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10433 states, 10432 states have (on average 4.274252300613497) internal successors, (44589), 10432 states have internal predecessors, (44589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10433 states to 10433 states and 44589 transitions. [2022-03-15 21:54:11,332 INFO L78 Accepts]: Start accepts. Automaton has 10433 states and 44589 transitions. Word has length 28 [2022-03-15 21:54:11,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:11,333 INFO L470 AbstractCegarLoop]: Abstraction has 10433 states and 44589 transitions. [2022-03-15 21:54:11,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:11,333 INFO L276 IsEmpty]: Start isEmpty. Operand 10433 states and 44589 transitions. [2022-03-15 21:54:11,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:54:11,357 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:11,357 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:54:11,391 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:54:11,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 21:54:11,571 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:54:11,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:11,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1771117471, now seen corresponding path program 11 times [2022-03-15 21:54:11,572 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:11,572 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760296998] [2022-03-15 21:54:11,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:11,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:11,844 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:11,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760296998] [2022-03-15 21:54:11,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760296998] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:11,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371194310] [2022-03-15 21:54:11,844 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:54:11,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:11,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:11,846 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:54:11,847 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:54:11,953 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:54:11,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:11,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 21:54:11,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:12,204 INFO L353 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-03-15 21:54:12,204 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 31 treesize of output 35 [2022-03-15 21:54:12,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:12,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:54:12,391 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 18 [2022-03-15 21:54:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:12,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:12,725 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:54:12,725 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 54 treesize of output 72 [2022-03-15 21:54:13,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:54:13,109 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-03-15 21:54:13,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 35 [2022-03-15 21:54:13,134 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:13,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371194310] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:13,134 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:13,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 23 [2022-03-15 21:54:13,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [326737347] [2022-03-15 21:54:13,134 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:13,137 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:13,176 INFO L252 McrAutomatonBuilder]: Finished intersection with 195 states and 447 transitions. [2022-03-15 21:54:13,176 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:26,534 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [169061#(and (or (< (+ q1_front 2) q1_back) (<= q2_back (+ q2_front 1)) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (* 2 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< (+ q1_front 1) q1_back))) (or (= (+ (select q2 q2_front) C) 0) (< (+ q1_front 2) q1_back) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ q2_front 1) q2_back) (not (< (+ q1_front 1) q1_back))) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 2 C)) (< (+ q1_front 2) q1_back) (not (< (+ q1_front 1) q1_back)))), 169050#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 169055#(and (or (< q1_front q1_back) (<= (* 2 C) total)) (or (< q1_front q1_back) (<= q2_back (+ q2_front 1))) (or (= (+ (select q2 q2_front) C) 0) (< q1_front q1_back)) (or (< q1_front q1_back) (<= total (* 2 C))) (or (< q1_front q1_back) (<= (+ q2_front 1) q2_back))), 169058#(and (or (< q1_front q1_back) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back)))) (or (< q1_front q1_back) (<= total (* 2 C)) (not (= (- C) (select q2 q2_back)))) (or (< q1_front q1_back) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (< q1_front q1_back) (<= (* 2 C) total) (not (= (- C) (select q2 q2_back))))), 169065#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (<= total 0) (not (= (select q1 q1_back) 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 (<= 0 total) (not (= (select q1 q1_back) C)))), 169062#(and (or (< (+ q1_front 2) q1_back) (<= (* 2 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< (+ q1_front 1) q1_back)) (not (= (- C) (select q2 q2_back)))) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 2 C)) (< (+ q1_front 2) q1_back) (not (< (+ q1_front 1) q1_back)) (not (= (- C) (select q2 q2_back)))) (or (< (+ q1_front 2) q1_back) (<= q2_front q2_back) (not (< (+ q1_front 1) q1_back)) (not (= (- C) (select q2 q2_back)))) (or (< (+ q1_front 2) q1_back) (<= q2_back q2_front) (not (< (+ q1_front 1) q1_back)) (not (= (- C) (select q2 q2_back))))), 169072#(and (or (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (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 (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C)))), 169069#(and (or (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back))))), 169066#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (* 2 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 2 C)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= q2_back (+ q2_front 1)) (not (= C (select q1 (+ q1_back 1))))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 169070#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (* 2 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (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 1)))) (<= q2_front q2_back)) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 2 C)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1))))), 169073#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 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)))) (= q2_back q2_front)) (or (= C (select q1 q1_front)) (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)))) (= (select q1 (+ q1_front 1)) C))), 169060#(and (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= C total) (not (= (- C) (select q2 q2_back)))) (or (<= total C) (not (= (- C) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))))), 169067#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (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)))) (= (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)))))), 169064#(and (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= (* 2 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q1_back q1_front)) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 2 C)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 169053#(and (or (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total))) (or (< q1_front q1_back) (<= (+ (select q2 q2_front) total) 0))), 169059#(and (or (< (+ q1_front 1) q1_back) (<= (* 2 C) (+ total (select q1 q1_front))) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) (* 2 C)) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back)))), 169056#(and (or (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (* 2 C) (+ total (select q1 q1_front))) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) (* 2 C)) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (= (+ (select q2 q2_front) C) 0) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 169054#(and (or (= (+ (select q2 q2_front) C) 0) (< q1_front q1_back) (= q2_back q2_front)) (or (not (= (+ (select q2 q2_front) C) 0)) (< q1_front q1_back) (<= C total)) (or (not (= (+ (select q2 q2_front) C) 0)) (<= total C) (< q1_front q1_back))), 169052#(and (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0)) (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)))), 169071#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))))), 169057#(and (or (<= (* 2 C) total) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= total (* 2 C)) (not (= (- C) (select q2 q2_back))))), 169051#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1))) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0))), 169063#(and (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))))), 169068#(and (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= (* 2 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 2 C)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))))] [2022-03-15 21:54:26,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 21:54:26,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:26,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 21:54:26,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=2104, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 21:54:26,535 INFO L87 Difference]: Start difference. First operand 10433 states and 44589 transitions. Second operand has 35 states, 34 states have (on average 4.588235294117647) internal successors, (156), 34 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:55:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:55:11,243 INFO L93 Difference]: Finished difference Result 170420 states and 723083 transitions. [2022-03-15 21:55:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 282 states. [2022-03-15 21:55:11,243 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.588235294117647) internal successors, (156), 34 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:55:11,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:55:12,412 INFO L225 Difference]: With dead ends: 170420 [2022-03-15 21:55:12,412 INFO L226 Difference]: Without dead ends: 170304 [2022-03-15 21:55:12,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 165 SyntacticMatches, 19 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39665 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=9105, Invalid=85451, Unknown=0, NotChecked=0, Total=94556 [2022-03-15 21:55:12,423 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 1562 mSDsluCounter, 5652 mSDsCounter, 0 mSdLazyCounter, 9666 mSolverCounterSat, 566 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1562 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 10232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 566 IncrementalHoareTripleChecker+Valid, 9666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:55:12,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1562 Valid, 1590 Invalid, 10232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [566 Valid, 9666 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-03-15 21:55:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170304 states. [2022-03-15 21:55:14,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170304 to 11387. [2022-03-15 21:55:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11387 states, 11386 states have (on average 4.29264008431407) internal successors, (48876), 11386 states have internal predecessors, (48876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:55:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11387 states to 11387 states and 48876 transitions. [2022-03-15 21:55:14,779 INFO L78 Accepts]: Start accepts. Automaton has 11387 states and 48876 transitions. Word has length 30 [2022-03-15 21:55:14,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:55:14,779 INFO L470 AbstractCegarLoop]: Abstraction has 11387 states and 48876 transitions. [2022-03-15 21:55:14,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.588235294117647) internal successors, (156), 34 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:55:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand 11387 states and 48876 transitions. [2022-03-15 21:55:14,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:55:14,807 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:55:14,808 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:55:14,824 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:55:15,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:55:15,021 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:55:15,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:55:15,021 INFO L85 PathProgramCache]: Analyzing trace with hash 486247649, now seen corresponding path program 12 times [2022-03-15 21:55:15,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:55:15,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827257766] [2022-03-15 21:55:15,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:55:15,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:55:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:55:15,202 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:15,202 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:55:15,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827257766] [2022-03-15 21:55:15,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827257766] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:55:15,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656211313] [2022-03-15 21:55:15,203 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:55:15,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:55:15,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:55:15,205 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:55:15,206 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:55:15,237 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:55:15,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:55:15,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 21:55:15,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:55:15,407 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:55:15,407 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 35 treesize of output 17 [2022-03-15 21:55:15,525 INFO L353 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-03-15 21:55:15,525 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 31 treesize of output 35 [2022-03-15 21:55:15,621 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:15,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:55:16,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:55:16,707 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-03-15 21:55:16,707 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 53 treesize of output 57 [2022-03-15 21:55:16,800 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:55:16,801 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 62 [2022-03-15 21:55:16,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:16,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656211313] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:55:16,836 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:55:16,837 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 23 [2022-03-15 21:55:16,837 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [615641716] [2022-03-15 21:55:16,837 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:55:16,839 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:55:16,890 INFO L252 McrAutomatonBuilder]: Finished intersection with 227 states and 527 transitions. [2022-03-15 21:55:16,890 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:55:31,455 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [362997#(and (or (< (+ q1_front 2) q1_back) (<= q2_back (+ q2_front 1)) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (* 2 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< (+ q1_front 1) q1_back))) (or (= (+ (select q2 q2_front) C) 0) (< (+ q1_front 2) q1_back) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ q2_front 1) q2_back) (not (< (+ q1_front 1) q1_back))) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 2 C)) (< (+ q1_front 2) q1_back) (not (< (+ q1_front 1) q1_back)))), 363012#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 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)))) (= q2_back q2_front)) (or (= C (select q1 q1_front)) (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)))) (= (select q1 (+ q1_front 1)) C))), 363002#(and (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= (* 2 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q1_back q1_front)) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 2 C)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 362996#(and (or (< (+ q1_front 1) q1_back) (<= (* 2 C) (+ total (select q1 q1_front))) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) (* 2 C)) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back)))), 362995#(and (or (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (* 2 C) (+ total (select q1 q1_front))) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) (* 2 C)) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (= (+ (select q2 q2_front) C) 0) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 362994#(and (or (< q1_front q1_back) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back)))) (or (< q1_front q1_back) (<= total (* 2 C)) (not (= (- C) (select q2 q2_back)))) (or (< q1_front q1_back) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (< q1_front q1_back) (<= (* 2 C) total) (not (= (- C) (select q2 q2_back))))), 362991#(and (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (< (+ q1_front 2) q1_back) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (< (+ q1_front 1) q1_back)))), 362993#(and (or (<= (* 2 C) total) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= total (* 2 C)) (not (= (- C) (select q2 q2_back))))), 363007#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (* 2 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 2 C)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= q2_back (+ q2_front 1)) (not (= C (select q1 (+ q1_back 1))))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 363003#(and (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= (* 2 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 2 C)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back)))), 363005#(and (or (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back))))), 363008#(and (or (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (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 (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C)))), 363006#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (= C (select q1 (+ q1_back 1))))) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))))), 362989#(and (or (<= 0 (+ (select q2 q2_front) total (select q2 (+ q2_front 1)))) (< q1_front q1_back)) (or (< q1_front q1_back) (<= (+ (select q2 q2_front) total (select q2 (+ q2_front 1))) 0))), 363001#(and (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (<= q1_back q1_front))), 363004#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (<= total 0) (not (= (select q1 q1_back) 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 (<= 0 total) (not (= (select q1 q1_back) C)))), 362988#(and (or (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total))) (or (< q1_front q1_back) (<= (+ (select q2 q2_front) total) 0))), 363011#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))))), 363009#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (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)))) (= (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)))))), 362986#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1))) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0))), 363010#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (* 2 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (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 1)))) (<= q2_front q2_back)) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 2 C)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1))))), 362987#(and (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0)) (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)))), 362990#(and (or (< (+ q1_front 1) q1_back) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 363000#(and (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))))), 362998#(and (or (< (+ q1_front 2) q1_back) (<= (* 2 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< (+ q1_front 1) q1_back)) (not (= (- C) (select q2 q2_back)))) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 2 C)) (< (+ q1_front 2) q1_back) (not (< (+ q1_front 1) q1_back)) (not (= (- C) (select q2 q2_back)))) (or (< (+ q1_front 2) q1_back) (<= q2_front q2_back) (not (< (+ q1_front 1) q1_back)) (not (= (- C) (select q2 q2_back)))) (or (< (+ q1_front 2) q1_back) (<= q2_back q2_front) (not (< (+ q1_front 1) q1_back)) (not (= (- C) (select q2 q2_back))))), 362985#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 362999#(and (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= C total) (not (= (- C) (select q2 q2_back)))) (or (<= total C) (not (= (- C) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))))), 362992#(and (or (< q1_front q1_back) (<= (* 2 C) total)) (or (< q1_front q1_back) (<= q2_back (+ q2_front 1))) (or (= (+ (select q2 q2_front) C) 0) (< q1_front q1_back)) (or (< q1_front q1_back) (<= total (* 2 C))) (or (< q1_front q1_back) (<= (+ q2_front 1) q2_back)))] [2022-03-15 21:55:31,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 21:55:31,456 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:55:31,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 21:55:31,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2516, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 21:55:31,457 INFO L87 Difference]: Start difference. First operand 11387 states and 48876 transitions. Second operand has 39 states, 38 states have (on average 4.631578947368421) internal successors, (176), 38 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:55:44,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:55:44,896 INFO L93 Difference]: Finished difference Result 53212 states and 224339 transitions. [2022-03-15 21:55:44,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-03-15 21:55:44,897 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 4.631578947368421) internal successors, (176), 38 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have 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:55:44,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:55:45,268 INFO L225 Difference]: With dead ends: 53212 [2022-03-15 21:55:45,268 INFO L226 Difference]: Without dead ends: 53203 [2022-03-15 21:55:45,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 198 SyntacticMatches, 14 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 6248 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=2631, Invalid=18249, Unknown=0, NotChecked=0, Total=20880 [2022-03-15 21:55:45,275 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 2038 mSDsluCounter, 3812 mSDsCounter, 0 mSdLazyCounter, 6378 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2038 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 6909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 6378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:55:45,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2038 Valid, 973 Invalid, 6909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 6378 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-03-15 21:55:45,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53203 states. [2022-03-15 21:55:45,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53203 to 12211. [2022-03-15 21:55:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12211 states, 12210 states have (on average 4.299099099099099) internal successors, (52492), 12210 states have internal predecessors, (52492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:55:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12211 states to 12211 states and 52492 transitions. [2022-03-15 21:55:45,867 INFO L78 Accepts]: Start accepts. Automaton has 12211 states and 52492 transitions. Word has length 30 [2022-03-15 21:55:45,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:55:45,868 INFO L470 AbstractCegarLoop]: Abstraction has 12211 states and 52492 transitions. [2022-03-15 21:55:45,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 4.631578947368421) internal successors, (176), 38 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:55:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 12211 states and 52492 transitions. [2022-03-15 21:55:45,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:55:45,895 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:55:45,895 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:55:45,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-03-15 21:55:46,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:55:46,100 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:55:46,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:55:46,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1546665643, now seen corresponding path program 13 times [2022-03-15 21:55:46,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:55:46,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617991443] [2022-03-15 21:55:46,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:55:46,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:55:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:55:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:46,262 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:55:46,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617991443] [2022-03-15 21:55:46,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617991443] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:55:46,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676259936] [2022-03-15 21:55:46,263 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:55:46,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:55:46,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:55:46,264 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:55:46,264 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:55:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:55:46,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 21:55:46,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:55:46,514 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:55:46,516 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 49 treesize of output 31 [2022-03-15 21:55:46,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:55:46,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:55:46,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:46,593 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-03-15 21:55:46,616 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:46,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:55:46,794 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:55:46,795 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 59 treesize of output 77 [2022-03-15 21:55:46,941 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:55:46,942 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 61 [2022-03-15 21:55:47,016 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:47,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676259936] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:55:47,016 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:55:47,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-03-15 21:55:47,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [812257406] [2022-03-15 21:55:47,016 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:55:47,019 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:55:47,069 INFO L252 McrAutomatonBuilder]: Finished intersection with 207 states and 475 transitions. [2022-03-15 21:55:47,069 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:55:58,570 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [441043#(and (or (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (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 (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C)))), 441029#(and (or (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total))) (or (< q1_front q1_back) (<= (+ (select q2 q2_front) total) 0))), 441040#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (<= total 0) (not (= (select q1 q1_back) 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 (<= 0 total) (not (= (select q1 q1_back) C)))), 441028#(and (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0)) (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)))), 441035#(and (or (<= (+ total (select q1 q1_front)) C) (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 (<= C (+ total (select q1 q1_front))) (not (< q1_front q1_back))) (or (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back)))), 441030#(and (or (< q1_front q1_back) (< q2_front (+ q2_back 1))) (or (< q1_front q1_back) (<= C total) (not (= (select q2 q2_front) (* (- 1) C)))) (or (< q1_front q1_back) (<= q2_back q2_front)) (or (<= total C) (< q1_front q1_back) (not (= (select q2 q2_front) (* (- 1) C))))), 441046#(and (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (<= C (+ total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (not (= C (select q1 (+ q1_back 1)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C) (<= (+ q1_back 2) q1_front))), 441031#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 441044#(and (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 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 (< 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))) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= (select q1 (+ q1_front 1)) C) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= C (select q1 (+ q1_back 1)))) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (<= q2_back (+ q2_front 1)) (not (= C (select q1 (+ q1_back 1)))))), 441048#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 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)))) (= q2_back q2_front)) (or (= C (select q1 q1_front)) (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)))) (= (select q1 (+ q1_front 1)) C))), 441038#(and (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))))), 441034#(and (or (<= q2_back q2_front) (<= q1_back q1_front)) (or (<= q1_back q1_front) (<= (+ total (select q1 q1_front)) C) (not (= (select q2 q2_front) (* (- 1) C)))) (or (<= q1_back q1_front) (< q2_front (+ q2_back 1))) (or (<= C (+ total (select q1 q1_front))) (<= q1_back q1_front) (not (= (select q2 q2_front) (* (- 1) C))))), 441027#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 441026#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1))) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0))), 441042#(and (or (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back))))), 441037#(and (or (<= (+ total (select q1 q1_front)) C) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front) (not (< q1_front q1_back))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (<= C (+ total (select q1 q1_front))) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back)))), 441045#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (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)))) (= (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)))))), 441041#(and (or (not (= (select q1 q1_back) C)) (<= C (+ total (select q1 q1_front))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1))))), 441047#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))))), 441036#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= C total) (not (= (- C) (select q2 q2_back)))) (or (<= total C) (not (= (- C) (select q2 q2_back))))), 441039#(and (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= C (+ total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (< q1_front (+ q1_back 1)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 1))))), 441032#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front q1_back)))), 441033#(and (or (< (+ q1_front 1) q1_back) (<= C (+ total (select q1 q1_front))) (not (= (select q2 q2_front) (* (- 1) C))) (not (< q1_front q1_back))) (or (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) C) (not (= (select q2 q2_front) (* (- 1) C))) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)) (< q2_front (+ q2_back 1))))] [2022-03-15 21:55:58,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 21:55:58,571 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:55:58,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 21:55:58,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1661, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 21:55:58,572 INFO L87 Difference]: Start difference. First operand 12211 states and 52492 transitions. Second operand has 34 states, 33 states have (on average 4.606060606060606) internal successors, (152), 33 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:56:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:02,826 INFO L93 Difference]: Finished difference Result 60411 states and 252312 transitions. [2022-03-15 21:56:02,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-15 21:56:02,827 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 4.606060606060606) internal successors, (152), 33 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:56:02,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:03,259 INFO L225 Difference]: With dead ends: 60411 [2022-03-15 21:56:03,259 INFO L226 Difference]: Without dead ends: 60363 [2022-03-15 21:56:03,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 160 SyntacticMatches, 41 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3557 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1166, Invalid=7954, Unknown=0, NotChecked=0, Total=9120 [2022-03-15 21:56:03,260 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 752 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 2639 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 2879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 2639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:03,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [752 Valid, 462 Invalid, 2879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 2639 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 21:56:03,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60363 states. [2022-03-15 21:56:04,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60363 to 12511. [2022-03-15 21:56:04,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12511 states, 12510 states have (on average 4.292725819344525) internal successors, (53702), 12510 states have internal predecessors, (53702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12511 states to 12511 states and 53702 transitions. [2022-03-15 21:56:04,150 INFO L78 Accepts]: Start accepts. Automaton has 12511 states and 53702 transitions. Word has length 30 [2022-03-15 21:56:04,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:56:04,150 INFO L470 AbstractCegarLoop]: Abstraction has 12511 states and 53702 transitions. [2022-03-15 21:56:04,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.606060606060606) internal successors, (152), 33 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:56:04,150 INFO L276 IsEmpty]: Start isEmpty. Operand 12511 states and 53702 transitions. [2022-03-15 21:56:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:56:04,180 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:04,181 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:56:04,202 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:56:04,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:04,397 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:56:04,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:04,397 INFO L85 PathProgramCache]: Analyzing trace with hash 630262689, now seen corresponding path program 14 times [2022-03-15 21:56:04,398 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:04,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257446621] [2022-03-15 21:56:04,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:04,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:04,573 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:04,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257446621] [2022-03-15 21:56:04,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257446621] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:56:04,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736099387] [2022-03-15 21:56:04,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:56:04,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:04,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:56:04,574 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:56:04,575 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:56:04,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:56:04,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:56:04,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 21:56:04,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:56:04,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:56:04,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:56:04,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:04,955 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2022-03-15 21:56:04,981 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:56:04,981 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 36 treesize of output 18 [2022-03-15 21:56:05,012 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:05,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:56:05,202 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:56:05,202 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 59 treesize of output 77 [2022-03-15 21:56:05,400 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:56:05,401 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 61 [2022-03-15 21:56:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:05,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736099387] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:56:05,471 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:56:05,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-15 21:56:05,471 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [188177976] [2022-03-15 21:56:05,471 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:05,474 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:05,512 INFO L252 McrAutomatonBuilder]: Finished intersection with 202 states and 469 transitions. [2022-03-15 21:56:05,513 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:56:16,535 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [526792#(and (or (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back))))), 526781#(and (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (< 0 (+ total (select q1 q1_front) 1)) (not (< q1_front q1_back)))), 526787#(and (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= C (+ total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (< q1_front (+ q1_back 1)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 1))))), 526793#(and (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (<= C (+ total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (not (= C (select q1 (+ q1_back 1)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C) (<= (+ q1_back 2) q1_front))), 526783#(and (or (<= (+ total (select q1 q1_front)) C) (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 (<= C (+ total (select q1 q1_front))) (not (< q1_front q1_back))) (or (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back)))), 526784#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= C total) (not (= (- C) (select q2 q2_back)))) (or (<= total C) (not (= (- C) (select q2 q2_back))))), 526789#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (<= total 0) (not (= (select q1 q1_back) 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 (<= 0 total) (not (= (select q1 q1_back) C)))), 526794#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))))), 526788#(and (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 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 (< 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))) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= (select q1 (+ q1_front 1)) C) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= C (select q1 (+ q1_back 1)))) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (<= q2_back (+ q2_front 1)) (not (= C (select q1 (+ q1_back 1)))))), 526782#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 526780#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 526790#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (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)))) (= (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)))))), 526786#(and (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))))), 526791#(and (or (not (= (select q1 q1_back) C)) (<= C (+ total (select q1 q1_front))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1))))), 526785#(and (or (<= (+ total (select q1 q1_front)) C) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front) (not (< q1_front q1_back))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (<= C (+ total (select q1 q1_front))) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back)))), 526795#(and (or (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (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 (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C)))), 526796#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 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)))) (= q2_back q2_front)) (or (= C (select q1 q1_front)) (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)))) (= (select q1 (+ q1_front 1)) C)))] [2022-03-15 21:56:16,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 21:56:16,535 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:56:16,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 21:56:16,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1167, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 21:56:16,536 INFO L87 Difference]: Start difference. First operand 12511 states and 53702 transitions. Second operand has 28 states, 27 states have (on average 4.592592592592593) internal successors, (124), 27 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:18,853 INFO L93 Difference]: Finished difference Result 28489 states and 116869 transitions. [2022-03-15 21:56:18,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 21:56:18,854 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.592592592592593) internal successors, (124), 27 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have 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:56:18,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:18,956 INFO L225 Difference]: With dead ends: 28489 [2022-03-15 21:56:18,956 INFO L226 Difference]: Without dead ends: 28469 [2022-03-15 21:56:18,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 163 SyntacticMatches, 40 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1403 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=441, Invalid=3341, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 21:56:18,957 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 472 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:18,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [472 Valid, 224 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:56:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28469 states. [2022-03-15 21:56:19,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28469 to 12541. [2022-03-15 21:56:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12541 states, 12540 states have (on average 4.2956937799043065) internal successors, (53868), 12540 states have internal predecessors, (53868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12541 states to 12541 states and 53868 transitions. [2022-03-15 21:56:19,412 INFO L78 Accepts]: Start accepts. Automaton has 12541 states and 53868 transitions. Word has length 30 [2022-03-15 21:56:19,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:56:19,412 INFO L470 AbstractCegarLoop]: Abstraction has 12541 states and 53868 transitions. [2022-03-15 21:56:19,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.592592592592593) internal successors, (124), 27 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:19,412 INFO L276 IsEmpty]: Start isEmpty. Operand 12541 states and 53868 transitions. [2022-03-15 21:56:19,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:56:19,440 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:19,440 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:56:19,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-15 21:56:19,655 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,SelfDestructingSolverStorable21 [2022-03-15 21:56:19,655 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:56:19,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:19,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2051737701, now seen corresponding path program 15 times [2022-03-15 21:56:19,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:19,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234241387] [2022-03-15 21:56:19,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:19,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:19,820 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:19,820 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:19,820 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234241387] [2022-03-15 21:56:19,820 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234241387] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:56:19,820 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727564626] [2022-03-15 21:56:19,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:56:19,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:19,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:56:19,822 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:56:19,823 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:56:19,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:56:19,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:56:19,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 21:56:19,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:56:20,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:56:20,244 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:56:20,244 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 56 treesize of output 52 [2022-03-15 21:56:20,387 INFO L353 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-03-15 21:56:20,387 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 59 treesize of output 55 [2022-03-15 21:56:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:20,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:56:22,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:56:22,582 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-03-15 21:56:22,582 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 49 treesize of output 53 [2022-03-15 21:56:22,767 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:22,767 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:22,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:56:22,773 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:56:22,773 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 44 treesize of output 42 [2022-03-15 21:56:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:22,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727564626] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:56:22,850 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:56:22,850 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2022-03-15 21:56:22,850 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1932192885] [2022-03-15 21:56:22,850 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:22,853 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:22,898 INFO L252 McrAutomatonBuilder]: Finished intersection with 215 states and 491 transitions. [2022-03-15 21:56:22,898 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:56:32,483 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [580630#(and (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= C (+ total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (< q1_front (+ q1_back 1)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 1))))), 580639#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (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)))) (= (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)))))), 580625#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 580627#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (< q1_front q1_back))) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (< q1_front q1_back)))), 580621#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= C total) (not (= (- C) (select q2 q2_back)))) (or (<= total C) (not (= (- C) (select q2 q2_back))))), 580631#(and (or (<= (+ total (select q1 q1_front)) C) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front) (not (< q1_front q1_back))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (<= C (+ total (select q1 q1_front))) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back)))), 580623#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 580632#(and (or (not (= (select q1 q1_back) C)) (<= C (+ total (select q1 q1_front))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1))))), 580635#(and (or (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back))))), 580637#(and (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 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 (< 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))) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= (select q1 (+ q1_front 1)) C) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= C (select q1 (+ q1_back 1)))) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (<= q2_back (+ q2_front 1)) (not (= C (select q1 (+ q1_back 1)))))), 580641#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))))), 580640#(and (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (<= C (+ total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (not (= C (select q1 (+ q1_back 1)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C) (<= (+ q1_back 2) q1_front))), 580629#(and (or (not (= (select q1 q1_back) C)) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (< q1_front (+ q1_back 1)))) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front))), 580636#(and (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (= C (select q1 (+ q1_back 1)))))), 580634#(and (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))))), 580624#(and (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0)) (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)))), 580622#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1))) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0))), 580626#(and (or (<= q1_back q1_front) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front)))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q1_back q1_front))), 580628#(and (or (<= (+ total (select q1 q1_front)) C) (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 (<= C (+ total (select q1 q1_front))) (not (< q1_front q1_back))) (or (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back)))), 580642#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 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)))) (= q2_back q2_front)) (or (= C (select q1 q1_front)) (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)))) (= (select q1 (+ q1_front 1)) C))), 580633#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (<= total 0) (not (= (select q1 q1_back) 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 (<= 0 total) (not (= (select q1 q1_back) C)))), 580638#(and (or (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (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 (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))))] [2022-03-15 21:56:32,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:56:32,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:56:32,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:56:32,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=2278, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 21:56:32,485 INFO L87 Difference]: Start difference. First operand 12541 states and 53868 transitions. Second operand has 33 states, 32 states have (on average 4.6875) internal successors, (150), 32 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:56:35,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:35,738 INFO L93 Difference]: Finished difference Result 34372 states and 143818 transitions. [2022-03-15 21:56:35,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 21:56:35,739 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.6875) internal successors, (150), 32 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 30 [2022-03-15 21:56:35,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:35,880 INFO L225 Difference]: With dead ends: 34372 [2022-03-15 21:56:35,880 INFO L226 Difference]: Without dead ends: 34363 [2022-03-15 21:56:35,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 175 SyntacticMatches, 27 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=694, Invalid=5948, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 21:56:35,883 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 686 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 2879 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 3024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 2879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:35,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [686 Valid, 466 Invalid, 3024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 2879 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 21:56:35,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34363 states. [2022-03-15 21:56:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34363 to 12949. [2022-03-15 21:56:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12949 states, 12948 states have (on average 4.296570898980537) internal successors, (55632), 12948 states have internal predecessors, (55632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12949 states to 12949 states and 55632 transitions. [2022-03-15 21:56:36,363 INFO L78 Accepts]: Start accepts. Automaton has 12949 states and 55632 transitions. Word has length 30 [2022-03-15 21:56:36,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:56:36,363 INFO L470 AbstractCegarLoop]: Abstraction has 12949 states and 55632 transitions. [2022-03-15 21:56:36,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.6875) internal successors, (150), 32 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:56:36,364 INFO L276 IsEmpty]: Start isEmpty. Operand 12949 states and 55632 transitions. [2022-03-15 21:56:36,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:56:36,394 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:36,394 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:56:36,423 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:56:36,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:36,610 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:56:36,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:36,610 INFO L85 PathProgramCache]: Analyzing trace with hash 999658529, now seen corresponding path program 16 times [2022-03-15 21:56:36,611 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:36,611 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279864323] [2022-03-15 21:56:36,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:36,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:36,807 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:36,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279864323] [2022-03-15 21:56:36,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279864323] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:56:36,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749228916] [2022-03-15 21:56:36,807 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:56:36,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:36,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:56:36,808 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:56:36,809 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:56:36,840 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:56:36,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:56:36,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 21:56:36,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:56:37,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:56:37,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:37,190 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 47 [2022-03-15 21:56:37,213 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:56:37,214 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 14 [2022-03-15 21:56:37,244 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:37,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:56:37,398 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:56:37,398 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 59 treesize of output 77 [2022-03-15 21:56:37,515 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:56:37,515 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 61 [2022-03-15 21:56:37,574 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:37,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749228916] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:56:37,574 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:56:37,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-03-15 21:56:37,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1108972832] [2022-03-15 21:56:37,574 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:37,577 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:37,624 INFO L252 McrAutomatonBuilder]: Finished intersection with 222 states and 517 transitions. [2022-03-15 21:56:37,625 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:56:51,093 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [641171#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (< q1_front q1_back))) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (< q1_front q1_back)))), 641179#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (<= total 0) (not (= (select q1 q1_back) 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 (<= 0 total) (not (= (select q1 q1_back) C)))), 641180#(and (or (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back))))), 641182#(and (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 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 (< 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))) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= (select q1 (+ q1_front 1)) C) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= C (select q1 (+ q1_back 1)))) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (<= q2_back (+ q2_front 1)) (not (= C (select q1 (+ q1_back 1)))))), 641178#(and (or (not (= (select q1 q1_back) C)) (<= C (+ total (select q1 q1_front))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1))))), 641187#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 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)))) (= q2_back q2_front)) (or (= C (select q1 q1_front)) (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)))) (= (select q1 (+ q1_front 1)) C))), 641177#(and (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))))), 641170#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 641168#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 641185#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))))), 641181#(and (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (= C (select q1 (+ q1_back 1)))))), 641186#(and (or (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (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 (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C)))), 641173#(and (or (not (= (select q1 q1_back) C)) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (< q1_front (+ q1_back 1)))) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front))), 641176#(and (or (<= (+ total (select q1 q1_front)) C) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front) (not (< q1_front q1_back))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (<= C (+ total (select q1 q1_front))) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back)))), 641172#(and (or (<= (+ total (select q1 q1_front)) C) (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 (<= C (+ total (select q1 q1_front))) (not (< q1_front q1_back))) (or (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back)))), 641174#(and (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= C (+ total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (< q1_front (+ q1_back 1)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 1))))), 641175#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= C total) (not (= (- C) (select q2 q2_back)))) (or (<= total C) (not (= (- C) (select q2 q2_back))))), 641184#(and (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (<= C (+ total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (not (= C (select q1 (+ q1_back 1)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C) (<= (+ q1_back 2) q1_front))), 641183#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (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)))) (= (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)))))), 641169#(and (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (< 0 (+ total (select q1 q1_front) 1)) (not (< q1_front q1_back))))] [2022-03-15 21:56:51,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 21:56:51,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:56:51,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 21:56:51,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1325, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 21:56:51,093 INFO L87 Difference]: Start difference. First operand 12949 states and 55632 transitions. Second operand has 31 states, 30 states have (on average 4.6) internal successors, (138), 30 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:54,115 INFO L93 Difference]: Finished difference Result 34075 states and 143412 transitions. [2022-03-15 21:56:54,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 21:56:54,116 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.6) internal successors, (138), 30 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have 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:56:54,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:54,264 INFO L225 Difference]: With dead ends: 34075 [2022-03-15 21:56:54,264 INFO L226 Difference]: Without dead ends: 34066 [2022-03-15 21:56:54,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 191 SyntacticMatches, 30 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1523 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=473, Invalid=4357, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 21:56:54,265 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 634 mSDsluCounter, 1719 mSDsCounter, 0 mSdLazyCounter, 3148 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 3282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 3148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:54,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [634 Valid, 492 Invalid, 3282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 3148 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 21:56:54,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34066 states. [2022-03-15 21:56:54,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34066 to 13017. [2022-03-15 21:56:54,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13017 states, 13016 states have (on average 4.30039950829748) internal successors, (55974), 13016 states have internal predecessors, (55974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13017 states to 13017 states and 55974 transitions. [2022-03-15 21:56:54,843 INFO L78 Accepts]: Start accepts. Automaton has 13017 states and 55974 transitions. Word has length 30 [2022-03-15 21:56:54,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:56:54,843 INFO L470 AbstractCegarLoop]: Abstraction has 13017 states and 55974 transitions. [2022-03-15 21:56:54,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.6) internal successors, (138), 30 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:54,843 INFO L276 IsEmpty]: Start isEmpty. Operand 13017 states and 55974 transitions. [2022-03-15 21:56:54,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:56:54,876 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:54,876 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:56:54,893 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:56:55,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:55,092 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:56:55,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:55,093 INFO L85 PathProgramCache]: Analyzing trace with hash -787704725, now seen corresponding path program 17 times [2022-03-15 21:56:55,099 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:55,099 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745518707] [2022-03-15 21:56:55,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:55,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:55,312 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:55,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745518707] [2022-03-15 21:56:55,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745518707] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:56:55,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614251540] [2022-03-15 21:56:55,312 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:56:55,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:55,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:56:55,313 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:56:55,315 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:56:55,344 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 21:56:55,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:56:55,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 21:56:55,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:56:55,573 INFO L353 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-03-15 21:56:55,573 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 41 treesize of output 45 [2022-03-15 21:56:55,682 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:56:55,682 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 35 treesize of output 17 [2022-03-15 21:56:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:55,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:56:56,076 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:56:56,077 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 54 treesize of output 72 [2022-03-15 21:56:56,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:56:56,429 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-03-15 21:56:56,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 41 [2022-03-15 21:56:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:56,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614251540] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:56:56,457 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:56:56,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2022-03-15 21:56:56,457 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1020181686] [2022-03-15 21:56:56,457 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:56,460 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:56,510 INFO L252 McrAutomatonBuilder]: Finished intersection with 243 states and 551 transitions. [2022-03-15 21:56:56,510 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:57:14,987 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [701568#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (< (+ q1_front 2) q1_back) (<= q2_back q2_front) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)) (not (< (+ q1_front 1) q1_back)))), 701561#(and (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0)) (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)))), 701588#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 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)))) (= q2_back q2_front)) (or (= C (select q1 q1_front)) (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)))) (= (select q1 (+ q1_front 1)) C))), 701578#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (<= total 0) (not (= (select q1 q1_back) 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 (<= 0 total) (not (= (select q1 q1_back) C)))), 701585#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (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)))) (= (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)))))), 701576#(and (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (< q2_front (+ q2_back 1))) (or (not (= (select q1 q1_back) C)) (<= C (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back q1_front) (not (= (select q2 q2_front) (* (- 1) C)))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (<= q1_back q1_front)) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) C) (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= (select q2 q2_front) (* (- 1) C))))), 701564#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front q1_back)))), 701573#(and (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 701579#(and (or (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front))), 701571#(and (or (<= C (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q2 q2_front) (* (- 1) C))) (<= q1_back (+ q1_front 1))) (or (<= q1_back (+ q1_front 1)) (< q2_front (+ q2_back 1))) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) C) (not (= (select q2 q2_front) (* (- 1) C))) (<= q1_back (+ q1_front 1))) (or (<= q2_back q2_front) (<= q1_back (+ q1_front 1)))), 701575#(and (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= C (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back q1_front)) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)) (< q2_front (+ q2_back 1)))), 701583#(and (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= C (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (select q2 q2_front) (* (- 1) C)))) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) C) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (select q2 q2_front) (* (- 1) C)))) (or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (< q2_front (+ q2_back 1)))), 701577#(and (or (not (= (select q1 q1_back) C)) (< q2_front (+ q2_back 1))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= (+ C total) 0) (not (= (select q2 q2_front) (* (- 1) C)))) (or (= C (select q1 q1_front)) (not (= (select q1 q1_back) C)) (not (= (select q2 q2_front) (* (- 1) C)))) (or (not (= (select q1 q1_back) C)) (not (= (select q2 q2_front) (* (- 1) C))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (not (= (select q2 q2_front) (* (- 1) C))) (<= 0 (+ C total)))), 701587#(and (or (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (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 (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C)))), 701584#(and (or (= C (select q1 q1_front)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (select q2 q2_front) (* (- 1) C)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (select q2 q2_front) (* (- 1) C))) (<= 0 (+ C total))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (select q2 q2_front) (* (- 1) C))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= (+ C total) 0) (not (= C (select q1 (+ q1_back 1)))) (not (= (select q2 q2_front) (* (- 1) C)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (< q2_front (+ q2_back 1))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))))), 701560#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 701574#(and (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 701563#(and (or (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total))) (or (< q1_front q1_back) (<= (+ (select q2 q2_front) total) 0))), 701566#(and (or (< (+ q1_front 1) q1_back) (<= C (+ total (select q1 q1_front))) (not (= (select q2 q2_front) (* (- 1) C))) (not (< q1_front q1_back))) (or (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) C) (not (= (select q2 q2_front) (* (- 1) C))) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)) (< q2_front (+ q2_back 1)))), 701570#(and (or (< (+ q1_front 2) q1_back) (not (< (+ q1_front 1) q1_back)) (< q2_front (+ q2_back 1))) (or (< (+ q1_front 2) q1_back) (<= q2_back q2_front) (not (< (+ q1_front 1) q1_back))) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) C) (< (+ q1_front 2) q1_back) (not (= (select q2 q2_front) (* (- 1) C))) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= C (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q2 q2_front) (* (- 1) C))) (not (< (+ q1_front 1) q1_back)))), 701582#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ 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)))) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))) (< q2_front (+ q2_back 1)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 701586#(and (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (+ C (select q2 q2_back)) 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)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))))), 701572#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back))))), 701569#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (< (+ q1_front 2) q1_back) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< (+ q1_front 1) q1_back)))), 701581#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 701567#(and (or (<= q2_back q2_front) (<= q1_back q1_front)) (or (<= q1_back q1_front) (<= (+ total (select q1 q1_front)) C) (not (= (select q2 q2_front) (* (- 1) C)))) (or (<= q1_back q1_front) (< q2_front (+ q2_back 1))) (or (<= C (+ total (select q1 q1_front))) (<= q1_back q1_front) (not (= (select q2 q2_front) (* (- 1) C))))), 701580#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)))), 701562#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 701565#(and (or (< q1_front q1_back) (< q2_front (+ q2_back 1))) (or (< q1_front q1_back) (<= C total) (not (= (select q2 q2_front) (* (- 1) C)))) (or (< q1_front q1_back) (<= q2_back q2_front)) (or (<= total C) (< q1_front q1_back) (not (= (select q2 q2_front) (* (- 1) C))))), 701559#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1))) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0)))] [2022-03-15 21:57:14,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 21:57:14,987 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:57:14,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 21:57:14,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=2731, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 21:57:14,988 INFO L87 Difference]: Start difference. First operand 13017 states and 55974 transitions. Second operand has 41 states, 40 states have (on average 4.525) internal successors, (181), 40 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:48,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:57:48,705 INFO L93 Difference]: Finished difference Result 109168 states and 448547 transitions. [2022-03-15 21:57:48,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 260 states. [2022-03-15 21:57:48,705 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 4.525) internal successors, (181), 40 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have 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:57:48,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:57:49,228 INFO L225 Difference]: With dead ends: 109168 [2022-03-15 21:57:49,228 INFO L226 Difference]: Without dead ends: 109078 [2022-03-15 21:57:49,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 184 SyntacticMatches, 41 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34579 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=9482, Invalid=76074, Unknown=0, NotChecked=0, Total=85556 [2022-03-15 21:57:49,233 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 2979 mSDsluCounter, 4998 mSDsCounter, 0 mSdLazyCounter, 8283 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2979 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 9160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 8283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:57:49,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2979 Valid, 1332 Invalid, 9160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 8283 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-03-15 21:57:49,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109078 states. [2022-03-15 21:57:50,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109078 to 13455. [2022-03-15 21:57:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13455 states, 13454 states have (on average 4.293815965512115) internal successors, (57769), 13454 states have internal predecessors, (57769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13455 states to 13455 states and 57769 transitions. [2022-03-15 21:57:50,671 INFO L78 Accepts]: Start accepts. Automaton has 13455 states and 57769 transitions. Word has length 30 [2022-03-15 21:57:50,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:57:50,671 INFO L470 AbstractCegarLoop]: Abstraction has 13455 states and 57769 transitions. [2022-03-15 21:57:50,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 4.525) internal successors, (181), 40 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:50,671 INFO L276 IsEmpty]: Start isEmpty. Operand 13455 states and 57769 transitions. [2022-03-15 21:57:50,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:57:50,701 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:57:50,701 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:57:50,717 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:57:50,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:50,915 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:57:50,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:57:50,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1704107679, now seen corresponding path program 18 times [2022-03-15 21:57:50,917 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:57:50,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853065498] [2022-03-15 21:57:50,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:57:50,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:57:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:57:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:51,127 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:57:51,127 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853065498] [2022-03-15 21:57:51,127 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853065498] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:57:51,127 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009883256] [2022-03-15 21:57:51,127 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:57:51,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:51,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:57:51,128 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:57:51,129 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:57:51,167 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:57:51,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:57:51,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 21:57:51,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:57:51,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:57:51,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:57:51,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 33 [2022-03-15 21:57:51,526 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:57:51,527 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 14 [2022-03-15 21:57:51,557 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:51,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:57:51,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:57:51,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:57:51,762 INFO L353 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2022-03-15 21:57:51,762 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 68 [2022-03-15 21:57:51,922 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:57:51,923 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 61 [2022-03-15 21:57:52,008 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:52,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009883256] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:57:52,008 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:57:52,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-03-15 21:57:52,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1017860698] [2022-03-15 21:57:52,009 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:57:52,011 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:57:52,056 INFO L252 McrAutomatonBuilder]: Finished intersection with 238 states and 545 transitions. [2022-03-15 21:57:52,056 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:58:04,618 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [838357#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 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)))) (= q2_back q2_front)) (or (= C (select q1 q1_front)) (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)))) (= (select q1 (+ q1_front 1)) C))), 838345#(and (or (<= 0 (+ total (select q1 q1_front))) (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 1)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (= q2_back q2_front)) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front (+ q1_back 1)))) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (< q1_front (+ q1_back 1))))), 838338#(and (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (< 0 (+ total (select q1 q1_front) 1)) (not (< q1_front q1_back)))), 838354#(and (or (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front))), 838341#(and (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (< q1_front q1_back)))), 838353#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (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)))) (= (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)))))), 838356#(and (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (+ C (select q2 q2_back)) 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)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))))), 838352#(and (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (<= (+ C total) 0) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 0 (+ C total))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 838339#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 838348#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back))))), 838343#(and (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 838344#(and (or (not (= (select q1 q1_back) C)) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 1))))), 838351#(and (or (<= 0 (+ total (select q1 q1_front))) (not (= (+ (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 q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (not (= C (select q1 (+ q1_back 1)))) (<= (+ total (select q1 q1_front)) 0)) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front) (<= (+ q1_back 2) q1_front)) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 2))) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (= C (select q1 (+ q1_back 1)))))), 838337#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 838350#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 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))) (not (= C (select q1 (+ q1_back 1)))) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))))), 838346#(and (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (<= (+ C total) 0)) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (<= 0 (+ C total))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)))), 838349#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)))), 838347#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (<= total 0) (not (= (select q1 q1_back) 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 (<= 0 total) (not (= (select q1 q1_back) C)))), 838342#(and (or (= (+ (select q2 q2_front) C) 0) (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= 0 (+ total (select q1 q1_front))) (not (= (+ (select q2 q2_front) C) 0)) (not (< q1_front q1_back))) (or (not (= (+ (select q2 q2_front) C) 0)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (< q1_front q1_back))) (or (not (= (+ (select q2 q2_front) C) 0)) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front q1_back)))), 838355#(and (or (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (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 (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C)))), 838340#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (< (+ q1_front 2) q1_back) (<= q2_back q2_front) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)) (not (< (+ q1_front 1) q1_back))))] [2022-03-15 21:58:04,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 21:58:04,619 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:58:04,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 21:58:04,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1574, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 21:58:04,620 INFO L87 Difference]: Start difference. First operand 13455 states and 57769 transitions. Second operand has 32 states, 31 states have (on average 4.67741935483871) internal successors, (145), 31 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:58:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:58:10,600 INFO L93 Difference]: Finished difference Result 40779 states and 165658 transitions. [2022-03-15 21:58:10,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-03-15 21:58:10,600 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.67741935483871) internal successors, (145), 31 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have 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:58:10,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:58:10,759 INFO L225 Difference]: With dead ends: 40779 [2022-03-15 21:58:10,760 INFO L226 Difference]: Without dead ends: 40759 [2022-03-15 21:58:10,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 191 SyntacticMatches, 42 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4600 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1419, Invalid=11013, Unknown=0, NotChecked=0, Total=12432 [2022-03-15 21:58:10,761 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 713 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 2742 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 2919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 2742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:58:10,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [713 Valid, 382 Invalid, 2919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 2742 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 21:58:10,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40759 states. [2022-03-15 21:58:11,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40759 to 13371. [2022-03-15 21:58:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13371 states, 13370 states have (on average 4.301346297681376) internal successors, (57509), 13370 states have internal predecessors, (57509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:58:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13371 states to 13371 states and 57509 transitions. [2022-03-15 21:58:11,323 INFO L78 Accepts]: Start accepts. Automaton has 13371 states and 57509 transitions. Word has length 30 [2022-03-15 21:58:11,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:58:11,323 INFO L470 AbstractCegarLoop]: Abstraction has 13371 states and 57509 transitions. [2022-03-15 21:58:11,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.67741935483871) internal successors, (145), 31 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:58:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 13371 states and 57509 transitions. [2022-03-15 21:58:11,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:58:11,352 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:58:11,352 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:58:11,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-03-15 21:58:11,555 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,SelfDestructingSolverStorable25 [2022-03-15 21:58:11,556 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:58:11,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:58:11,556 INFO L85 PathProgramCache]: Analyzing trace with hash -874943519, now seen corresponding path program 19 times [2022-03-15 21:58:11,557 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:58:11,557 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392112554] [2022-03-15 21:58:11,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:58:11,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:58:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:58:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:58:11,791 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:58:11,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392112554] [2022-03-15 21:58:11,791 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392112554] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:58:11,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532004116] [2022-03-15 21:58:11,791 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:58:11,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:58:11,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:58:11,792 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:58:11,796 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:58:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:58:11,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 21:58:11,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:58:12,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:58:12,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:58:12,125 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 24 [2022-03-15 21:58:12,171 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:58:12,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 14 [2022-03-15 21:58:12,201 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:58:12,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:58:12,371 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:58:12,371 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 59 treesize of output 77 [2022-03-15 21:58:12,499 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:58:12,499 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 61 [2022-03-15 21:58:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:58:12,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532004116] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:58:12,549 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:58:12,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-03-15 21:58:12,549 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [186981274] [2022-03-15 21:58:12,549 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:58:12,552 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:58:12,603 INFO L252 McrAutomatonBuilder]: Finished intersection with 254 states and 593 transitions. [2022-03-15 21:58:12,603 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:58:24,206 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [906230#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 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)))) (= q2_back q2_front)) (or (= C (select q1 q1_front)) (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)))) (= (select q1 (+ q1_front 1)) C))), 906219#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (<= total 0) (not (= (select q1 q1_back) 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 (<= 0 total) (not (= (select q1 q1_back) C)))), 906212#(and (or (< (+ q1_front 2) q1_back) (< 0 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (< (+ q1_front 1) q1_back)))), 906220#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (< 0 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)))), 906215#(and (or (<= 0 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0))), 906217#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))))), 906229#(and (or (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (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 (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C)))), 906226#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back))))), 906228#(and (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (+ C (select q2 q2_back)) 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)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))))), 906223#(and (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 906211#(and (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (< 0 (+ total (select q1 q1_front) 1)) (not (< q1_front q1_back)))), 906214#(and (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (< 0 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)))), 906218#(and (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (<= (+ C total) 0)) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (<= 0 (+ C total))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)))), 906221#(and (or (<= 0 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= C (select q1 (+ q1_back 1)))))), 906216#(and (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 906227#(and (or (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front))), 906222#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 906225#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (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)))) (= (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)))))), 906213#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (< (+ q1_front 2) q1_back) (<= q2_back q2_front) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)) (not (< (+ q1_front 1) q1_back)))), 906224#(and (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (<= (+ C total) 0) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 0 (+ C total))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 906210#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back)))] [2022-03-15 21:58:24,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 21:58:24,206 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:58:24,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 21:58:24,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1369, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 21:58:24,207 INFO L87 Difference]: Start difference. First operand 13371 states and 57509 transitions. Second operand has 32 states, 31 states have (on average 4.806451612903226) internal successors, (149), 31 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:58:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:58:34,938 INFO L93 Difference]: Finished difference Result 64864 states and 265676 transitions. [2022-03-15 21:58:34,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2022-03-15 21:58:34,938 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.806451612903226) internal successors, (149), 31 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have 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:58:34,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:58:35,224 INFO L225 Difference]: With dead ends: 64864 [2022-03-15 21:58:35,225 INFO L226 Difference]: Without dead ends: 64835 [2022-03-15 21:58:35,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 211 SyntacticMatches, 41 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8921 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2431, Invalid=22691, Unknown=0, NotChecked=0, Total=25122 [2022-03-15 21:58:35,226 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 1033 mSDsluCounter, 2666 mSDsCounter, 0 mSdLazyCounter, 4881 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 5142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 4881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:58:35,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1033 Valid, 775 Invalid, 5142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 4881 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 21:58:35,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64835 states. [2022-03-15 21:58:36,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64835 to 13451. [2022-03-15 21:58:36,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13451 states, 13450 states have (on average 4.3028996282527885) internal successors, (57874), 13450 states have internal predecessors, (57874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:58:36,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13451 states to 13451 states and 57874 transitions. [2022-03-15 21:58:36,129 INFO L78 Accepts]: Start accepts. Automaton has 13451 states and 57874 transitions. Word has length 30 [2022-03-15 21:58:36,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:58:36,129 INFO L470 AbstractCegarLoop]: Abstraction has 13451 states and 57874 transitions. [2022-03-15 21:58:36,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.806451612903226) internal successors, (149), 31 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:58:36,130 INFO L276 IsEmpty]: Start isEmpty. Operand 13451 states and 57874 transitions. [2022-03-15 21:58:36,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:58:36,159 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:58:36,159 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:58:36,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-03-15 21:58:36,375 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,SelfDestructingSolverStorable26 [2022-03-15 21:58:36,375 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:58:36,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:58:36,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1981454427, now seen corresponding path program 20 times [2022-03-15 21:58:36,377 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:58:36,377 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247667243] [2022-03-15 21:58:36,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:58:36,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:58:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:58:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:58:36,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:58:36,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247667243] [2022-03-15 21:58:36,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247667243] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:58:36,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069426312] [2022-03-15 21:58:36,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:58:36,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:58:36,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:58:36,571 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:58:36,572 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:58:36,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:58:36,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:58:36,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 21:58:36,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:58:36,927 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:58:36,927 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 61 treesize of output 43 [2022-03-15 21:58:36,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:58:36,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:58:36,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:58:36,969 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-03-15 21:58:37,000 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:58:37,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:58:37,150 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:58:37,150 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 59 treesize of output 77 [2022-03-15 21:58:37,295 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:58:37,295 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 61 [2022-03-15 21:58:37,380 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:58:37,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069426312] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:58:37,380 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:58:37,381 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-03-15 21:58:37,381 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [668744413] [2022-03-15 21:58:37,381 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:58:37,383 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:58:37,428 INFO L252 McrAutomatonBuilder]: Finished intersection with 219 states and 487 transitions. [2022-03-15 21:58:37,429 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:58:46,860 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [998435#(and (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 998431#(and (or (<= q1_back q1_front) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front)))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q1_back q1_front))), 998434#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back))))), 998437#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))))), 998438#(and (or (not (= (select q1 q1_back) C)) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0)) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) C)))), 998440#(and (or (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front))), 998447#(and (or (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (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 (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C)))), 998433#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (<= q1_back (+ q1_front 1))) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= q1_back (+ q1_front 1)))), 998448#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 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)))) (= q2_back q2_front)) (or (= C (select q1 q1_front)) (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)))) (= (select q1 (+ q1_front 1)) C))), 998432#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (< (+ q1_front 2) q1_back) (<= q2_back q2_front) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)) (not (< (+ q1_front 1) q1_back)))), 998443#(and (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 998446#(and (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (+ C (select q2 q2_back)) 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)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))))), 998429#(and (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0)) (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)))), 998430#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 998445#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (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)))) (= (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)))))), 998427#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1))) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0))), 998439#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (<= total 0) (not (= (select q1 q1_back) 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 (<= 0 total) (not (= (select q1 q1_back) C)))), 998442#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))))), 998428#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 998436#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (<= q1_back q1_front)) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))))), 998441#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)))), 998444#(and (or (not (= (select q1 q1_back) C)) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (= C (select q1 (+ q1_back 1))))) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))))] [2022-03-15 21:58:46,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:58:46,861 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:58:46,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:58:46,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 21:58:46,861 INFO L87 Difference]: Start difference. First operand 13451 states and 57874 transitions. Second operand has 33 states, 32 states have (on average 4.71875) internal successors, (151), 32 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:58:52,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:58:52,382 INFO L93 Difference]: Finished difference Result 41990 states and 173980 transitions. [2022-03-15 21:58:52,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-03-15 21:58:52,382 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.71875) internal successors, (151), 32 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have 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:58:52,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:58:52,536 INFO L225 Difference]: With dead ends: 41990 [2022-03-15 21:58:52,537 INFO L226 Difference]: Without dead ends: 41972 [2022-03-15 21:58:52,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 189 SyntacticMatches, 28 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1048, Invalid=8264, Unknown=0, NotChecked=0, Total=9312 [2022-03-15 21:58:52,538 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 828 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 4733 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 4928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 4733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:58:52,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [828 Valid, 755 Invalid, 4928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 4733 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 21:58:52,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41972 states. [2022-03-15 21:58:53,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41972 to 13775. [2022-03-15 21:58:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13775 states, 13774 states have (on average 4.302018295339044) internal successors, (59256), 13774 states have internal predecessors, (59256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:58:53,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13775 states to 13775 states and 59256 transitions. [2022-03-15 21:58:53,085 INFO L78 Accepts]: Start accepts. Automaton has 13775 states and 59256 transitions. Word has length 30 [2022-03-15 21:58:53,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:58:53,085 INFO L470 AbstractCegarLoop]: Abstraction has 13775 states and 59256 transitions. [2022-03-15 21:58:53,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.71875) internal successors, (151), 32 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:58:53,085 INFO L276 IsEmpty]: Start isEmpty. Operand 13775 states and 59256 transitions. [2022-03-15 21:58:53,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:58:53,227 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:58:53,227 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:58:53,244 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:58:53,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 21:58:53,436 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:58:53,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:58:53,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1261433697, now seen corresponding path program 21 times [2022-03-15 21:58:53,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:58:53,438 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148455922] [2022-03-15 21:58:53,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:58:53,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:58:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:58:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:58:53,568 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:58:53,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148455922] [2022-03-15 21:58:53,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148455922] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:58:53,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847186042] [2022-03-15 21:58:53,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:58:53,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:58:53,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:58:53,570 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:58:53,571 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:58:53,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:58:53,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:58:53,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 21:58:53,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:58:53,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:58:53,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:58:53,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:58:53,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 48 [2022-03-15 21:58:53,950 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 21:58:53,950 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 38 treesize of output 14 [2022-03-15 21:58:53,981 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:58:53,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:58:54,135 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:58:54,135 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 58 treesize of output 76 [2022-03-15 21:58:54,291 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:58:54,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 61 [2022-03-15 21:58:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:58:54,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847186042] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:58:54,363 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:58:54,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-03-15 21:58:54,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [175723473] [2022-03-15 21:58:54,363 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:58:54,366 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:58:54,412 INFO L252 McrAutomatonBuilder]: Finished intersection with 226 states and 513 transitions. [2022-03-15 21:58:54,412 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:59:03,699 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [1068306#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 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))) (not (= C (select q1 (+ q1_back 1)))) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))))), 1068300#(and (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 1068309#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (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)))) (= (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)))))), 1068297#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 1068307#(and (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 1068314#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 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)))) (= q2_back q2_front)) (or (= C (select q1 q1_front)) (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)))) (= (select q1 (+ q1_front 1)) C))), 1068296#(and (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (< 0 (+ total (select q1 q1_front) 1)) (not (< q1_front q1_back)))), 1068308#(and (or (not (= (select q1 q1_back) C)) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (= C (select q1 (+ q1_back 1))))) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 1068310#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back))))), 1068303#(and (or (not (= (select q1 q1_back) C)) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0)) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) C)))), 1068295#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 1068298#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (< (+ q1_front 2) q1_back) (<= q2_back q2_front) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)) (not (< (+ q1_front 1) q1_back)))), 1068299#(and (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (< q1_front q1_back)))), 1068312#(and (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (+ C (select q2 q2_back)) 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)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))))), 1068302#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))))), 1068304#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (<= total 0) (not (= (select q1 q1_back) 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 (<= 0 total) (not (= (select q1 q1_back) C)))), 1068313#(and (or (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (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 (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C)))), 1068305#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)))), 1068311#(and (or (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front))), 1068301#(and (or (not (= (select q1 q1_back) C)) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 1)))))] [2022-03-15 21:59:03,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 21:59:03,700 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:59:03,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 21:59:03,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1221, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 21:59:03,701 INFO L87 Difference]: Start difference. First operand 13775 states and 59256 transitions. Second operand has 31 states, 30 states have (on average 4.633333333333334) internal successors, (139), 30 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:59:07,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:59:07,805 INFO L93 Difference]: Finished difference Result 45039 states and 186029 transitions. [2022-03-15 21:59:07,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-03-15 21:59:07,805 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.633333333333334) internal successors, (139), 30 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:59:07,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:59:08,067 INFO L225 Difference]: With dead ends: 45039 [2022-03-15 21:59:08,067 INFO L226 Difference]: Without dead ends: 45030 [2022-03-15 21:59:08,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 198 SyntacticMatches, 28 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2508 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=931, Invalid=6901, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 21:59:08,071 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 820 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 2701 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 2927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 2701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:59:08,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [820 Valid, 399 Invalid, 2927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 2701 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 21:59:08,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45030 states. [2022-03-15 21:59:08,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45030 to 13639. [2022-03-15 21:59:08,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13639 states, 13638 states have (on average 4.301803783545974) internal successors, (58668), 13638 states have internal predecessors, (58668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:59:08,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13639 states to 13639 states and 58668 transitions. [2022-03-15 21:59:08,564 INFO L78 Accepts]: Start accepts. Automaton has 13639 states and 58668 transitions. Word has length 30 [2022-03-15 21:59:08,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:59:08,564 INFO L470 AbstractCegarLoop]: Abstraction has 13639 states and 58668 transitions. [2022-03-15 21:59:08,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.633333333333334) internal successors, (139), 30 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:59:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 13639 states and 58668 transitions. [2022-03-15 21:59:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:59:08,594 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:59:08,594 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:59:08,610 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:59:08,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:59:08,810 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:59:08,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:59:08,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1927140449, now seen corresponding path program 22 times [2022-03-15 21:59:08,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:59:08,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655149912] [2022-03-15 21:59:08,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:59:08,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:59:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:59:08,977 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:59:08,978 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:59:08,978 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655149912] [2022-03-15 21:59:08,978 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655149912] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:59:08,978 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546461645] [2022-03-15 21:59:08,978 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:59:08,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:59:08,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:59:08,980 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:59:08,980 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:59:09,019 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:59:09,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:59:09,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 21:59:09,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:59:09,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:59:09,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:59:09,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 37 [2022-03-15 21:59:09,297 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:59:09,297 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 36 treesize of output 18 [2022-03-15 21:59:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:59:09,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:59:09,445 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:59:09,464 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 59 treesize of output 77 [2022-03-15 21:59:09,587 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:59:09,587 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 61 [2022-03-15 21:59:09,679 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:59:09,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546461645] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:59:09,680 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:59:09,680 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-03-15 21:59:09,680 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [353392370] [2022-03-15 21:59:09,680 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:59:09,683 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:59:09,733 INFO L252 McrAutomatonBuilder]: Finished intersection with 254 states and 593 transitions. [2022-03-15 21:59:09,734 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:59:21,702 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [1140937#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (<= total 0) (not (= (select q1 q1_back) 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 (<= 0 total) (not (= (select q1 q1_back) C)))), 1140929#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (< (+ q1_front 2) q1_back) (<= q2_back q2_front) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)) (not (< (+ q1_front 1) q1_back)))), 1140934#(and (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 1140939#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 1140943#(and (or (not (= (select q1 q1_back) C)) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (= C (select q1 (+ q1_back 1))))) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 1140944#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (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)))) (= (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)))))), 1140940#(and (or (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front))), 1140928#(and (or (< (+ q1_front 2) q1_back) (< 0 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (< (+ q1_front 1) q1_back)))), 1140942#(and (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))))), 1140946#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 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)))) (= q2_back q2_front)) (or (= C (select q1 q1_front)) (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)))) (= (select q1 (+ q1_front 1)) C))), 1140930#(and (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (< 0 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)))), 1140935#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))))), 1140945#(and (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (+ C (select q2 q2_back)) 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)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))))), 1140927#(and (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (< 0 (+ total (select q1 q1_front) 1)) (not (< q1_front q1_back)))), 1140932#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back))))), 1140933#(and (or (<= 0 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0))), 1140931#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (< 0 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)))), 1140941#(and (or (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (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 (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C)))), 1140938#(and (or (<= 0 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= C (select q1 (+ q1_back 1)))))), 1140936#(and (or (not (= (select q1 q1_back) C)) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0)) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) C)))), 1140926#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back)))] [2022-03-15 21:59:21,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 21:59:21,703 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:59:21,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 21:59:21,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1304, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 21:59:21,703 INFO L87 Difference]: Start difference. First operand 13639 states and 58668 transitions. Second operand has 32 states, 31 states have (on average 4.806451612903226) internal successors, (149), 31 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:59:29,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:59:29,669 INFO L93 Difference]: Finished difference Result 62297 states and 258270 transitions. [2022-03-15 21:59:29,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2022-03-15 21:59:29,669 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.806451612903226) internal successors, (149), 31 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:59:29,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:59:29,920 INFO L225 Difference]: With dead ends: 62297 [2022-03-15 21:59:29,921 INFO L226 Difference]: Without dead ends: 62279 [2022-03-15 21:59:29,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 225 SyntacticMatches, 28 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8346 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=2156, Invalid=21714, Unknown=0, NotChecked=0, Total=23870 [2022-03-15 21:59:29,923 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 1289 mSDsluCounter, 2255 mSDsCounter, 0 mSdLazyCounter, 4191 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 4498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 4191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:59:29,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1289 Valid, 670 Invalid, 4498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 4191 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 21:59:29,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62279 states. [2022-03-15 21:59:30,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62279 to 13733. [2022-03-15 21:59:30,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13733 states, 13732 states have (on average 4.30607340518497) internal successors, (59131), 13732 states have internal predecessors, (59131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:59:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13733 states to 13733 states and 59131 transitions. [2022-03-15 21:59:30,769 INFO L78 Accepts]: Start accepts. Automaton has 13733 states and 59131 transitions. Word has length 30 [2022-03-15 21:59:30,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:59:30,769 INFO L470 AbstractCegarLoop]: Abstraction has 13733 states and 59131 transitions. [2022-03-15 21:59:30,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.806451612903226) internal successors, (149), 31 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:59:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 13733 states and 59131 transitions. [2022-03-15 21:59:30,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:59:30,799 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:59:30,799 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:59:30,815 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:59:31,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:59:31,015 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:59:31,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:59:31,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1833494203, now seen corresponding path program 23 times [2022-03-15 21:59:31,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:59:31,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273132878] [2022-03-15 21:59:31,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:59:31,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:59:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:59:31,209 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:59:31,209 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:59:31,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273132878] [2022-03-15 21:59:31,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273132878] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:59:31,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962439920] [2022-03-15 21:59:31,210 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:59:31,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:59:31,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:59:31,211 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:59:31,211 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:59:31,248 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:59:31,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:59:31,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 21:59:31,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:59:31,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:59:31,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:59:31,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:59:31,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2022-03-15 21:59:31,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:59:31,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:59:31,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:59:31,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2022-03-15 21:59:31,574 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:59:31,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:59:31,811 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:59:31,811 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 59 treesize of output 77 [2022-03-15 21:59:31,911 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:59:31,911 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 61 [2022-03-15 21:59:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:59:31,964 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962439920] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:59:31,964 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:59:31,964 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-03-15 21:59:31,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2072426021] [2022-03-15 21:59:31,965 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:59:31,978 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:59:32,012 INFO L252 McrAutomatonBuilder]: Finished intersection with 178 states and 397 transitions. [2022-03-15 21:59:32,012 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:59:43,327 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [1231143#(and (or (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (* 2 C) (+ total (select q1 q1_front))) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) (* 2 C)) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (= (+ (select q2 q2_front) C) 0) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 1231139#(and (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0)) (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)))), 1231152#(and (or (<= q1_back q1_front) (<= (* 2 C) (+ total (select q1 q1_front))) (not (= (- C) (select q2 q2_back)))) (or (<= q1_back q1_front) (<= (+ total (select q1 q1_front)) (* 2 C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front) (<= q1_back q1_front)) (or (<= q1_back q1_front) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))))), 1231149#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ total (select q1 q1_front)) (* 2 C)) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (* 2 C) (+ total (select q1 q1_front))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1))))), 1231151#(and (or (<= q1_back q1_front) (<= (* 2 C) (+ total (select q1 q1_front)))) (or (<= q1_back q1_front) (<= (+ total (select q1 q1_front)) (* 2 C))) (or (<= (+ q2_front 1) q2_back) (<= q1_back q1_front)) (or (<= q2_back (+ q2_front 1)) (<= q1_back q1_front)) (or (= (+ (select q2 q2_front) C) 0) (<= q1_back q1_front))), 1231138#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1))) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0))), 1231142#(and (or (< q1_front q1_back) (<= (* 2 C) total)) (or (< q1_front q1_back) (<= q2_back (+ q2_front 1))) (or (= (+ (select q2 q2_front) C) 0) (< q1_front q1_back)) (or (< q1_front q1_back) (<= total (* 2 C))) (or (< q1_front q1_back) (<= (+ q2_front 1) q2_back))), 1231159#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ q1_front 1) (+ q1_back 1)) (not (= (select q1 q1_back) C))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front))), 1231154#(and (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_front q2_back)) (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)) (<= q2_back q2_front)) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) (* 2 C))) (or (= (+ (* (- 1) q1_front) q1_back) 0) (not (= (- C) (select q2 q2_back))))), 1231147#(and (or (< q1_front q1_back) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back)))) (or (< q1_front q1_back) (<= total (* 2 C)) (not (= (- C) (select q2 q2_back)))) (or (< q1_front q1_back) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (< q1_front q1_back) (<= (* 2 C) total) (not (= (- C) (select q2 q2_back))))), 1231145#(and (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= (* 2 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 2 C)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 1231150#(and (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q2_front q2_back) (not (< q1_front q1_back))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= (* 2 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 2 C)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 1231146#(and (or (<= (* 2 C) total) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= total (* 2 C)) (not (= (- C) (select q2 q2_back))))), 1231157#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 1231141#(and (or (= (+ (select q2 q2_front) C) 0) (< q1_front q1_back) (= q2_back q2_front)) (or (not (= (+ (select q2 q2_front) C) 0)) (< q1_front q1_back) (<= C total)) (or (not (= (+ (select q2 q2_front) C) 0)) (<= total C) (< q1_front q1_back))), 1231148#(and (or (< (+ q1_front 1) q1_back) (<= (* 2 C) (+ total (select q1 q1_front))) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) (* 2 C)) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back)))), 1231160#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 1231158#(and (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (* 2 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= (+ q1_back 1) q1_front) (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)))) (<= q2_front q2_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 2 C)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1))))), 1231137#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 1231156#(and (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (* 2 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 2 C)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= q2_back (+ q2_front 1)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 1231155#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_front q2_back)) (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 (<= 0 total) (not (= (+ C (select q2 q2_back)) 0))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= total 0))), 1231140#(and (or (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total))) (or (< q1_front q1_back) (<= (+ (select q2 q2_front) total) 0))), 1231144#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ total (select q1 q1_front)) (* 2 C)) (not (< q1_front (+ q1_back 1)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= (* 2 C) (+ total (select q1 q1_front))))), 1231153#(and (or (= C (select q1 q1_front)) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= C total) (not (= (- C) (select q2 q2_back)))) (or (<= total C) (not (= (- C) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (= (- C) (select q2 q2_back)))))] [2022-03-15 21:59:43,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 21:59:43,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:59:43,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 21:59:43,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1751, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 21:59:43,328 INFO L87 Difference]: Start difference. First operand 13733 states and 59131 transitions. Second operand has 35 states, 34 states have (on average 4.529411764705882) internal successors, (154), 34 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 22:00:11,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:00:11,233 INFO L93 Difference]: Finished difference Result 154036 states and 647145 transitions. [2022-03-15 22:00:11,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2022-03-15 22:00:11,233 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.529411764705882) internal successors, (154), 34 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 22:00:11,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:00:12,396 INFO L225 Difference]: With dead ends: 154036 [2022-03-15 22:00:12,397 INFO L226 Difference]: Without dead ends: 153782 [2022-03-15 22:00:12,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 151 SyntacticMatches, 20 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21318 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=4803, Invalid=49253, Unknown=0, NotChecked=0, Total=54056 [2022-03-15 22:00:12,400 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 1735 mSDsluCounter, 3543 mSDsCounter, 0 mSdLazyCounter, 5565 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1735 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 6142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 5565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:00:12,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1735 Valid, 847 Invalid, 6142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 5565 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-03-15 22:00:12,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153782 states. [2022-03-15 22:00:14,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153782 to 15265. [2022-03-15 22:00:14,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15265 states, 15264 states have (on average 4.304441823899371) internal successors, (65703), 15264 states have internal predecessors, (65703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:00:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15265 states to 15265 states and 65703 transitions. [2022-03-15 22:00:14,401 INFO L78 Accepts]: Start accepts. Automaton has 15265 states and 65703 transitions. Word has length 30 [2022-03-15 22:00:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:00:14,401 INFO L470 AbstractCegarLoop]: Abstraction has 15265 states and 65703 transitions. [2022-03-15 22:00:14,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.529411764705882) internal successors, (154), 34 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 22:00:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 15265 states and 65703 transitions. [2022-03-15 22:00:14,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 22:00:14,436 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:00:14,436 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:00:14,455 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 22:00:14,639 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,SelfDestructingSolverStorable30 [2022-03-15 22:00:14,639 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 22:00:14,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:00:14,640 INFO L85 PathProgramCache]: Analyzing trace with hash -204107973, now seen corresponding path program 24 times [2022-03-15 22:00:14,640 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:00:14,640 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771672717] [2022-03-15 22:00:14,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:00:14,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:00:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:00:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:00:14,947 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:00:14,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771672717] [2022-03-15 22:00:14,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771672717] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:00:14,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256926070] [2022-03-15 22:00:14,947 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:00:14,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:00:14,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:00:14,949 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 22:00:14,950 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 22:00:14,988 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 22:00:14,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:00:14,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 22:00:14,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:00:15,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:00:15,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:00:15,147 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:00:15,147 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2022-03-15 22:00:15,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:00:15,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:00:15,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2022-03-15 22:00:15,300 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:00:15,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:00:15,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:00:15,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:00:15,718 INFO L353 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-03-15 22:00:15,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, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 65 [2022-03-15 22:00:15,816 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:00:15,817 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 62 [2022-03-15 22:00:15,880 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:00:15,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256926070] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:00:15,881 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:00:15,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-03-15 22:00:15,881 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [559470018] [2022-03-15 22:00:15,881 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:00:15,884 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:00:15,928 INFO L252 McrAutomatonBuilder]: Finished intersection with 198 states and 443 transitions. [2022-03-15 22:00:15,928 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:00:24,433 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [1416305#(and (or (<= 0 (+ (select q2 q2_front) total (select q2 (+ q2_front 1)))) (< q1_front q1_back)) (or (< q1_front q1_back) (<= (+ (select q2 q2_front) total (select q2 (+ q2_front 1))) 0))), 1416307#(and (or (< q1_front q1_back) (<= (* 2 C) total)) (or (< q1_front q1_back) (<= q2_back (+ q2_front 1))) (or (= (+ (select q2 q2_front) C) 0) (< q1_front q1_back)) (or (< q1_front q1_back) (<= total (* 2 C))) (or (< q1_front q1_back) (<= (+ q2_front 1) q2_back))), 1416311#(and (or (<= (* 2 C) total) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= total (* 2 C)) (not (= (- C) (select q2 q2_back))))), 1416316#(and (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= (* 2 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 2 C)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 1416320#(and (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= C total) (not (= (- C) (select q2 q2_back)))) (or (<= total C) (not (= (- C) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))))), 1416319#(and (or (<= q1_back q1_front) (<= (* 2 C) (+ total (select q1 q1_front))) (not (= (- C) (select q2 q2_back)))) (or (<= q1_back q1_front) (<= (+ total (select q1 q1_front)) (* 2 C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front) (<= q1_back q1_front)) (or (<= q1_back q1_front) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))))), 1416231#(or (not (< q2_front q2_back)) (and (< 0 (+ (select q2 q2_front) total 1)) (<= (+ (select q2 q2_front) total) 0))), 1416318#(and (or (<= q1_back q1_front) (<= (* 2 C) (+ total (select q1 q1_front)))) (or (<= q1_back q1_front) (<= (+ total (select q1 q1_front)) (* 2 C))) (or (<= (+ q2_front 1) q2_back) (<= q1_back q1_front)) (or (<= q2_back (+ q2_front 1)) (<= q1_back q1_front)) (or (= (+ (select q2 q2_front) C) 0) (<= q1_back q1_front))), 1416309#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ (select q2 q2_front) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (< q1_front q1_back) (<= (+ q1_back 1) q1_front))), 1416325#(and (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (* 2 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (<= (+ q1_back 1) q1_front) (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)))) (<= q2_front q2_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 2 C)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1))))), 1416322#(and (or (<= (+ q1_front 1) q1_back) (not (= (- C) (select q2 q2_back)))) (or (= C (select q1 q1_front)) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= q1_back (+ q1_front 1)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))))), 1416324#(and (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (* 2 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 2 C)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= q2_back (+ q2_front 1)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 1416304#(and (or (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total))) (or (< q1_front q1_back) (<= (+ (select q2 q2_front) total) 0))), 1416317#(and (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q2_front q2_back) (not (< q1_front q1_back))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= (* 2 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 2 C)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 1416306#(and (or (< (+ q1_front 1) q1_back) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 1416302#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 1416308#(and (or (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (* 2 C) (+ total (select q1 q1_front))) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) (* 2 C)) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (= (+ (select q2 q2_front) C) 0) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 1416310#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ total (select q1 q1_front)) (* 2 C)) (not (< q1_front (+ q1_back 1)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= (* 2 C) (+ total (select q1 q1_front))))), 1416328#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 1416313#(and (or (< (+ q1_front 1) q1_back) (<= (* 2 C) (+ total (select q1 q1_front))) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) (* 2 C)) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back)))), 1416323#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (= C (select q1 (+ q1_back 1))))) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 1416315#(and (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (< q1_front q1_back))) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 1416326#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 1416321#(and (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (<= total C) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (<= C total) (not (= (- C) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (= q1_front q1_back) (not (= (- C) (select q2 q2_back))))), 1416314#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ total (select q1 q1_front)) (* 2 C)) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (* 2 C) (+ total (select q1 q1_front))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1))))), 1416327#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= (- C) (select q2 q2_back))))), 1416303#(and (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0)) (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)))), 1416312#(and (or (< q1_front q1_back) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back)))) (or (< q1_front q1_back) (<= total (* 2 C)) (not (= (- C) (select q2 q2_back)))) (or (< q1_front q1_back) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (< q1_front q1_back) (<= (* 2 C) total) (not (= (- C) (select q2 q2_back)))))] [2022-03-15 22:00:24,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 22:00:24,433 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:00:24,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 22:00:24,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=2365, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 22:00:24,434 INFO L87 Difference]: Start difference. First operand 15265 states and 65703 transitions. Second operand has 39 states, 38 states have (on average 4.526315789473684) internal successors, (172), 38 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:00:33,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:00:33,913 INFO L93 Difference]: Finished difference Result 59367 states and 245477 transitions. [2022-03-15 22:00:33,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-03-15 22:00:33,914 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 4.526315789473684) internal successors, (172), 38 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 22:00:33,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:00:34,172 INFO L225 Difference]: With dead ends: 59367 [2022-03-15 22:00:34,173 INFO L226 Difference]: Without dead ends: 59339 [2022-03-15 22:00:34,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 163 SyntacticMatches, 21 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4831 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1603, Invalid=13649, Unknown=0, NotChecked=0, Total=15252 [2022-03-15 22:00:34,174 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 1466 mSDsluCounter, 4431 mSDsCounter, 0 mSdLazyCounter, 6359 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 6661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 6359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:00:34,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1466 Valid, 741 Invalid, 6661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 6359 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 22:00:34,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59339 states. [2022-03-15 22:00:34,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59339 to 15847. [2022-03-15 22:00:34,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15847 states, 15846 states have (on average 4.317935125583744) internal successors, (68422), 15846 states have internal predecessors, (68422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:00:35,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15847 states to 15847 states and 68422 transitions. [2022-03-15 22:00:35,164 INFO L78 Accepts]: Start accepts. Automaton has 15847 states and 68422 transitions. Word has length 30 [2022-03-15 22:00:35,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:00:35,164 INFO L470 AbstractCegarLoop]: Abstraction has 15847 states and 68422 transitions. [2022-03-15 22:00:35,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 4.526315789473684) internal successors, (172), 38 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:00:35,164 INFO L276 IsEmpty]: Start isEmpty. Operand 15847 states and 68422 transitions. [2022-03-15 22:00:35,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 22:00:35,200 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:00:35,200 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:00:35,218 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 22:00:35,416 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,SelfDestructingSolverStorable31 [2022-03-15 22:00:35,416 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 22:00:35,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:00:35,416 INFO L85 PathProgramCache]: Analyzing trace with hash -127494579, now seen corresponding path program 25 times [2022-03-15 22:00:35,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:00:35,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597794124] [2022-03-15 22:00:35,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:00:35,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:00:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:00:35,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:00:35,647 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:00:35,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597794124] [2022-03-15 22:00:35,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597794124] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:00:35,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609825102] [2022-03-15 22:00:35,647 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:00:35,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:00:35,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:00:35,648 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 22:00:35,650 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 22:00:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:00:35,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 22:00:35,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:00:36,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:00:36,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:00:36,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:00:36,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2022-03-15 22:00:36,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:00:36,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:00:36,088 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:00:36,088 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-03-15 22:00:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:00:36,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:00:36,282 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:00:36,283 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 59 treesize of output 77 [2022-03-15 22:00:36,357 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:00:36,358 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 61 [2022-03-15 22:00:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:00:36,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609825102] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:00:36,404 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:00:36,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-03-15 22:00:36,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [877132105] [2022-03-15 22:00:36,404 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:00:36,407 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:00:36,467 INFO L252 McrAutomatonBuilder]: Finished intersection with 184 states and 401 transitions. [2022-03-15 22:00:36,467 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:00:43,249 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [1507731#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 1507739#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front))), 1507738#(and (or (= (+ (select q2 q2_front) C) 0) (<= q1_back q1_front) (= q2_back q2_front)) (or (not (= (+ (select q2 q2_front) C) 0)) (<= q1_back q1_front) (<= (+ total (select q1 q1_front)) C)) (or (not (= (+ (select q2 q2_front) C) 0)) (<= C (+ total (select q1 q1_front))) (<= q1_back q1_front))), 1507741#(and (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= C (+ total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (= q2_back q2_front)) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ total (select q1 q1_front)) C) (not (< q1_front (+ q1_back 1))))), 1507733#(and (or (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total))) (or (< q1_front q1_back) (<= (+ (select q2 q2_front) total) 0))), 1507730#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1))) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0))), 1507747#(and (or (not (= (select q1 q1_back) C)) (<= total C) (not (= (- C) (select q2 q2_back)))) (or (= C (select q1 q1_front)) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= C total) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front))), 1507732#(and (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0)) (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)))), 1507740#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1))))), 1507752#(and (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (<= C (+ total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))))), 1507736#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front q1_back)))), 1507755#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 1507754#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (= (+ q1_front 1) (+ q1_back 1)) (not (= (select q1 q1_back) C))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front))), 1507748#(and (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back)) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= C (+ total (select q1 q1_front))) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (< q1_front q1_back)))), 1507737#(and (or (not (= (+ (select q2 q2_front) C) 0)) (< (+ q1_front 1) q1_back) (<= C (+ total (select q1 q1_front))) (not (< q1_front q1_back))) (or (not (= (+ (select q2 q2_front) C) 0)) (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) C) (not (< q1_front q1_back))) (or (= (+ (select q2 q2_front) C) 0) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)) (= q2_back q2_front))), 1507749#(and (or (not (= (select q1 q1_back) C)) (<= total C) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= C total) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front)) (or (= (+ (* (- 1) q1_front) q1_back) 0) (not (= (- C) (select q2 q2_back))))), 1507744#(and (or (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= C total)) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (<= total C)) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)))), 1507742#(and (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (<= C (+ total (select q1 q1_front)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (= q2_back q2_front)) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (<= (+ total (select q1 q1_front)) C))), 1507743#(and (or (<= 0 total) (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C))) (or (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (<= total 0) (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)))), 1507753#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 1507735#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 1507745#(and (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (not (< q1_front q1_back)) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= C (+ total (select q1 q1_front))) (not (< q1_front q1_back))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (< q1_front q1_back)))), 1507746#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (= C (select q1 q1_front)) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= C total) (not (= (- C) (select q2 q2_back)))) (or (<= total C) (not (= (- C) (select q2 q2_back))))), 1507734#(and (or (= (+ (select q2 q2_front) C) 0) (< q1_front q1_back) (= q2_back q2_front)) (or (not (= (+ (select q2 q2_front) C) 0)) (< q1_front q1_back) (<= C total)) (or (not (= (+ (select q2 q2_front) C) 0)) (<= total C) (< q1_front q1_back))), 1507751#(and (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= C (+ total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 1507750#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_front q2_back)) (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 (<= 0 total) (not (= (+ C (select q2 q2_back)) 0))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= total 0)))] [2022-03-15 22:00:43,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 22:00:43,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:00:43,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 22:00:43,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1978, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 22:00:43,250 INFO L87 Difference]: Start difference. First operand 15847 states and 68422 transitions. Second operand has 37 states, 36 states have (on average 4.388888888888889) internal successors, (158), 36 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:00:52,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:00:52,982 INFO L93 Difference]: Finished difference Result 60169 states and 246167 transitions. [2022-03-15 22:00:52,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-03-15 22:00:52,983 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 4.388888888888889) internal successors, (158), 36 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 22:00:52,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:00:53,237 INFO L225 Difference]: With dead ends: 60169 [2022-03-15 22:00:53,237 INFO L226 Difference]: Without dead ends: 60057 [2022-03-15 22:00:53,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 147 SyntacticMatches, 27 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6086 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=2106, Invalid=14924, Unknown=0, NotChecked=0, Total=17030 [2022-03-15 22:00:53,239 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 1557 mSDsluCounter, 2365 mSDsCounter, 0 mSdLazyCounter, 3624 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 4042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 3624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:00:53,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1557 Valid, 563 Invalid, 4042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 3624 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 22:00:53,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60057 states. [2022-03-15 22:00:54,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60057 to 16213. [2022-03-15 22:00:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16213 states, 16212 states have (on average 4.32420429311621) internal successors, (70104), 16212 states have internal predecessors, (70104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:00:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16213 states to 16213 states and 70104 transitions. [2022-03-15 22:00:54,122 INFO L78 Accepts]: Start accepts. Automaton has 16213 states and 70104 transitions. Word has length 30 [2022-03-15 22:00:54,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:00:54,122 INFO L470 AbstractCegarLoop]: Abstraction has 16213 states and 70104 transitions. [2022-03-15 22:00:54,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 4.388888888888889) internal successors, (158), 36 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:00:54,122 INFO L276 IsEmpty]: Start isEmpty. Operand 16213 states and 70104 transitions. [2022-03-15 22:00:54,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 22:00:54,157 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:00:54,157 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:00:54,175 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 22:00:54,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:00:54,360 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 22:00:54,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:00:54,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1043897533, now seen corresponding path program 26 times [2022-03-15 22:00:54,361 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:00:54,361 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676099454] [2022-03-15 22:00:54,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:00:54,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:00:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:00:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:00:54,573 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:00:54,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676099454] [2022-03-15 22:00:54,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676099454] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:00:54,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667445288] [2022-03-15 22:00:54,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:00:54,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:00:54,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:00:54,574 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 22:00:54,575 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 22:00:54,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:00:54,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:00:54,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 22:00:54,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:00:55,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:00:55,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:00:55,075 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:00:55,075 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 38 [2022-03-15 22:00:55,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:00:55,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:00:55,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 18 [2022-03-15 22:00:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:00:55,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:00:55,398 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:00:55,398 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 59 treesize of output 77 [2022-03-15 22:00:55,519 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:00:55,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 61 [2022-03-15 22:00:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:00:55,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667445288] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:00:55,595 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:00:55,595 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-03-15 22:00:55,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [796986500] [2022-03-15 22:00:55,595 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:00:55,597 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:00:55,818 INFO L252 McrAutomatonBuilder]: Finished intersection with 171 states and 364 transitions. [2022-03-15 22:00:55,818 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:03,980 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [1600712#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 1600717#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (< q1_front (+ q1_back 1)))) (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front))), 1600721#(and (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= C (+ total (select q1 q1_front))) (not (< q1_front q1_back))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (< q1_front q1_back)))), 1600729#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 1600716#(and (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) 0)) (or (<= 0 (+ total (select q1 q1_front))) (not (= (select q1 q1_back) C)))), 1600722#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= C total) (not (= (- C) (select q2 q2_back)))) (or (<= total C) (not (= (- C) (select q2 q2_back))))), 1600713#(and (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (< 0 (+ total (select q1 q1_front) 1)) (not (< q1_front q1_back)))), 1600730#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= (- C) (select q2 q2_back))))), 1600727#(and (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= C (+ total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 1600718#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))))), 1600731#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 1600720#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= C total)) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (<= total 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)))), 1600723#(and (or (not (= (select q1 q1_back) C)) (<= total C) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= C total) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front))), 1600719#(and (or (<= 0 total) (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (<= total 0) (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)))), 1600726#(and (or (<= (+ q1_front 1) q1_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= q1_back (+ q1_front 1)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))))), 1600725#(and (or (not (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (<= total C) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (<= C total) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (= q1_front q1_back) (not (= (- C) (select q2 q2_back))))), 1600715#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (< 0 (+ total (select q1 q1_front) 1))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front (+ q1_back 1))))), 1600714#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 1600724#(and (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= C (+ total (select q1 q1_front))) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (< q1_front q1_back)))), 1600728#(and (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (<= C (+ total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1))))))] [2022-03-15 22:01:03,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 22:01:03,980 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:03,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 22:01:03,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1451, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 22:01:03,981 INFO L87 Difference]: Start difference. First operand 16213 states and 70104 transitions. Second operand has 31 states, 30 states have (on average 4.4) internal successors, (132), 30 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:11,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:11,995 INFO L93 Difference]: Finished difference Result 54460 states and 222225 transitions. [2022-03-15 22:01:11,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-03-15 22:01:11,996 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.4) internal successors, (132), 30 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 22:01:11,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:12,218 INFO L225 Difference]: With dead ends: 54460 [2022-03-15 22:01:12,218 INFO L226 Difference]: Without dead ends: 54244 [2022-03-15 22:01:12,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 142 SyntacticMatches, 26 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6427 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1667, Invalid=16155, Unknown=0, NotChecked=0, Total=17822 [2022-03-15 22:01:12,220 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 1107 mSDsluCounter, 2996 mSDsCounter, 0 mSdLazyCounter, 4850 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 5148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 4850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:12,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1107 Valid, 600 Invalid, 5148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 4850 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 22:01:12,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54244 states. [2022-03-15 22:01:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54244 to 17072. [2022-03-15 22:01:12,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17072 states, 17071 states have (on average 4.328217444789409) internal successors, (73887), 17071 states have internal predecessors, (73887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:13,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17072 states to 17072 states and 73887 transitions. [2022-03-15 22:01:13,049 INFO L78 Accepts]: Start accepts. Automaton has 17072 states and 73887 transitions. Word has length 30 [2022-03-15 22:01:13,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:13,049 INFO L470 AbstractCegarLoop]: Abstraction has 17072 states and 73887 transitions. [2022-03-15 22:01:13,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.4) internal successors, (132), 30 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:13,049 INFO L276 IsEmpty]: Start isEmpty. Operand 17072 states and 73887 transitions. [2022-03-15 22:01:13,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 22:01:13,085 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:13,085 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:13,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-03-15 22:01:13,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:13,298 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 22:01:13,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:13,299 INFO L85 PathProgramCache]: Analyzing trace with hash 377577479, now seen corresponding path program 27 times [2022-03-15 22:01:13,299 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:13,299 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940122800] [2022-03-15 22:01:13,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:13,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:13,477 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:13,477 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:13,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940122800] [2022-03-15 22:01:13,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940122800] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:13,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168192820] [2022-03-15 22:01:13,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:01:13,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:13,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:13,479 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 22:01:13,480 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 22:01:13,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 22:01:13,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:01:13,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 22:01:13,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:13,820 INFO L353 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-03-15 22:01:13,820 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 58 treesize of output 58 [2022-03-15 22:01:13,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:01:13,896 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:13,896 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 47 treesize of output 47 [2022-03-15 22:01:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:14,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:15,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:15,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:15,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:01:15,790 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:15,790 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 51 treesize of output 53 [2022-03-15 22:01:16,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:01:16,133 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-03-15 22:01:16,134 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 54 treesize of output 54 [2022-03-15 22:01:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:16,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168192820] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:16,189 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:16,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 28 [2022-03-15 22:01:16,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [729888485] [2022-03-15 22:01:16,189 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:16,192 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:16,227 INFO L252 McrAutomatonBuilder]: Finished intersection with 178 states and 379 transitions. [2022-03-15 22:01:16,227 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:24,082 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [1689733#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))))), 1689734#(and (or (not (= (select q1 q1_back) C)) (<= (+ (select q2 q2_front) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0)) (or (not (= (select q1 q1_back) C)) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front) (select q2 (+ q2_front 1)))))), 1689737#(and (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= C (+ total (select q1 q1_front))) (not (< q1_front q1_back))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (< q1_front q1_back)))), 1689729#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 1689748#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 1689735#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= C total)) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (<= total 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)))), 1689740#(and (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= C (+ total (select q1 q1_front))) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (< q1_front q1_back)))), 1689736#(and (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) C)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (< q1_front q1_back)))), 1689741#(and (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (<= total C) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (<= C total) (not (= (- C) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (= q1_front q1_back) (not (= (- C) (select q2 q2_back))))), 1689745#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 1689738#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= C total) (not (= (- C) (select q2 q2_back)))) (or (<= total C) (not (= (- C) (select q2 q2_back))))), 1689742#(and (or (<= (+ q1_front 1) q1_back) (not (= (- C) (select q2 q2_back)))) (or (= C (select q1 q1_front)) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= q1_back (+ q1_front 1)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))))), 1689732#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front)) (or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))))), 1689739#(and (or (not (= (select q1 q1_back) C)) (<= total C) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= C total) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front))), 1689727#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 1689743#(and (or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (= C (select q1 (+ q1_back 1))))) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 1689730#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front))), 1689746#(and (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (<= C (+ total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))))), 1689726#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1))) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0))), 1689728#(and (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0)) (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)))), 1689731#(and (or (<= q1_back q1_front) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front)))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q1_back q1_front))), 1689744#(and (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= C (+ total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 1689747#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= (- C) (select q2 q2_back)))))] [2022-03-15 22:01:24,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 22:01:24,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:24,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 22:01:24,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2473, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 22:01:24,084 INFO L87 Difference]: Start difference. First operand 17072 states and 73887 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 22:01:33,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:33,204 INFO L93 Difference]: Finished difference Result 55703 states and 230147 transitions. [2022-03-15 22:01:33,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-03-15 22:01:33,204 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 22:01:33,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:33,422 INFO L225 Difference]: With dead ends: 55703 [2022-03-15 22:01:33,422 INFO L226 Difference]: Without dead ends: 55680 [2022-03-15 22:01:33,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 148 SyntacticMatches, 15 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5927 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1714, Invalid=16376, Unknown=0, NotChecked=0, Total=18090 [2022-03-15 22:01:33,425 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 964 mSDsluCounter, 3761 mSDsCounter, 0 mSdLazyCounter, 5492 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 5697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 5492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:33,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [964 Valid, 700 Invalid, 5697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 5492 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 22:01:33,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55680 states. [2022-03-15 22:01:34,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55680 to 17640. [2022-03-15 22:01:34,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17640 states, 17639 states have (on average 4.32581212086853) internal successors, (76303), 17639 states have internal predecessors, (76303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17640 states to 17640 states and 76303 transitions. [2022-03-15 22:01:34,175 INFO L78 Accepts]: Start accepts. Automaton has 17640 states and 76303 transitions. Word has length 30 [2022-03-15 22:01:34,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:34,175 INFO L470 AbstractCegarLoop]: Abstraction has 17640 states and 76303 transitions. [2022-03-15 22:01:34,176 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 22:01:34,176 INFO L276 IsEmpty]: Start isEmpty. Operand 17640 states and 76303 transitions. [2022-03-15 22:01:34,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 22:01:34,213 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:34,213 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:34,229 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 22:01:34,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:34,429 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 22:01:34,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:34,429 INFO L85 PathProgramCache]: Analyzing trace with hash -674501693, now seen corresponding path program 28 times [2022-03-15 22:01:34,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:34,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269733730] [2022-03-15 22:01:34,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:34,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:34,603 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:34,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269733730] [2022-03-15 22:01:34,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269733730] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:34,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197611459] [2022-03-15 22:01:34,603 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:01:34,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:34,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:34,616 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 22:01:34,621 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 22:01:34,646 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:01:34,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:01:34,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 22:01:34,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:35,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:01:35,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:01:35,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:35,451 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 49 [2022-03-15 22:01:35,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:01:35,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:35,480 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2022-03-15 22:01:35,512 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:35,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:35,740 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:01:35,740 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 59 treesize of output 77 [2022-03-15 22:01:35,860 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:01:35,860 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 61 [2022-03-15 22:01:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:35,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197611459] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:35,935 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:35,935 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-15 22:01:35,935 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1283986158] [2022-03-15 22:01:35,935 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:35,937 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:35,980 INFO L252 McrAutomatonBuilder]: Finished intersection with 179 states and 380 transitions. [2022-03-15 22:01:35,980 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:43,485 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [1781100#(and (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= C (+ total (select q1 q1_front))) (not (< q1_front q1_back))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (< q1_front q1_back)))), 1781102#(and (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= C (+ total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 1781091#(and (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (< 0 (+ total (select q1 q1_front) 1)) (not (< q1_front q1_back)))), 1781092#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 1781101#(and (or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (= C (select q1 (+ q1_back 1))))) (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 1781093#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (< 0 (+ total (select q1 q1_front) 1))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front (+ q1_back 1))))), 1781096#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))))), 1781094#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (< q1_front (+ q1_back 1)))) (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front))), 1781104#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= C total) (not (= (- C) (select q2 q2_back)))) (or (<= total C) (not (= (- C) (select q2 q2_back))))), 1781105#(and (or (not (= (select q1 q1_back) C)) (<= total C) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= C total) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front))), 1781107#(and (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (<= total C) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ (* (- 1) (select q1 q1_front)) C) 0)) (<= C total) (not (= (- C) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (= q1_front q1_back) (not (= (- C) (select q2 q2_back))))), 1781099#(and (or (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) C)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0) (not (< q1_front q1_back)))), 1781098#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= C total)) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (<= total 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)))), 1781106#(and (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= C (+ total (select q1 q1_front))) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (< q1_front q1_back)))), 1781097#(and (or (not (= (select q1 q1_back) C)) (<= (+ (select q2 q2_front) total (select q1 q1_front) (select q2 (+ q2_front 1))) 0)) (or (not (= (select q1 q1_back) C)) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front) (select q2 (+ q2_front 1)))))), 1781111#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 1781110#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= (- C) (select q2 q2_back))))), 1781090#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 1781095#(and (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) 0)) (or (<= 0 (+ total (select q1 q1_front))) (not (= (select q1 q1_back) C)))), 1781103#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 1781108#(and (or (<= (+ q1_front 1) q1_back) (not (= (- C) (select q2 q2_back)))) (or (= C (select q1 q1_front)) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= q1_back (+ q1_front 1)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))))), 1781109#(and (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) C) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (<= C (+ total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1))))))] [2022-03-15 22:01:43,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 22:01:43,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:43,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 22:01:43,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1543, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:01:43,486 INFO L87 Difference]: Start difference. First operand 17640 states and 76303 transitions. Second operand has 33 states, 32 states have (on average 4.375) internal successors, (140), 32 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:51,800 INFO L93 Difference]: Finished difference Result 61713 states and 255822 transitions. [2022-03-15 22:01:51,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-03-15 22:01:51,801 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.375) internal successors, (140), 32 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 22:01:51,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:52,071 INFO L225 Difference]: With dead ends: 61713 [2022-03-15 22:01:52,072 INFO L226 Difference]: Without dead ends: 61665 [2022-03-15 22:01:52,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 156 SyntacticMatches, 19 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6725 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1603, Invalid=17579, Unknown=0, NotChecked=0, Total=19182 [2022-03-15 22:01:52,073 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 1101 mSDsluCounter, 4118 mSDsCounter, 0 mSdLazyCounter, 6500 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 6722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 6500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:52,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1101 Valid, 954 Invalid, 6722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 6500 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-03-15 22:01:52,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61665 states. [2022-03-15 22:01:52,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61665 to 17710. [2022-03-15 22:01:52,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17710 states, 17709 states have (on average 4.331526342537693) internal successors, (76707), 17709 states have internal predecessors, (76707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:52,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17710 states to 17710 states and 76707 transitions. [2022-03-15 22:01:52,987 INFO L78 Accepts]: Start accepts. Automaton has 17710 states and 76707 transitions. Word has length 30 [2022-03-15 22:01:52,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:52,987 INFO L470 AbstractCegarLoop]: Abstraction has 17710 states and 76707 transitions. [2022-03-15 22:01:52,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.375) internal successors, (140), 32 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:52,987 INFO L276 IsEmpty]: Start isEmpty. Operand 17710 states and 76707 transitions. [2022-03-15 22:01:53,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 22:01:53,024 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:53,024 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:53,040 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 22:01:53,232 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,SelfDestructingSolverStorable35 [2022-03-15 22:01:53,233 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 22:01:53,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:53,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1696351213, now seen corresponding path program 29 times [2022-03-15 22:01:53,234 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:53,234 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755438529] [2022-03-15 22:01:53,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:53,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:53,453 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:53,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755438529] [2022-03-15 22:01:53,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755438529] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:53,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347260463] [2022-03-15 22:01:53,453 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:01:53,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:53,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:53,454 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 22:01:53,455 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 22:01:53,486 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:01:53,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:01:53,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 22:01:53,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:53,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:01:53,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:01:53,808 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:53,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 31 [2022-03-15 22:01:54,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:54,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:01:54,083 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 18 [2022-03-15 22:01:54,113 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:54,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:54,399 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:01:54,400 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 58 treesize of output 76 [2022-03-15 22:01:54,523 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:01:54,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 61 [2022-03-15 22:01:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:54,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347260463] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:54,606 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:54,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-03-15 22:01:54,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [765386552] [2022-03-15 22:01:54,606 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:54,609 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:54,645 INFO L252 McrAutomatonBuilder]: Finished intersection with 180 states and 388 transitions. [2022-03-15 22:01:54,645 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:01,997 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [1878640#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)) (not (< q1_front q1_back)))), 1878636#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 1878650#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))))), 1878645#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1))))), 1878647#(and (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 1878637#(and (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0)) (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)))), 1878641#(and (or (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total))) (or (< q1_front q1_back) (<= (+ (select q2 q2_front) total) 0))), 1878638#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 1878635#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1))) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0))), 1878658#(and (or (= (+ (select q2 q2_front) C) 0) (<= q1_back q1_front) (= q2_back q2_front)) (or (not (= (+ (select q2 q2_front) C) 0)) (<= q1_back q1_front) (<= (+ total (select q1 q1_front)) C)) (or (not (= (+ (select q2 q2_front) C) 0)) (<= C (+ total (select q1 q1_front))) (<= q1_back q1_front))), 1878642#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))) (not (< q1_front q1_back)))), 1878656#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (<= (+ q1_front 1) q1_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= q1_back (+ q1_front 1)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back))))), 1878651#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 1878648#(and (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= C (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back))) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) C) (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)) (= q2_back q2_front))), 1878657#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= (- C) (select q2 q2_back))))), 1878639#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front))), 1878646#(and (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= C (+ total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (= q2_back q2_front)) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ total (select q1 q1_front)) C) (not (< q1_front (+ q1_back 1))))), 1878659#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 1878653#(and (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) C) (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (<= C (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 1878655#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 1878649#(and (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) C) (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (not (< q1_front q1_back))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (< q1_front q1_back)) (= q2_back q2_front)) (<= q1_back (+ q1_front 1)) (or (<= 0 (+ total (select q1 q1_front))) (not (= (+ (select q2 q2_front) C) 0)) (not (< q1_front q1_back)) (not (= (select q1 (+ q1_front 1)) C)))), 1878652#(and (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= C (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (= q2_back q2_front)) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) C) (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 1878643#(and (or (= (+ (select q2 q2_front) C) 0) (< q1_front q1_back) (= q2_back q2_front)) (or (not (= (+ (select q2 q2_front) C) 0)) (< q1_front q1_back) (<= C total)) (or (not (= (+ (select q2 q2_front) C) 0)) (<= total C) (< q1_front q1_back))), 1878654#(and (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (<= (+ C total) 0)) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (<= 0 (+ C total))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 1878644#(and (or (not (= (+ (select q2 q2_front) C) 0)) (< (+ q1_front 1) q1_back) (<= C (+ total (select q1 q1_front))) (not (< q1_front q1_back))) (or (not (= (+ (select q2 q2_front) C) 0)) (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) C) (not (< q1_front q1_back))) (or (= (+ (select q2 q2_front) C) 0) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)) (= q2_back q2_front)))] [2022-03-15 22:02:01,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 22:02:01,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:01,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 22:02:01,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1858, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 22:02:01,998 INFO L87 Difference]: Start difference. First operand 17710 states and 76707 transitions. Second operand has 36 states, 35 states have (on average 4.285714285714286) internal successors, (150), 35 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 22:02:11,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:11,869 INFO L93 Difference]: Finished difference Result 53560 states and 221510 transitions. [2022-03-15 22:02:11,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-03-15 22:02:11,869 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 4.285714285714286) internal successors, (150), 35 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 30 [2022-03-15 22:02:11,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:12,088 INFO L225 Difference]: With dead ends: 53560 [2022-03-15 22:02:12,088 INFO L226 Difference]: Without dead ends: 53448 [2022-03-15 22:02:12,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 142 SyntacticMatches, 29 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6068 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2300, Invalid=14212, Unknown=0, NotChecked=0, Total=16512 [2022-03-15 22:02:12,089 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 2207 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 2639 mSolverCounterSat, 705 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2207 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 3344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 705 IncrementalHoareTripleChecker+Valid, 2639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:12,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2207 Valid, 384 Invalid, 3344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [705 Valid, 2639 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 22:02:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53448 states. [2022-03-15 22:02:12,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53448 to 17870. [2022-03-15 22:02:12,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17870 states, 17869 states have (on average 4.333538530415804) internal successors, (77436), 17869 states have internal predecessors, (77436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17870 states to 17870 states and 77436 transitions. [2022-03-15 22:02:12,799 INFO L78 Accepts]: Start accepts. Automaton has 17870 states and 77436 transitions. Word has length 30 [2022-03-15 22:02:12,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:12,799 INFO L470 AbstractCegarLoop]: Abstraction has 17870 states and 77436 transitions. [2022-03-15 22:02:12,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.285714285714286) internal successors, (150), 35 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 22:02:12,799 INFO L276 IsEmpty]: Start isEmpty. Operand 17870 states and 77436 transitions. [2022-03-15 22:02:12,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 22:02:12,836 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:12,836 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:12,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-03-15 22:02:13,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 22:02:13,055 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 22:02:13,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:13,055 INFO L85 PathProgramCache]: Analyzing trace with hash 2034192361, now seen corresponding path program 30 times [2022-03-15 22:02:13,059 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:13,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367094460] [2022-03-15 22:02:13,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:13,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:13,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:13,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367094460] [2022-03-15 22:02:13,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367094460] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:13,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486393133] [2022-03-15 22:02:13,471 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:02:13,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:13,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:13,472 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 22:02:13,473 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 22:02:13,504 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 22:02:13,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:13,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:02:13,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:13,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:13,959 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:02:13,959 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 45 treesize of output 49 [2022-03-15 22:02:14,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:14,054 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:14,055 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 24 [2022-03-15 22:02:14,101 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:14,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:14,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:14,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:14,602 INFO L353 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2022-03-15 22:02:14,602 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 53 treesize of output 49 [2022-03-15 22:02:14,657 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:02:14,657 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 62 [2022-03-15 22:02:14,705 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:14,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486393133] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:14,706 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:14,706 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2022-03-15 22:02:14,706 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [369615806] [2022-03-15 22:02:14,706 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:14,708 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:14,742 INFO L252 McrAutomatonBuilder]: Finished intersection with 167 states and 351 transitions. [2022-03-15 22:02:14,742 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:20,998 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [1968333#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))))), 1968327#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 1968330#(and (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) 0)) (or (<= 0 (+ total (select q1 q1_front))) (not (= (select q1 q1_back) C)))), 1968337#(and (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (<= 0 (+ total (select q1 q1_front))) (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 1968340#(and (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0)) (not (< q1_front (+ q1_back 1))) (= q2_back q2_front)) (or (= (+ q1_front 1) (+ q1_back 1)) (not (= (select q1 q1_back) C)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (< q1_front (+ q1_back 1)))) (or (<= 0 (+ total (select q1 q1_front))) (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (not (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0)) (not (< q1_front (+ q1_back 1)))) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) 0) (not (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0)) (not (< q1_front (+ q1_back 1))))), 1968332#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front q1_back)))), 1968325#(and (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (< 0 (+ total (select q1 q1_front) 1)) (not (< q1_front q1_back)))), 1968335#(and (or (<= 0 total) (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C))) (or (<= total 0) (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)))), 1968331#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= 0 (+ (select q2 q2_front) total (select q1 q1_front))))), 1968342#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 1968338#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (<= (+ q1_front 1) q1_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= q1_back (+ q1_front 1)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back))))), 1968336#(and (or (<= 0 (+ total (select q1 q1_front))) (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (not (< q1_front q1_back))) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front q1_back))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (< q1_front q1_back)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (< q1_front q1_back)))), 1968344#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 1968343#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= (- C) (select q2 q2_back))))), 1968334#(and (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front))) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 1968339#(and (or (= (+ q1_front 1) q1_back) (= (+ 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)) (not (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0)) (= q2_back q2_front)) (or (<= 0 (+ total (select q1 q1_front))) (not (= (+ (select q2 q2_front) C) 0)) (not (< q1_front q1_back)) (not (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0))) (or (not (= (+ (select q2 q2_front) C) 0)) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front q1_back)) (not (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0)))), 1968328#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (< q1_front (+ q1_back 1)))) (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front))), 1968326#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (< 0 (+ total (select q1 q1_front) 1))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front (+ q1_back 1))))), 1968341#(and (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (<= (+ C total) 0)) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (+ (select q2 q2_front) C) 0)) (not (= (select q1 q1_back) C)) (<= 0 (+ C total))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 1968324#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 1968329#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)) (not (< q1_front q1_back))))] [2022-03-15 22:02:20,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 22:02:20,999 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:20,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 22:02:20,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1886, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 22:02:21,000 INFO L87 Difference]: Start difference. First operand 17870 states and 77436 transitions. Second operand has 32 states, 31 states have (on average 4.161290322580645) internal successors, (129), 31 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:28,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:28,187 INFO L93 Difference]: Finished difference Result 54993 states and 227619 transitions. [2022-03-15 22:02:28,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-03-15 22:02:28,188 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.161290322580645) internal successors, (129), 31 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 22:02:28,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:28,425 INFO L225 Difference]: With dead ends: 54993 [2022-03-15 22:02:28,425 INFO L226 Difference]: Without dead ends: 54886 [2022-03-15 22:02:28,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 137 SyntacticMatches, 21 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4266 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1662, Invalid=10770, Unknown=0, NotChecked=0, Total=12432 [2022-03-15 22:02:28,426 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 1002 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:28,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1002 Valid, 274 Invalid, 2110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1856 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 22:02:28,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54886 states. [2022-03-15 22:02:29,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54886 to 17842. [2022-03-15 22:02:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17842 states, 17841 states have (on average 4.331035255871307) internal successors, (77270), 17841 states have internal predecessors, (77270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:29,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17842 states to 17842 states and 77270 transitions. [2022-03-15 22:02:29,415 INFO L78 Accepts]: Start accepts. Automaton has 17842 states and 77270 transitions. Word has length 30 [2022-03-15 22:02:29,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:29,415 INFO L470 AbstractCegarLoop]: Abstraction has 17842 states and 77270 transitions. [2022-03-15 22:02:29,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.161290322580645) internal successors, (129), 31 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:29,415 INFO L276 IsEmpty]: Start isEmpty. Operand 17842 states and 77270 transitions. [2022-03-15 22:02:29,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 22:02:29,459 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:29,459 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:29,477 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 22:02:29,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-15 22:02:29,662 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 22:02:29,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:29,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1409070225, now seen corresponding path program 31 times [2022-03-15 22:02:29,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:29,667 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265115456] [2022-03-15 22:02:29,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:29,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:29,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:29,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265115456] [2022-03-15 22:02:29,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265115456] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:29,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501704507] [2022-03-15 22:02:29,857 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:02:29,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:29,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:29,858 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 22:02:29,859 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 22:02:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:29,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 22:02:29,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:30,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:30,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:30,294 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2022-03-15 22:02:30,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:30,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:30,376 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:30,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 18 [2022-03-15 22:02:30,417 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:30,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:30,684 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:02:30,685 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 59 treesize of output 77 [2022-03-15 22:02:30,811 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:02:30,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 61 [2022-03-15 22:02:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:30,872 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501704507] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:30,872 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:30,872 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-03-15 22:02:30,872 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2008140795] [2022-03-15 22:02:30,872 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:30,875 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:30,902 INFO L252 McrAutomatonBuilder]: Finished intersection with 150 states and 317 transitions. [2022-03-15 22:02:30,902 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:35,331 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [2059354#(and (or (<= q1_back q1_front) (< 0 (+ total (select q1 q1_front) 1))) (or (<= q1_back q1_front) (<= (+ total (select q1 q1_front)) 0))), 2059347#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 2059357#(and (or (not (= (select q1 q1_back) C)) (<= (+ C total) 0)) (or (not (= (select q1 q1_back) C)) (<= 0 (+ 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))), 2059349#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (< 0 (+ total (select q1 q1_front) 1))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front (+ q1_back 1))))), 2059361#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 2059355#(and (or (not (= (select q1 q1_back) C)) (<= 0 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= (+ total (* 2 C)) 0)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 2059351#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)) (not (< q1_front q1_back)))), 2059350#(and (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (< 0 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (< q1_front q1_back)))), 2059358#(and (or (not (= (select q1 q1_back) C)) (< q2_front (+ q2_back 1))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= (+ C total) 0) (not (= (select q2 q2_front) (* (- 1) C)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (not (= (select q2 q2_front) (* (- 1) C))) (<= 0 (+ C total))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= (select q2 q2_front) (* (- 1) C))))), 2059348#(and (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (< 0 (+ total (select q1 q1_front) 1)) (not (< q1_front q1_back)))), 2059353#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (< 0 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)))), 2059356#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 2059352#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (<= (+ q1_front 1) q1_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= q1_back (+ q1_front 1)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back))))), 2059359#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 2059360#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= (- C) (select q2 q2_back)))))] [2022-03-15 22:02:35,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:02:35,331 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:35,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:02:35,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1076, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 22:02:35,332 INFO L87 Difference]: Start difference. First operand 17842 states and 77270 transitions. Second operand has 26 states, 25 states have (on average 4.24) internal successors, (106), 25 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:41,297 INFO L93 Difference]: Finished difference Result 62093 states and 256087 transitions. [2022-03-15 22:02:41,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-03-15 22:02:41,297 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.24) internal successors, (106), 25 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 22:02:41,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:41,554 INFO L225 Difference]: With dead ends: 62093 [2022-03-15 22:02:41,554 INFO L226 Difference]: Without dead ends: 61911 [2022-03-15 22:02:41,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 132 SyntacticMatches, 20 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2935 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1150, Invalid=8356, Unknown=0, NotChecked=0, Total=9506 [2022-03-15 22:02:41,555 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 771 mSDsluCounter, 2053 mSDsCounter, 0 mSdLazyCounter, 3199 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 3442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 3199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:41,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [771 Valid, 480 Invalid, 3442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 3199 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 22:02:41,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61911 states. [2022-03-15 22:02:42,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61911 to 18705. [2022-03-15 22:02:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18705 states, 18704 states have (on average 4.322872112917023) internal successors, (80855), 18704 states have internal predecessors, (80855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:42,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18705 states to 18705 states and 80855 transitions. [2022-03-15 22:02:42,550 INFO L78 Accepts]: Start accepts. Automaton has 18705 states and 80855 transitions. Word has length 30 [2022-03-15 22:02:42,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:42,550 INFO L470 AbstractCegarLoop]: Abstraction has 18705 states and 80855 transitions. [2022-03-15 22:02:42,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.24) internal successors, (106), 25 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:42,550 INFO L276 IsEmpty]: Start isEmpty. Operand 18705 states and 80855 transitions. [2022-03-15 22:02:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 22:02:42,587 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:42,587 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:42,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-03-15 22:02:42,791 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,SelfDestructingSolverStorable38 [2022-03-15 22:02:42,792 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 22:02:42,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:42,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1395262167, now seen corresponding path program 32 times [2022-03-15 22:02:42,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:42,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423080520] [2022-03-15 22:02:42,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:42,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:42,943 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:42,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423080520] [2022-03-15 22:02:42,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423080520] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:42,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449722128] [2022-03-15 22:02:42,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:02:42,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:42,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:42,944 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 22:02:42,945 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 22:02:42,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:02:42,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:42,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 22:02:42,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:43,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:43,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:43,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2022-03-15 22:02:43,306 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:02:43,306 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 14 [2022-03-15 22:02:43,346 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:43,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:43,663 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:02:43,663 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 59 treesize of output 77 [2022-03-15 22:02:43,755 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:02:43,755 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 61 [2022-03-15 22:02:43,796 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:43,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449722128] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:43,796 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:43,796 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-15 22:02:43,797 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1489359620] [2022-03-15 22:02:43,797 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:43,799 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:43,827 INFO L252 McrAutomatonBuilder]: Finished intersection with 154 states and 326 transitions. [2022-03-15 22:02:43,827 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:48,946 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [2159198#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 2159197#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= (- C) (select q2 q2_back))))), 2159195#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 2159191#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))))), 2159193#(and (or (not (= (select q1 q1_back) C)) (<= (+ C total) 0)) (or (not (= (select q1 q1_back) C)) (<= 0 (+ 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))), 2159196#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (<= (+ q1_front 1) q1_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= q1_back (+ q1_front 1)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back))))), 2159190#(and (or (= (+ q1_front 1) q1_back) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (< q1_front q1_back))) (or (<= (+ total (select q1 q1_front)) 0) (not (< q1_front q1_back)) (not (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0))) (or (= (+ (select q2 q2_front) C) 0) (not (< q1_front q1_back))) (or (<= 0 (+ total (select q1 q1_front))) (not (< q1_front q1_back)) (not (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0)))), 2159194#(and (or (= (* (- 1) C) (select q2 (+ q2_front 1))) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 2159192#(and (or (= (+ q1_front 1) (+ q1_back 1)) (not (= (select q1 q1_back) C)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) 0) (not (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0)) (not (< q1_front (+ q1_back 1)))) (or (<= 0 (+ total (select q1 q1_front))) (not (= (select q1 q1_back) C)) (not (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0)) (not (< q1_front (+ q1_back 1)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 1))))), 2159183#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1))) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0))), 2159187#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (<= q1_back q1_front)) (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (<= q1_back q1_front))), 2159188#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front))), 2159184#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 2159185#(and (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0)) (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)))), 2159189#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)) (not (< q1_front q1_back)))), 2159186#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))))] [2022-03-15 22:02:48,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:02:48,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:48,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:02:48,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1073, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 22:02:48,947 INFO L87 Difference]: Start difference. First operand 18705 states and 80855 transitions. Second operand has 27 states, 26 states have (on average 4.461538461538462) internal successors, (116), 26 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 22:02:52,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:52,318 INFO L93 Difference]: Finished difference Result 46602 states and 193655 transitions. [2022-03-15 22:02:52,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 22:02:52,318 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.461538461538462) internal successors, (116), 26 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 22:02:52,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:52,484 INFO L225 Difference]: With dead ends: 46602 [2022-03-15 22:02:52,485 INFO L226 Difference]: Without dead ends: 46579 [2022-03-15 22:02:52,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 138 SyntacticMatches, 18 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1794 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=805, Invalid=5047, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 22:02:52,486 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 607 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 2568 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 2734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 2568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:52,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [607 Valid, 379 Invalid, 2734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 2568 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 22:02:52,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46579 states. [2022-03-15 22:02:53,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46579 to 18845. [2022-03-15 22:02:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18845 states, 18844 states have (on average 4.320685629378051) internal successors, (81419), 18844 states have internal predecessors, (81419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:53,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18845 states to 18845 states and 81419 transitions. [2022-03-15 22:02:53,159 INFO L78 Accepts]: Start accepts. Automaton has 18845 states and 81419 transitions. Word has length 30 [2022-03-15 22:02:53,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:53,159 INFO L470 AbstractCegarLoop]: Abstraction has 18845 states and 81419 transitions. [2022-03-15 22:02:53,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.461538461538462) internal successors, (116), 26 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 22:02:53,159 INFO L276 IsEmpty]: Start isEmpty. Operand 18845 states and 81419 transitions. [2022-03-15 22:02:53,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 22:02:53,200 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:53,200 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:53,216 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 22:02:53,415 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,SelfDestructingSolverStorable39 [2022-03-15 22:02:53,416 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 22:02:53,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:53,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1209762225, now seen corresponding path program 33 times [2022-03-15 22:02:53,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:53,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087395577] [2022-03-15 22:02:53,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:53,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:53,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:53,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087395577] [2022-03-15 22:02:53,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087395577] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:53,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571792619] [2022-03-15 22:02:53,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:02:53,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:53,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:53,725 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 22:02:53,726 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 22:02:53,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 22:02:53,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:53,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 22:02:53,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:54,020 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:02:54,020 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 57 treesize of output 33 [2022-03-15 22:02:54,057 INFO L353 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-03-15 22:02:54,057 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 44 treesize of output 40 [2022-03-15 22:02:54,150 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:54,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:55,152 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:02:55,152 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 56 treesize of output 74 [2022-03-15 22:02:55,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:55,476 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-03-15 22:02:55,477 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 42 treesize of output 42 [2022-03-15 22:02:55,505 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:55,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571792619] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:55,505 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:55,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25 [2022-03-15 22:02:55,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1877537002] [2022-03-15 22:02:55,506 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:55,508 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:55,537 INFO L252 McrAutomatonBuilder]: Finished intersection with 155 states and 327 transitions. [2022-03-15 22:02:55,537 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:01,364 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [2243776#(and (or (<= q1_back q1_front) (< 0 (+ total (select q1 q1_front) 1))) (or (<= q1_back q1_front) (<= (+ total (select q1 q1_front)) 0))), 2243782#(and (or (= (+ q1_front 1) q1_back) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (< q1_front q1_back))) (or (<= (+ total (select q1 q1_front)) 0) (not (< q1_front q1_back)) (not (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0))) (or (= (+ (select q2 q2_front) C) 0) (not (< q1_front q1_back))) (or (<= 0 (+ total (select q1 q1_front))) (not (< q1_front q1_back)) (not (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0)))), 2243786#(and (or (not (= (select q1 q1_back) C)) (<= (+ C total) 0)) (or (not (= (select q1 q1_back) C)) (<= 0 (+ 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))), 2243785#(and (or (= (+ q1_front 1) (+ q1_back 1)) (not (= (select q1 q1_back) C)) (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) 0) (not (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0)) (not (< q1_front (+ q1_back 1)))) (or (<= 0 (+ total (select q1 q1_front))) (not (= (select q1 q1_back) C)) (not (= (+ C (* (- 1) (select q1 (+ q1_front 1)))) 0)) (not (< q1_front (+ q1_back 1)))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (< q1_front (+ q1_back 1))))), 2243777#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (<= q1_back q1_front)) (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (<= q1_back q1_front))), 2243790#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 2243780#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)) (not (< q1_front q1_back)))), 2243775#(and (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 2243781#(and (or (not (= (select q1 q1_back) C)) (<= (+ total (select q1 q1_front)) 0)) (or (<= 0 (+ total (select q1 q1_front))) (not (= (select q1 q1_back) C)))), 2243788#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 2243783#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (<= (+ q1_front 1) q1_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= q1_back (+ q1_front 1)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back))))), 2243778#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (< 0 (+ total (select q1 q1_front) 1))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front (+ q1_back 1))))), 2243779#(and (or (<= (+ (select q2 q2_front) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (< q1_front (+ q1_back 1)))) (or (< 0 (+ (select q2 q2_front) total (select q1 q1_front) 1)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front))), 2243774#(and (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (< 0 (+ total (select q1 q1_front) 1)) (not (< q1_front q1_back)))), 2243703#(or (and (<= total 0) (< 0 (+ total 1))) (< q1_front q1_back)), 2243787#(and (or (= (* (- 1) C) (select q2 (+ q2_front 1))) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 2243784#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)) (not (< q1_front (+ q1_back 1)))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))))), 2243789#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= (- C) (select q2 q2_back)))))] [2022-03-15 22:03:01,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 22:03:01,365 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:01,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 22:03:01,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1652, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:03:01,365 INFO L87 Difference]: Start difference. First operand 18845 states and 81419 transitions. Second operand has 29 states, 28 states have (on average 4.214285714285714) internal successors, (118), 28 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 22:03:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:08,023 INFO L93 Difference]: Finished difference Result 60364 states and 250570 transitions. [2022-03-15 22:03:08,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-03-15 22:03:08,023 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.214285714285714) internal successors, (118), 28 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 30 [2022-03-15 22:03:08,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:08,275 INFO L225 Difference]: With dead ends: 60364 [2022-03-15 22:03:08,275 INFO L226 Difference]: Without dead ends: 60325 [2022-03-15 22:03:08,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 115 SyntacticMatches, 34 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4311 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1536, Invalid=10674, Unknown=0, NotChecked=0, Total=12210 [2022-03-15 22:03:08,276 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 786 mSDsluCounter, 1697 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 3098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:08,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [786 Valid, 405 Invalid, 3098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 22:03:08,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60325 states. [2022-03-15 22:03:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60325 to 18705. [2022-03-15 22:03:09,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18705 states, 18704 states have (on average 4.322872112917023) internal successors, (80855), 18704 states have internal predecessors, (80855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18705 states to 18705 states and 80855 transitions. [2022-03-15 22:03:09,200 INFO L78 Accepts]: Start accepts. Automaton has 18705 states and 80855 transitions. Word has length 30 [2022-03-15 22:03:09,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:09,201 INFO L470 AbstractCegarLoop]: Abstraction has 18705 states and 80855 transitions. [2022-03-15 22:03:09,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.214285714285714) internal successors, (118), 28 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 22:03:09,201 INFO L276 IsEmpty]: Start isEmpty. Operand 18705 states and 80855 transitions. [2022-03-15 22:03:09,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 22:03:09,240 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:09,240 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:09,258 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 22:03:09,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:09,456 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 22:03:09,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:09,457 INFO L85 PathProgramCache]: Analyzing trace with hash -241208337, now seen corresponding path program 34 times [2022-03-15 22:03:09,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:09,458 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523615946] [2022-03-15 22:03:09,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:09,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:09,628 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:09,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523615946] [2022-03-15 22:03:09,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523615946] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:09,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541001014] [2022-03-15 22:03:09,628 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:03:09,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:09,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:09,629 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 22:03:09,631 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 22:03:09,666 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:03:09,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:03:09,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 22:03:09,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:09,870 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:03:09,870 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 39 treesize of output 21 [2022-03-15 22:03:09,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:03:09,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:03:09,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:09,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 18 [2022-03-15 22:03:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:09,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:10,183 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:03:10,196 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 59 treesize of output 77 [2022-03-15 22:03:10,294 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:03:10,295 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 61 [2022-03-15 22:03:10,351 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:10,351 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541001014] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:10,351 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:10,351 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-15 22:03:10,351 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [834849754] [2022-03-15 22:03:10,351 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:10,353 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:10,382 INFO L252 McrAutomatonBuilder]: Finished intersection with 150 states and 317 transitions. [2022-03-15 22:03:10,382 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:16,453 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [2341904#(and (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 2341900#(and (or (not (= (select q1 q1_back) C)) (<= 0 (+ total (* 2 C)))) (or (not (= (select q1 q1_back) C)) (<= (+ total (* 2 C)) 0)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 2341907#(and (or (<= q1_back q1_front) (< 0 (+ total (select q1 q1_front) 1))) (or (<= q1_back q1_front) (<= (+ total (select q1 q1_front)) 0))), 2341893#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 2341895#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (< 0 (+ total (select q1 q1_front) 1))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front (+ q1_back 1))))), 2341894#(and (or (< (+ q1_front 1) q1_back) (<= (+ total (select q1 q1_front)) 0) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (< 0 (+ total (select q1 q1_front) 1)) (not (< q1_front q1_back)))), 2341898#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (< 0 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)))), 2341897#(and (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)) (not (< q1_front q1_back)))), 2341896#(and (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (< 0 (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) 1)) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (< q1_front q1_back)))), 2341899#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (<= (+ q1_front 1) q1_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= q1_back (+ q1_front 1)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back))))), 2341905#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (<= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back) (not (= (- C) (select q2 q2_back))))), 2341901#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 1)))) (< 0 (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front) 1))) (or (<= (+ (select q2 q2_front) (select q1 (+ q1_front 1)) total (select q1 q1_front)) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1))))), 2341903#(and (or (= (* (- 1) C) (select q2 (+ q2_front 1))) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front))), 2341902#(and (or (not (= (select q1 q1_back) C)) (<= (+ C total) 0)) (or (not (= (select q1 q1_back) C)) (<= 0 (+ 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))), 2341906#(and (or (not (= (select q1 q1_back) C)) (= q2_back q2_front)) (or (not (= (select q1 q1_back) C)) (<= q1_front q1_back)) (or (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C))) (or (not (= (select q1 q1_back) C)) (<= q1_back q1_front)))] [2022-03-15 22:03:16,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:03:16,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:16,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:03:16,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1018, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 22:03:16,454 INFO L87 Difference]: Start difference. First operand 18705 states and 80855 transitions. Second operand has 26 states, 25 states have (on average 4.24) internal successors, (106), 25 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:20,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:20,472 INFO L93 Difference]: Finished difference Result 58094 states and 243314 transitions. [2022-03-15 22:03:20,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 22:03:20,472 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.24) internal successors, (106), 25 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 22:03:20,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:20,714 INFO L225 Difference]: With dead ends: 58094 [2022-03-15 22:03:20,714 INFO L226 Difference]: Without dead ends: 58046 [2022-03-15 22:03:20,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 131 SyntacticMatches, 22 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=826, Invalid=5180, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 22:03:20,715 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 563 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 2179 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 2375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 2179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:20,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [563 Valid, 366 Invalid, 2375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 2179 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 22:03:20,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58046 states. [2022-03-15 22:03:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58046 to 18689. [2022-03-15 22:03:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18689 states, 18688 states have (on average 4.324539811643835) internal successors, (80817), 18688 states have internal predecessors, (80817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18689 states to 18689 states and 80817 transitions. [2022-03-15 22:03:21,683 INFO L78 Accepts]: Start accepts. Automaton has 18689 states and 80817 transitions. Word has length 30 [2022-03-15 22:03:21,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:21,683 INFO L470 AbstractCegarLoop]: Abstraction has 18689 states and 80817 transitions. [2022-03-15 22:03:21,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.24) internal successors, (106), 25 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:21,683 INFO L276 IsEmpty]: Start isEmpty. Operand 18689 states and 80817 transitions. [2022-03-15 22:03:21,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 22:03:21,722 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:21,722 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 22:03:21,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-15 22:03:21,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:21,938 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 22:03:21,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:21,938 INFO L85 PathProgramCache]: Analyzing trace with hash 268422436, now seen corresponding path program 35 times [2022-03-15 22:03:21,939 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:21,939 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057395375] [2022-03-15 22:03:21,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:21,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:03:21,971 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:21,971 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057395375] [2022-03-15 22:03:21,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057395375] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:21,971 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404600186] [2022-03-15 22:03:21,971 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:03:21,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:21,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:21,973 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 22:03:22,031 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 22:03:22,066 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:03:22,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:03:22,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:03:22,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:22,193 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:03:22,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:03:22,253 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404600186] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:22,253 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:22,253 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-03-15 22:03:22,254 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [996328661] [2022-03-15 22:03:22,254 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:22,256 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:22,285 INFO L252 McrAutomatonBuilder]: Finished intersection with 157 states and 334 transitions. [2022-03-15 22:03:22,285 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:23,359 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [2437667#(or (<= N j) (<= j i)), 2437663#(or (< (+ j 1) N) (< i N)), 2437660#(or (<= j (+ i 1)) (<= N i)), 2437657#(or (<= (+ N 1) i) (< j N)), 2437665#(or (<= N i) (< (+ j 1) N)), 2437658#(or (<= N i) (< j N)), 2437655#(< i N), 2437662#(< (+ j 1) N), 2437659#(or (<= N (+ i 1)) (< j N)), 2437661#(or (<= N i) (<= j i)), 2437654#(< j N), 2437664#(or (<= (+ N 1) i) (< (+ j 1) N)), 2437666#(or (<= N j) (<= N i) (< (+ j 1) N)), 2437656#(or (< j N) (< i N))] [2022-03-15 22:03:23,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:03:23,359 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:23,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:03:23,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2022-03-15 22:03:23,360 INFO L87 Difference]: Start difference. First operand 18689 states and 80817 transitions. Second operand has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 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 22:03:24,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:24,192 INFO L93 Difference]: Finished difference Result 35224 states and 147680 transitions. [2022-03-15 22:03:24,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 22:03:24,192 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 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 22:03:24,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:24,324 INFO L225 Difference]: With dead ends: 35224 [2022-03-15 22:03:24,324 INFO L226 Difference]: Without dead ends: 34999 [2022-03-15 22:03:24,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=461, Invalid=1609, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 22:03:24,324 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 343 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:24,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 1 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:03:24,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34999 states. [2022-03-15 22:03:25,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34999 to 26559. [2022-03-15 22:03:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26559 states, 26558 states have (on average 4.386700805783568) internal successors, (116502), 26558 states have internal predecessors, (116502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26559 states to 26559 states and 116502 transitions. [2022-03-15 22:03:25,204 INFO L78 Accepts]: Start accepts. Automaton has 26559 states and 116502 transitions. Word has length 30 [2022-03-15 22:03:25,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:25,204 INFO L470 AbstractCegarLoop]: Abstraction has 26559 states and 116502 transitions. [2022-03-15 22:03:25,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 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 22:03:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 26559 states and 116502 transitions. [2022-03-15 22:03:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 22:03:25,265 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:25,266 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:25,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-03-15 22:03:25,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:25,468 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 22:03:25,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:25,468 INFO L85 PathProgramCache]: Analyzing trace with hash 64199075, now seen corresponding path program 36 times [2022-03-15 22:03:25,469 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:25,469 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023475402] [2022-03-15 22:03:25,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:25,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 22:03:25,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:25,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023475402] [2022-03-15 22:03:25,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023475402] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:25,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791948749] [2022-03-15 22:03:25,515 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:03:25,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:25,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:25,517 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 22:03:25,517 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 22:03:25,554 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 22:03:25,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:03:25,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 22:03:25,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:25,604 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 22:03:25,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 22:03:25,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791948749] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:25,661 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:25,661 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 8 [2022-03-15 22:03:25,662 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [807754405] [2022-03-15 22:03:25,662 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:25,664 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:25,715 INFO L252 McrAutomatonBuilder]: Finished intersection with 221 states and 513 transitions. [2022-03-15 22:03:25,716 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:28,447 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [2526250#(or (< (+ i 1) N) (<= q1_back (+ q1_front 2))), 2526247#(or (< (+ q1_front 3) q1_back) (<= q1_back (+ q1_front 2)) (< i N)), 2526244#(< i N), 2526254#(or (< (+ i 1) N) (not (< i N)) (<= q1_back (+ q1_front 1))), 2526245#(or (<= q1_back q1_front) (< i N)), 2526252#(or (<= N (+ i 1)) (< (+ q1_front 2) q1_back) (< (+ 2 i) N) (<= q1_back (+ q1_front 1))), 2526241#(or (< q1_front q1_back) (< i N)), 2526242#(or (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (< i N)), 2526253#(or (<= N (+ i 1)) (< (+ 2 i) N) (< (+ q1_front 1) q1_back) (<= q1_back q1_front)), 2526255#(or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= q1_back (+ q1_front 1))), 2526243#(or (< (+ q1_front 2) q1_back) (< i N) (<= q1_back (+ q1_front 1))), 2526251#(or (< (+ q1_front 2) q1_back) (<= N i) (< (+ i 1) N) (<= q1_back (+ q1_front 1))), 2526248#(or (<= q1_back (+ q1_front 2)) (< i N)), 2526246#(or (< i N) (<= q1_back (+ q1_front 1))), 2526249#(or (< (+ q1_front 3) q1_back) (< (+ i 1) N) (<= q1_back (+ q1_front 2))), 2526256#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= q1_back q1_front))] [2022-03-15 22:03:28,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:03:28,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:28,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:03:28,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:03:28,448 INFO L87 Difference]: Start difference. First operand 26559 states and 116502 transitions. Second operand has 24 states, 24 states have (on average 5.208333333333333) internal successors, (125), 23 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 22:03:29,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:29,088 INFO L93 Difference]: Finished difference Result 44930 states and 195142 transitions. [2022-03-15 22:03:29,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 22:03:29,089 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.208333333333333) internal successors, (125), 23 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 32 [2022-03-15 22:03:29,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:29,268 INFO L225 Difference]: With dead ends: 44930 [2022-03-15 22:03:29,268 INFO L226 Difference]: Without dead ends: 44402 [2022-03-15 22:03:29,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 229 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=341, Invalid=849, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 22:03:29,269 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 423 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:29,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 53 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:03:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44402 states. [2022-03-15 22:03:30,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44402 to 27567. [2022-03-15 22:03:30,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27567 states, 27566 states have (on average 4.377893056664006) internal successors, (120681), 27566 states have internal predecessors, (120681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:30,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27567 states to 27567 states and 120681 transitions. [2022-03-15 22:03:30,199 INFO L78 Accepts]: Start accepts. Automaton has 27567 states and 120681 transitions. Word has length 32 [2022-03-15 22:03:30,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:30,199 INFO L470 AbstractCegarLoop]: Abstraction has 27567 states and 120681 transitions. [2022-03-15 22:03:30,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.208333333333333) internal successors, (125), 23 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 22:03:30,199 INFO L276 IsEmpty]: Start isEmpty. Operand 27567 states and 120681 transitions. [2022-03-15 22:03:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 22:03:30,269 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:30,269 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:30,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-15 22:03:30,481 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,SelfDestructingSolverStorable43 [2022-03-15 22:03:30,481 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 22:03:30,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:30,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1309403103, now seen corresponding path program 37 times [2022-03-15 22:03:30,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:30,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378826293] [2022-03-15 22:03:30,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:30,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:30,509 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 22:03:30,509 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:30,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378826293] [2022-03-15 22:03:30,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378826293] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:30,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316470790] [2022-03-15 22:03:30,510 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:03:30,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:30,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:30,511 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 22:03:30,518 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 22:03:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:30,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 22:03:30,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 22:03:30,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:30,647 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 22:03:30,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316470790] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:30,647 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:30,647 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-03-15 22:03:30,647 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [510670713] [2022-03-15 22:03:30,647 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:30,650 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:30,705 INFO L252 McrAutomatonBuilder]: Finished intersection with 239 states and 553 transitions. [2022-03-15 22:03:30,705 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:31,949 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:03:31,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 22:03:31,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:31,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 22:03:31,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 22:03:31,949 INFO L87 Difference]: Start difference. First operand 27567 states and 120681 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:32,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:32,296 INFO L93 Difference]: Finished difference Result 40526 states and 175688 transitions. [2022-03-15 22:03:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 22:03:32,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 22:03:32,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:32,458 INFO L225 Difference]: With dead ends: 40526 [2022-03-15 22:03:32,458 INFO L226 Difference]: Without dead ends: 39883 [2022-03-15 22:03:32,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 264 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 22:03:32,458 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 38 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:32,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 16 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:03:32,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39883 states. [2022-03-15 22:03:33,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39883 to 32206. [2022-03-15 22:03:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32206 states, 32205 states have (on average 4.3633907778295296) internal successors, (140523), 32205 states have internal predecessors, (140523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32206 states to 32206 states and 140523 transitions. [2022-03-15 22:03:33,527 INFO L78 Accepts]: Start accepts. Automaton has 32206 states and 140523 transitions. Word has length 32 [2022-03-15 22:03:33,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:33,527 INFO L470 AbstractCegarLoop]: Abstraction has 32206 states and 140523 transitions. [2022-03-15 22:03:33,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:33,527 INFO L276 IsEmpty]: Start isEmpty. Operand 32206 states and 140523 transitions. [2022-03-15 22:03:33,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 22:03:33,610 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:33,610 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:33,626 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 22:03:33,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-03-15 22:03:33,826 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 22:03:33,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:33,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1638314008, now seen corresponding path program 38 times [2022-03-15 22:03:33,827 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:33,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713848771] [2022-03-15 22:03:33,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:33,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:33,855 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 22:03:33,855 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:33,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713848771] [2022-03-15 22:03:33,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713848771] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:33,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666450970] [2022-03-15 22:03:33,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:03:33,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:33,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:33,856 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 22:03:33,884 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 22:03:33,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:03:33,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:03:33,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:03:33,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 22:03:34,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:34,096 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 22:03:34,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666450970] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:34,096 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:34,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-03-15 22:03:34,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1559613498] [2022-03-15 22:03:34,096 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:34,099 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:34,275 INFO L252 McrAutomatonBuilder]: Finished intersection with 237 states and 547 transitions. [2022-03-15 22:03:34,275 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:37,311 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [2731695#(or (< (+ 2 j) N) (<= N (+ 2 i)) (< (+ 3 i) N)), 2731691#(or (<= N j) (< (+ 2 j) N) (< i N)), 2731683#(< i N), 2731696#(or (<= N j) (< (+ 2 j) N) (<= N (+ 2 i)) (< (+ 3 i) N)), 2731688#(or (< (+ 2 j) N) (<= N i) (< (+ i 1) N)), 2731689#(or (<= N (+ i 1)) (< (+ 2 j) N) (< (+ 2 i) N)), 2731686#(or (< (+ 2 j) N) (< i N)), 2731685#(or (< (+ j 1) N) (< i N)), 2731694#(or (<= N (+ i 1)) (<= N j) (< (+ 2 j) N) (< (+ 2 i) N)), 2731687#(or (< (+ 2 j) N) (< (+ i 1) N)), 2731692#(or (<= N j) (< (+ 2 j) N) (< (+ i 1) N)), 2731693#(or (<= N j) (< (+ 2 j) N) (<= N i) (< (+ i 1) N)), 2731684#(or (< j N) (< i N)), 2731690#(or (<= N j) (<= (+ 3 j) N))] [2022-03-15 22:03:37,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 22:03:37,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:37,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 22:03:37,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2022-03-15 22:03:37,312 INFO L87 Difference]: Start difference. First operand 32206 states and 140523 transitions. Second operand has 22 states, 22 states have (on average 6.181818181818182) internal successors, (136), 21 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 22:03:38,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:38,355 INFO L93 Difference]: Finished difference Result 55059 states and 222215 transitions. [2022-03-15 22:03:38,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 22:03:38,355 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.181818181818182) internal successors, (136), 21 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 34 [2022-03-15 22:03:38,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:38,560 INFO L225 Difference]: With dead ends: 55059 [2022-03-15 22:03:38,560 INFO L226 Difference]: Without dead ends: 53006 [2022-03-15 22:03:38,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 217 SyntacticMatches, 32 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=589, Invalid=1961, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 22:03:38,561 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 383 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:38,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [383 Valid, 1 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:03:38,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53006 states. [2022-03-15 22:03:39,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53006 to 36544. [2022-03-15 22:03:39,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36544 states, 36543 states have (on average 4.316230194565307) internal successors, (157728), 36543 states have internal predecessors, (157728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:39,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36544 states to 36544 states and 157728 transitions. [2022-03-15 22:03:39,866 INFO L78 Accepts]: Start accepts. Automaton has 36544 states and 157728 transitions. Word has length 34 [2022-03-15 22:03:39,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:39,867 INFO L470 AbstractCegarLoop]: Abstraction has 36544 states and 157728 transitions. [2022-03-15 22:03:39,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.181818181818182) internal successors, (136), 21 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 22:03:39,867 INFO L276 IsEmpty]: Start isEmpty. Operand 36544 states and 157728 transitions. [2022-03-15 22:03:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 22:03:40,160 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:40,160 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:40,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-15 22:03:40,375 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,SelfDestructingSolverStorable45 [2022-03-15 22:03:40,375 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 22:03:40,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:40,376 INFO L85 PathProgramCache]: Analyzing trace with hash 2039542811, now seen corresponding path program 39 times [2022-03-15 22:03:40,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:40,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229706477] [2022-03-15 22:03:40,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:40,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 22:03:40,414 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:40,414 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229706477] [2022-03-15 22:03:40,414 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229706477] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:40,414 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813422792] [2022-03-15 22:03:40,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:03:40,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:40,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:40,415 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 22:03:40,416 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 22:03:40,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 22:03:40,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:03:40,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:03:40,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 22:03:40,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:40,632 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 22:03:40,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813422792] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:40,633 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:40,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-03-15 22:03:40,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [541040677] [2022-03-15 22:03:40,633 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:40,636 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:40,687 INFO L252 McrAutomatonBuilder]: Finished intersection with 219 states and 499 transitions. [2022-03-15 22:03:40,687 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:42,980 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [2860109#(or (<= N (+ 2 j)) (<= N i) (< (+ i 1) N)), 2860108#(or (<= N (+ 2 j)) (< (+ i 1) N)), 2860102#(< j N), 2860107#(or (<= N (+ 2 j)) (< i N)), 2860110#(or (<= N (+ i 1)) (<= N (+ 2 j)) (< (+ 2 i) N)), 2860103#(< i N), 2860105#(or (<= N j) (< i N)), 2860106#(or (<= N (+ j 1)) (< i N)), 2860104#(or (< j N) (< i N))] [2022-03-15 22:03:42,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 22:03:42,980 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:42,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 22:03:42,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2022-03-15 22:03:42,980 INFO L87 Difference]: Start difference. First operand 36544 states and 157728 transitions. Second operand has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 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 22:03:43,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:43,822 INFO L93 Difference]: Finished difference Result 53885 states and 225347 transitions. [2022-03-15 22:03:43,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 22:03:43,823 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 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 34 [2022-03-15 22:03:43,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:44,072 INFO L225 Difference]: With dead ends: 53885 [2022-03-15 22:03:44,072 INFO L226 Difference]: Without dead ends: 53530 [2022-03-15 22:03:44,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=394, Invalid=1328, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:03:44,076 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 306 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:44,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 1 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:03:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53530 states. [2022-03-15 22:03:45,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53530 to 45792. [2022-03-15 22:03:45,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45792 states, 45791 states have (on average 4.33244524033107) internal successors, (198387), 45791 states have internal predecessors, (198387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:45,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45792 states to 45792 states and 198387 transitions. [2022-03-15 22:03:45,806 INFO L78 Accepts]: Start accepts. Automaton has 45792 states and 198387 transitions. Word has length 34 [2022-03-15 22:03:45,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:45,806 INFO L470 AbstractCegarLoop]: Abstraction has 45792 states and 198387 transitions. [2022-03-15 22:03:45,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 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 22:03:45,806 INFO L276 IsEmpty]: Start isEmpty. Operand 45792 states and 198387 transitions. [2022-03-15 22:03:45,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 22:03:45,913 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:45,913 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:45,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-03-15 22:03:46,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-03-15 22:03:46,129 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 22:03:46,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:46,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1094172516, now seen corresponding path program 40 times [2022-03-15 22:03:46,129 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:46,130 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685220474] [2022-03-15 22:03:46,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:46,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:46,150 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 22:03:46,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:46,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685220474] [2022-03-15 22:03:46,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685220474] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:46,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516922043] [2022-03-15 22:03:46,150 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:03:46,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:46,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:46,151 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 22:03:46,153 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 22:03:46,179 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:03:46,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:03:46,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:03:46,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 22:03:46,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:46,352 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 22:03:46,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516922043] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:46,352 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:46,352 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 11 [2022-03-15 22:03:46,352 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [562070630] [2022-03-15 22:03:46,352 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:46,355 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:46,403 INFO L252 McrAutomatonBuilder]: Finished intersection with 197 states and 418 transitions. [2022-03-15 22:03:46,403 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:48,039 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [3005839#(or (<= N (+ i 1)) (<= j i)), 3005829#(< i N), 3005831#(or (<= N i) (< j N)), 3005828#(< j N), 3005830#(or (< j N) (< i N)), 3005838#(or (<= N j) (<= (+ j 1) i)), 3005837#(or (<= N j) (<= (+ 2 j) i)), 3005833#(< (+ j 1) N), 3005840#(or (<= N j) (<= j i)), 3005834#(or (<= N j) (< (+ j 1) N)), 3005832#(or (<= N i) (<= (+ j 1) i)), 3005835#(or (< (+ j 1) N) (< i N)), 3005836#(or (< (+ 2 j) N) (<= N (+ j 1)))] [2022-03-15 22:03:48,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 22:03:48,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:48,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 22:03:48,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:03:48,040 INFO L87 Difference]: Start difference. First operand 45792 states and 198387 transitions. Second operand has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 18 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:48,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:48,855 INFO L93 Difference]: Finished difference Result 50198 states and 213508 transitions. [2022-03-15 22:03:48,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 22:03:48,856 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 18 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 22:03:48,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:49,168 INFO L225 Difference]: With dead ends: 50198 [2022-03-15 22:03:49,169 INFO L226 Difference]: Without dead ends: 50109 [2022-03-15 22:03:49,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 211 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=395, Invalid=1327, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:03:49,169 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 279 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:49,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 1 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:03:49,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50109 states. [2022-03-15 22:03:50,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50109 to 40578. [2022-03-15 22:03:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40578 states, 40577 states have (on average 4.315917884515859) internal successors, (175127), 40577 states have internal predecessors, (175127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:50,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40578 states to 40578 states and 175127 transitions. [2022-03-15 22:03:50,569 INFO L78 Accepts]: Start accepts. Automaton has 40578 states and 175127 transitions. Word has length 34 [2022-03-15 22:03:50,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:50,569 INFO L470 AbstractCegarLoop]: Abstraction has 40578 states and 175127 transitions. [2022-03-15 22:03:50,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 18 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 40578 states and 175127 transitions. [2022-03-15 22:03:50,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 22:03:50,667 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:50,668 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:50,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-15 22:03:50,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:50,884 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 22:03:50,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:50,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2056598195, now seen corresponding path program 41 times [2022-03-15 22:03:50,886 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:50,886 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972219555] [2022-03-15 22:03:50,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:50,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:03:50,922 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:50,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972219555] [2022-03-15 22:03:50,922 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972219555] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:50,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233945896] [2022-03-15 22:03:50,922 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:03:50,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:50,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:50,924 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 22:03:50,936 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 22:03:50,968 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:03:50,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:03:50,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:03:50,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:51,090 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:03:51,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:51,139 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:03:51,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233945896] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:51,139 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:51,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 11 [2022-03-15 22:03:51,139 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [697663257] [2022-03-15 22:03:51,139 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:51,142 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:51,203 INFO L252 McrAutomatonBuilder]: Finished intersection with 215 states and 458 transitions. [2022-03-15 22:03:51,203 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:52,374 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [3137439#(< i N), 3137440#(< j N), 3137449#(<= N (+ 2 j)), 3137441#(or (< j N) (< i N)), 3137446#(or (<= N (+ j 1)) (< i N)), 3137443#(or (< (+ i 1) N) (< j N)), 3137445#(or (<= N j) (< i N)), 3137442#(< (+ i 1) N), 3137450#(or (<= i (+ 2 j)) (<= N (+ j 1))), 3137447#(<= i (+ j 1)), 3137451#(or (<= N j) (<= i j)), 3137455#(or (<= N i) (<= i j)), 3137452#(or (<= i (+ j 1)) (<= N (+ j 1))), 3137444#(<= N (+ j 1)), 3137453#(or (<= N i) (< (+ i 1) N)), 3137454#(or (<= N (+ i 1)) (< (+ 2 i) N)), 3137448#(or (<= N j) (<= i (+ j 1)))] [2022-03-15 22:03:52,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:03:52,375 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:52,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:03:52,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2022-03-15 22:03:52,375 INFO L87 Difference]: Start difference. First operand 40578 states and 175127 transitions. Second operand has 23 states, 23 states have (on average 5.913043478260869) internal successors, (136), 22 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 22:03:53,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:53,492 INFO L93 Difference]: Finished difference Result 66592 states and 282680 transitions. [2022-03-15 22:03:53,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 22:03:53,492 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.913043478260869) internal successors, (136), 22 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 34 [2022-03-15 22:03:53,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:53,922 INFO L225 Difference]: With dead ends: 66592 [2022-03-15 22:03:53,923 INFO L226 Difference]: Without dead ends: 66132 [2022-03-15 22:03:53,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=722, Invalid=2700, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:03:53,923 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 459 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:53,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 1 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:03:53,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66132 states. [2022-03-15 22:03:55,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66132 to 40965. [2022-03-15 22:03:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40965 states, 40964 states have (on average 4.3032174592324965) internal successors, (176277), 40964 states have internal predecessors, (176277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40965 states to 40965 states and 176277 transitions. [2022-03-15 22:03:55,503 INFO L78 Accepts]: Start accepts. Automaton has 40965 states and 176277 transitions. Word has length 34 [2022-03-15 22:03:55,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:55,503 INFO L470 AbstractCegarLoop]: Abstraction has 40965 states and 176277 transitions. [2022-03-15 22:03:55,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.913043478260869) internal successors, (136), 22 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 22:03:55,504 INFO L276 IsEmpty]: Start isEmpty. Operand 40965 states and 176277 transitions. [2022-03-15 22:03:55,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 22:03:55,603 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:55,603 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:55,619 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 22:03:55,819 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,SelfDestructingSolverStorable48 [2022-03-15 22:03:55,819 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 22:03:55,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:55,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1273063466, now seen corresponding path program 42 times [2022-03-15 22:03:55,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:55,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20694438] [2022-03-15 22:03:55,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:55,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:03:55,858 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:55,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20694438] [2022-03-15 22:03:55,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20694438] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:55,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27177339] [2022-03-15 22:03:55,858 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:03:55,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:55,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:55,859 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 22:03:55,875 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 22:03:55,914 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 22:03:55,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:03:55,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:03:55,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:03:56,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:03:56,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27177339] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:56,064 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:56,064 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-03-15 22:03:56,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [996871285] [2022-03-15 22:03:56,064 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:56,067 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:56,104 INFO L252 McrAutomatonBuilder]: Finished intersection with 167 states and 350 transitions. [2022-03-15 22:03:56,104 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:57,556 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [3286256#(or (< (+ j 1) N) (< i N)), 3286263#(or (<= N i) (<= j i)), 3286250#(< j N), 3286261#(or (<= N j) (<= j i)), 3286262#(or (<= N (+ 2 i)) (< j N)), 3286258#(or (<= N (+ i 1)) (< (+ j 1) N)), 3286260#(or (<= N (+ i 1)) (< (+ 2 j) N) (<= N (+ j 1))), 3286255#(< (+ j 1) N), 3286254#(or (<= N (+ i 1)) (< j N)), 3286253#(or (<= N i) (< j N)), 3286251#(< i N), 3286252#(or (< j N) (< i N)), 3286259#(or (<= N (+ i 1)) (<= N j) (< (+ j 1) N)), 3286257#(or (<= N i) (< (+ j 1) N))] [2022-03-15 22:03:57,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 22:03:57,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:57,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 22:03:57,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2022-03-15 22:03:57,557 INFO L87 Difference]: Start difference. First operand 40965 states and 176277 transitions. Second operand has 22 states, 22 states have (on average 5.409090909090909) internal successors, (119), 21 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:59,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:59,374 INFO L93 Difference]: Finished difference Result 96722 states and 407338 transitions. [2022-03-15 22:03:59,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 22:03:59,374 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.409090909090909) internal successors, (119), 21 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 22:03:59,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:59,837 INFO L225 Difference]: With dead ends: 96722 [2022-03-15 22:03:59,837 INFO L226 Difference]: Without dead ends: 95943 [2022-03-15 22:03:59,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=792, Invalid=2868, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 22:03:59,838 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 410 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:59,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 1 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:03:59,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95943 states. [2022-03-15 22:04:01,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95943 to 49915. [2022-03-15 22:04:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49915 states, 49914 states have (on average 4.320671555074728) internal successors, (215662), 49914 states have internal predecessors, (215662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:02,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49915 states to 49915 states and 215662 transitions. [2022-03-15 22:04:02,032 INFO L78 Accepts]: Start accepts. Automaton has 49915 states and 215662 transitions. Word has length 34 [2022-03-15 22:04:02,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:02,032 INFO L470 AbstractCegarLoop]: Abstraction has 49915 states and 215662 transitions. [2022-03-15 22:04:02,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.409090909090909) internal successors, (119), 21 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:02,032 INFO L276 IsEmpty]: Start isEmpty. Operand 49915 states and 215662 transitions. [2022-03-15 22:04:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 22:04:02,418 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:02,418 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:02,435 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 22:04:02,633 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,SelfDestructingSolverStorable49 [2022-03-15 22:04:02,633 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 22:04:02,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:02,633 INFO L85 PathProgramCache]: Analyzing trace with hash 800724836, now seen corresponding path program 43 times [2022-03-15 22:04:02,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:02,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724317932] [2022-03-15 22:04:02,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:02,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 22:04:02,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:02,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724317932] [2022-03-15 22:04:02,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724317932] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:02,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863012787] [2022-03-15 22:04:02,657 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:04:02,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:02,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:02,680 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 22:04:02,680 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 22:04:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:02,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:04:02,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 22:04:02,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 22:04:02,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863012787] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:02,825 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:02,825 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-03-15 22:04:02,825 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [600271293] [2022-03-15 22:04:02,825 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:02,832 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:02,926 INFO L252 McrAutomatonBuilder]: Finished intersection with 345 states and 813 transitions. [2022-03-15 22:04:02,926 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:05,642 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [3482891#(<= q2_front q2_back), 3483099#(or (<= (+ q2_front 2) q2_back) (<= q2_back q2_front))] [2022-03-15 22:04:05,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 22:04:05,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:05,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 22:04:05,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-03-15 22:04:05,643 INFO L87 Difference]: Start difference. First operand 49915 states and 215662 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 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 22:04:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:06,238 INFO L93 Difference]: Finished difference Result 68419 states and 297123 transitions. [2022-03-15 22:04:06,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 22:04:06,238 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 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 36 [2022-03-15 22:04:06,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:06,692 INFO L225 Difference]: With dead ends: 68419 [2022-03-15 22:04:06,692 INFO L226 Difference]: Without dead ends: 68419 [2022-03-15 22:04:06,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 371 SyntacticMatches, 8 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-03-15 22:04:06,693 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 60 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:06,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 35 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:04:06,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68419 states. [2022-03-15 22:04:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68419 to 55086. [2022-03-15 22:04:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55086 states, 55085 states have (on average 4.335699373695198) internal successors, (238832), 55085 states have internal predecessors, (238832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55086 states to 55086 states and 238832 transitions. [2022-03-15 22:04:08,642 INFO L78 Accepts]: Start accepts. Automaton has 55086 states and 238832 transitions. Word has length 36 [2022-03-15 22:04:08,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:08,642 INFO L470 AbstractCegarLoop]: Abstraction has 55086 states and 238832 transitions. [2022-03-15 22:04:08,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 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 22:04:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 55086 states and 238832 transitions. [2022-03-15 22:04:08,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 22:04:08,794 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:08,794 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:08,810 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 22:04:09,009 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,SelfDestructingSolverStorable50 [2022-03-15 22:04:09,009 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 22:04:09,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:09,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1740391458, now seen corresponding path program 44 times [2022-03-15 22:04:09,010 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:09,010 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457204497] [2022-03-15 22:04:09,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:09,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:04:09,326 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:09,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457204497] [2022-03-15 22:04:09,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457204497] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:09,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930195893] [2022-03-15 22:04:09,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:04:09,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:09,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:09,336 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 22:04:09,337 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 22:04:09,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:04:09,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:04:09,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 22:04:09,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:09,708 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 22:04:09,708 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 56 treesize of output 26 [2022-03-15 22:04:09,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:04:09,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:04:09,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:04:09,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:04:09,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:04:09,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:04:09,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 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 32 [2022-03-15 22:04:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:04:09,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:10,607 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:04:10,607 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 88 treesize of output 142 [2022-03-15 22:04:10,899 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:04:10,899 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 67 treesize of output 115 [2022-03-15 22:04:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:04:11,009 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930195893] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:11,009 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:11,010 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2022-03-15 22:04:11,010 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [683595595] [2022-03-15 22:04:11,010 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:11,015 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:11,111 INFO L252 McrAutomatonBuilder]: Finished intersection with 261 states and 599 transitions. [2022-03-15 22:04:11,111 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:31,942 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 34 new interpolants: [3661966#(and (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 2)))) (<= q2_back (+ q2_front 1)) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ q1_back 1) q1_front) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (<= (* 3 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))) (* 3 C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))))), 3661958#(and (or (<= (* 3 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 2) q1_back) (not (< (+ q1_front 1) q1_back)) (not (= (- C) (select q2 q2_back)))) (or (< (+ q1_front 2) q1_back) (<= q2_front q2_back) (not (< (+ q1_front 1) q1_back)) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 3 C)) (< (+ q1_front 2) q1_back) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= q2_back q2_front) (not (< (+ q1_front 1) q1_back)) (not (= (- C) (select q2 q2_back))))), 3661961#(and (or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= (* 3 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< (+ q1_front 1) q1_back)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))) (* 3 C)) (not (< (+ q1_front 1) q1_back)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= q2_back q2_front) (not (< (+ q1_front 1) q1_back)) (not (= (- C) (select q2 q2_back)))) (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= q2_front q2_back) (<= q1_back (+ q1_front 1)))), 3661944#(and (or (< q1_front q1_back) (< 0 (+ total 1))) (or (<= total 0) (< q1_front q1_back))), 3661976#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (= C (select q1 (+ q1_front 2))) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 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)))) (= q2_back q2_front)) (or (= C (select q1 q1_front)) (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)))) (= (select q1 (+ q1_front 1)) C))), 3661968#(and (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))) (* 3 C)) (< (+ q1_front 1) q1_back) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (<= (* 3 C) (+ (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 (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))))), 3661954#(and (or (< (+ q1_front 3) q1_back) (= (+ (select q2 q2_front) C) 0) (not (< (+ q1_front 2) q1_back))) (or (< (+ q1_front 3) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))) (* 3 C)) (not (< (+ q1_front 2) q1_back))) (or (< (+ q1_front 3) q1_back) (<= (+ q2_front 1) q2_back) (not (< (+ q1_front 2) q1_back))) (or (< (+ q1_front 3) q1_back) (not (< (+ q1_front 2) q1_back)) (<= q2_back (+ q2_front 1))) (or (< (+ q1_front 3) q1_back) (<= (* 3 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< (+ q1_front 2) q1_back)))), 3661967#(and (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (<= q2_back (+ q2_front 1)) (not (= C (select q1 (+ q1_back 1))))) (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))) (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 (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (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))))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))))), 3661960#(and (or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= (* 3 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< (+ q1_front 1) q1_back))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))) (* 3 C)) (not (< (+ q1_front 1) q1_back))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (not (< (+ q1_front 1) q1_back))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= q2_back (+ q2_front 1)) (not (< (+ q1_front 1) q1_back))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 2) q1_back) (<= (+ q2_front 1) q2_back) (<= q1_back (+ q1_front 1)))), 3661963#(and (or (not (= (select q1 q1_back) C)) (<= (* 3 C) (+ (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))) (or (not (= (select q1 q1_back) C)) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))) (* 3 C)) (< (+ q1_front 1) q1_back) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front q1_back))) (or (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (<= q1_back q1_front) (not (= C (select q1 (+ q1_back 1))))) (or (= (+ (select q2 q2_front) C) 0) (not (= (select q1 q1_back) C)) (< (+ q1_front 1) q1_back) (not (= C (select q1 (+ q1_back 1)))) (not (< q1_front q1_back)))), 3661946#(and (or (< q1_front q1_back) (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0)) (or (< q1_front q1_back) (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1)))), 3661977#(and (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 (= C (select q1 q1_front)) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))) (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))) (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 (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))))), 3661959#(and (or (< (+ q1_front 3) q1_back) (<= q2_back q2_front) (not (< (+ q1_front 2) q1_back)) (not (= (- C) (select q2 q2_back)))) (or (< (+ q1_front 3) q1_back) (<= (* 3 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (not (< (+ q1_front 2) q1_back)) (not (= (- C) (select q2 q2_back)))) (or (< (+ q1_front 3) q1_back) (not (< (+ q1_front 2) q1_back)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (< (+ q1_front 3) q1_back) (not (= (+ C (select q2 q2_back)) 0)) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))) (* 3 C)) (not (< (+ q1_front 2) q1_back)))), 3661972#(and (or (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (= C (select q1 (+ q1_front 2))) (not (= (- C) (select q2 q2_back))))), 3661956#(and (or (not (= (+ C (select q2 q2_back)) 0)) (< q1_front q1_back) (<= total (* 3 C))) (or (<= (* 3 C) total) (< q1_front q1_back) (not (= (- C) (select q2 q2_back)))) (or (< q1_front q1_back) (<= q2_back q2_front) (not (= (- C) (select q2 q2_back)))) (or (< q1_front q1_back) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))))), 3661965#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (= C (select q1 (+ q1_front 2))) (not (= C (select q1 (+ q1_back 1))))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= q2_back (+ q2_front 1)) (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)))) (= (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)))))), 3661949#(and (or (< q1_front q1_back) (<= (* 2 C) total)) (or (< q1_front q1_back) (<= q2_back (+ q2_front 1))) (or (= (+ (select q2 q2_front) C) 0) (< q1_front q1_back)) (or (< q1_front q1_back) (<= total (* 2 C)))), 3661957#(and (or (<= q2_back q2_front) (< (+ q1_front 1) q1_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back))) (or (not (= (+ C (select q2 q2_back)) 0)) (<= (+ total (select q1 q1_front)) (* 3 C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back)) (<= (* 3 C) (+ total (select q1 q1_front)))) (or (< (+ q1_front 1) q1_back) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))) (not (< q1_front q1_back)))), 3661951#(and (or (<= (* 3 C) total) (< q1_front q1_back)) (or (< q1_front q1_back) (<= total (* 3 C))) (or (< q1_front q1_back) (<= q2_back (+ q2_front 1))) (or (= (+ (select q2 q2_front) C) 0) (< q1_front q1_back)) (or (< q1_front q1_back) (<= (+ q2_front 1) q2_back))), 3661975#(and (or (= C (select q1 q1_front)) (not (= (select q1 q1_back) C))) (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 (<= total 0) (not (= (select q1 q1_back) C))) (or (<= 0 total) (not (= (select q1 q1_back) C)))), 3661973#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 1)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (= C (select q1 (+ q1_front 2))) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))))), 3661945#(and (or (<= q2_back q2_front) (< 0 (+ (select q2 q2_front) total 1))) (or (<= q2_back q2_front) (<= (+ (select q2 q2_front) total) 0))), 3661947#(and (or (< q1_front q1_back) (<= 0 (+ (select q2 q2_front) total))) (or (< q1_front q1_back) (<= (+ (select q2 q2_front) total) 0))), 3661962#(and (or (<= (* 2 C) total) (not (= (- C) (select q2 q2_back)))) (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= total (* 2 C)) (not (= (- C) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))))), 3661974#(and (or (<= 0 total) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back)))) (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)))) (not (= (- C) (select q2 q2_back)))) (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)))) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (not (= (select q1 q1_back) C)) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C))), 3661953#(and (or (< (+ q1_front 2) q1_back) (<= q2_back (+ q2_front 1)) (not (< (+ q1_front 1) q1_back))) (or (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front)) (* 3 C)) (< (+ q1_front 2) q1_back) (not (< (+ q1_front 1) q1_back))) (or (= (+ (select q2 q2_front) C) 0) (< (+ q1_front 2) q1_back) (not (< (+ q1_front 1) q1_back))) (or (< (+ q1_front 2) q1_back) (<= (+ q2_front 1) q2_back) (not (< (+ q1_front 1) q1_back))) (or (<= (* 3 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front))) (< (+ q1_front 2) q1_back) (not (< (+ q1_front 1) q1_back)))), 3661950#(and (or (= (select q2 q2_front) (* (- 1) C)) (< q1_front q1_back) (= q2_back q2_front)) (or (< q1_front q1_back) (not (= (select q2 q2_front) (* (- 1) C))) (<= (* 2 C) total)) (or (< q1_front q1_back) (<= total (* 2 C)) (not (= (select q2 q2_front) (* (- 1) C)))) (or (< q1_front q1_back) (<= q2_back q2_front))), 3661948#(and (or (= (+ (select q2 q2_front) C) 0) (< q1_front q1_back) (= q2_back q2_front)) (or (not (= (+ (select q2 q2_front) C) 0)) (< q1_front q1_back) (<= C total)) (or (not (= (+ (select q2 q2_front) C) 0)) (<= total C) (< q1_front q1_back))), 3661952#(and (or (< (+ q1_front 1) q1_back) (<= q2_back (+ q2_front 1)) (not (< q1_front q1_back))) (or (<= (+ total (select q1 q1_front)) (* 3 C)) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back))) (or (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)) (<= (* 3 C) (+ total (select q1 q1_front)))) (or (< (+ q1_front 1) q1_back) (<= (+ q2_front 1) q2_back) (not (< q1_front q1_back))) (or (= (+ (select q2 q2_front) C) 0) (< (+ q1_front 1) q1_back) (not (< q1_front q1_back)))), 3661970#(and (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= C total) (not (= (- C) (select q2 q2_back)))) (or (<= total C) (not (= (- C) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))))), 3661955#(and (or (not (= (+ C (select q2 q2_back)) 0)) (<= q2_back q2_front)) (or (<= total (* 3 C)) (not (= (- C) (select q2 q2_back)))) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (<= (* 3 C) total) (not (= (- C) (select q2 q2_back))))), 3661971#(and (or (= (+ (* (- 1) (select q1 q1_front)) C) 0) (not (= (- C) (select q2 q2_back)))) (or (not (= (- C) (select q2 q2_back))) (= (select q1 (+ q1_front 1)) C)) (or (<= q2_front q2_back) (not (= (- C) (select q2 q2_back)))) (or (= C (select q1 (+ q1_front 2))) (not (= (- C) (select q2 q2_back)))) (or (<= 0 total) (not (= (- C) (select q2 q2_back)))) (or (<= total 0) (not (= (- C) (select q2 q2_back)))) (or (<= q2_back q2_front) (not (= (- C) (select q2 q2_back))))), 3661969#(and (or (not (= (+ C (select q2 q2_back)) 0)) (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2))) (* 3 C)) (<= (+ q1_back 1) q1_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1))))) (or (not (= (select q1 q1_back) C)) (<= (* 3 C) (+ (select q1 (+ q1_front 1)) total (select q1 q1_front) (select q1 (+ q1_front 2)))) (< q1_front q1_back) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) C)) (< q1_front q1_back) (<= q2_back q2_front) (not (= C (select q1 (+ q1_back 2)))) (not (= C (select q1 (+ q1_back 1)))) (not (= (- C) (select q2 q2_back))) (not (< q1_front (+ q1_back 1)))) (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)))) (<= q2_front q2_back) (not (= (- C) (select q2 q2_back))))), 3661964#(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 1))) (or (not (= (select q1 q1_back) C)) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) C)) (= (select q1 (+ q1_front 1)) C)) (or (<= total 0) (not (= (select q1 q1_back) 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 (<= 0 total) (not (= (select q1 q1_back) C))))] [2022-03-15 22:04:31,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-03-15 22:04:31,942 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:31,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-03-15 22:04:31,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=3804, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 22:04:31,944 INFO L87 Difference]: Start difference. First operand 55086 states and 238832 transitions. Second operand has 49 states, 48 states have (on average 4.458333333333333) internal successors, (214), 48 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 22:07:20,637 WARN L244 SmtUtils]: Removed 6 from assertion stack [2022-03-15 22:07:20,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 689 states. [2022-03-15 22:07:20,645 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:07:20,645 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:07:20,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 214 SyntacticMatches, 32 SemanticMatches, 719 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239852 ImplicationChecksByTransitivity, 157.7s TimeCoverageRelationStatistics Valid=45235, Invalid=473885, Unknown=0, NotChecked=0, Total=519120 [2022-03-15 22:07:20,657 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 3519 mSDsluCounter, 9736 mSDsCounter, 0 mSdLazyCounter, 18182 mSolverCounterSat, 1467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3519 SdHoareTripleChecker+Valid, 4113 SdHoareTripleChecker+Invalid, 19649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1467 IncrementalHoareTripleChecker+Valid, 18182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:07:20,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3519 Valid, 4113 Invalid, 19649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1467 Valid, 18182 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2022-03-15 22:07:20,658 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (4 of 5 remaining) [2022-03-15 22:07:20,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-03-15 22:07:20,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:07:20,861 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (55086states) and FLOYD_HOARE automaton (currently 689 states, 49 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 75 for 73ms.. [2022-03-15 22:07:20,862 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 5 remaining) [2022-03-15 22:07:20,862 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 5 remaining) [2022-03-15 22:07:20,862 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 5 remaining) [2022-03-15 22:07:20,862 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATION (0 of 5 remaining) [2022-03-15 22:07:20,863 INFO L732 BasicCegarLoop]: Path program histogram: [44, 2, 1, 1, 1, 1, 1, 1] [2022-03-15 22:07:20,865 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:07:20,865 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:07:20,866 INFO L202 PluginConnector]: Adding new model buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:07:20 BasicIcfg [2022-03-15 22:07:20,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:07:20,866 INFO L158 Benchmark]: Toolchain (without parser) took 830287.07ms. Allocated memory was 192.9MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 150.5MB in the beginning and 3.4GB in the end (delta: -3.2GB). Peak memory consumption was 3.8GB. Max. memory is 8.0GB. [2022-03-15 22:07:20,866 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 192.9MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:07:20,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.98ms. Allocated memory is still 192.9MB. Free memory was 150.4MB in the beginning and 148.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:07:20,866 INFO L158 Benchmark]: Boogie Preprocessor took 22.61ms. Allocated memory is still 192.9MB. Free memory was 148.9MB in the beginning and 147.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:07:20,866 INFO L158 Benchmark]: RCFGBuilder took 210.35ms. Allocated memory is still 192.9MB. Free memory was 147.8MB in the beginning and 137.8MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 22:07:20,867 INFO L158 Benchmark]: TraceAbstraction took 830015.39ms. Allocated memory was 192.9MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 137.3MB in the beginning and 3.4GB in the end (delta: -3.2GB). Peak memory consumption was 3.8GB. Max. memory is 8.0GB. [2022-03-15 22:07:20,867 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.11ms. Allocated memory is still 192.9MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.98ms. Allocated memory is still 192.9MB. Free memory was 150.4MB in the beginning and 148.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.61ms. Allocated memory is still 192.9MB. Free memory was 148.9MB in the beginning and 147.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 210.35ms. Allocated memory is still 192.9MB. Free memory was 147.8MB in the beginning and 137.8MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 830015.39ms. Allocated memory was 192.9MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 137.3MB in the beginning and 3.4GB in the end (delta: -3.2GB). Peak memory consumption was 3.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 36 PlacesAfterwards, 35 TransitionsBefore, 27 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 559 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 347, positive: 319, positive conditional: 0, positive unconditional: 319, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 159, positive: 148, positive conditional: 0, positive unconditional: 148, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 347, positive: 171, positive conditional: 0, positive unconditional: 171, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 159, unknown conditional: 0, unknown unconditional: 159] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (55086states) and FLOYD_HOARE automaton (currently 689 states, 49 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 75 for 73ms.. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (55086states) and FLOYD_HOARE automaton (currently 689 states, 49 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 75 for 73ms.. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (55086states) and FLOYD_HOARE automaton (currently 689 states, 49 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 75 for 73ms.. - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (55086states) and FLOYD_HOARE automaton (currently 689 states, 49 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 75 for 73ms.. - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (55086states) and FLOYD_HOARE automaton (currently 689 states, 49 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 75 for 73ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 54 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 829.9s, OverallIterations: 52, TraceHistogramMax: 3, PathProgramHistogramMax: 44, EmptinessCheckTime: 2.4s, AutomataDifference: 442.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36512 SdHoareTripleChecker+Valid, 67.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36512 mSDsluCounter, 19893 SdHoareTripleChecker+Invalid, 58.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76568 mSDsCounter, 10388 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 132256 IncrementalHoareTripleChecker+Invalid, 142644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10388 mSolverCounterUnsat, 1152 mSDtfsCounter, 132256 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13957 GetRequests, 8648 SyntacticMatches, 810 SemanticMatches, 4498 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 437310 ImplicationChecksByTransitivity, 376.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55086occurred in iteration=51, InterpolantAutomatonStates: 3035, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 36.2s AutomataMinimizationTime, 51 MinimizatonAttempts, 1326165 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 37.0s InterpolantComputationTime, 2800 NumberOfCodeBlocks, 2800 NumberOfCodeBlocksAsserted, 169 NumberOfCheckSat, 3937 ConstructedInterpolants, 222 QuantifiedInterpolants, 69378 SizeOfPredicates, 273 NumberOfNonLiveVariables, 5043 ConjunctsInSsa, 1018 ConjunctsInUnsatCore, 141 InterpolantComputations, 9 PerfectInterpolantSequences, 735/2208 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown