/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/queue-add-3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:35:33,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:35:33,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:35:33,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:35:33,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:35:33,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:35:33,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:35:33,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:35:33,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:35:33,945 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:35:33,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:35:33,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:35:33,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:35:33,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:35:33,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:35:33,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:35:33,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:35:33,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:35:33,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:35:33,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:35:33,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:35:33,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:35:33,963 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:35:33,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:35:33,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:35:33,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:35:33,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:35:33,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:35:33,971 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:35:33,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:35:33,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:35:33,973 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:35:33,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:35:33,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:35:33,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:35:33,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:35:33,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:35:33,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:35:33,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:35:33,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:35:33,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:35:33,978 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:35:34,013 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:35:34,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:35:34,014 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:35:34,014 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:35:34,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:35:34,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:35:34,015 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:35:34,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:35:34,015 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:35:34,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:35:34,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:35:34,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:35:34,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:35:34,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:35:34,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:35:34,016 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:35:34,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:35:34,017 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:35:34,017 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:35:34,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:35:34,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:35:34,017 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:35:34,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:35:34,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:35:34,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:35:34,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:35:34,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:35:34,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:35:34,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:35:34,018 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:35:34,020 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:35:34,020 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:35:34,020 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:35:34,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:35:34,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:35:34,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:35:34,249 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:35:34,251 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:35:34,252 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-3.wvr.bpl [2022-03-15 21:35:34,252 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-3.wvr.bpl' [2022-03-15 21:35:34,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:35:34,275 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:35:34,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:35:34,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:35:34,277 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:35:34,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:35:34" (1/1) ... [2022-03-15 21:35:34,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:35:34" (1/1) ... [2022-03-15 21:35:34,307 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:35:34,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:35:34,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:35:34,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:35:34,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:35:34,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:35:34" (1/1) ... [2022-03-15 21:35:34,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:35:34" (1/1) ... [2022-03-15 21:35:34,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:35:34" (1/1) ... [2022-03-15 21:35:34,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:35:34" (1/1) ... [2022-03-15 21:35:34,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:35:34" (1/1) ... [2022-03-15 21:35:34,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:35:34" (1/1) ... [2022-03-15 21:35:34,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:35:34" (1/1) ... [2022-03-15 21:35:34,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:35:34,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:35:34,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:35:34,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:35:34,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:35:34" (1/1) ... [2022-03-15 21:35:34,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:35:34,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:34,356 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:35:34,371 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:35:34,388 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:35:34,388 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:35:34,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:35:34,388 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:35:34,388 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:35:34,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:35:34,389 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:35:34,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:35:34,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:35:34,389 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 21:35:34,389 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 21:35:34,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 21:35:34,390 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:35:34,432 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:35:34,434 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:35:34,516 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:35:34,534 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:35:34,534 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 21:35:34,536 INFO L202 PluginConnector]: Adding new model queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:35:34 BoogieIcfgContainer [2022-03-15 21:35:34,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:35:34,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:35:34,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:35:34,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:35:34,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:35:34" (1/2) ... [2022-03-15 21:35:34,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b13a417 and model type queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:35:34, skipping insertion in model container [2022-03-15 21:35:34,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:35:34" (2/2) ... [2022-03-15 21:35:34,542 INFO L111 eAbstractionObserver]: Analyzing ICFG queue-add-3.wvr.bpl [2022-03-15 21:35:34,546 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:35:34,546 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:35:34,547 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:35:34,547 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:35:34,603 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 21:35:34,636 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:35:34,654 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:35:34,654 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 21:35:34,666 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:35:34,689 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 100 flow [2022-03-15 21:35:34,692 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 100 flow [2022-03-15 21:35:34,693 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 100 flow [2022-03-15 21:35:34,720 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2022-03-15 21:35:34,721 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 21:35:34,724 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 3/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2022-03-15 21:35:34,726 INFO L116 LiptonReduction]: Number of co-enabled transitions 478 [2022-03-15 21:35:35,203 INFO L131 LiptonReduction]: Checked pairs total: 390 [2022-03-15 21:35:35,203 INFO L133 LiptonReduction]: Total number of compositions: 17 [2022-03-15 21:35:35,210 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 22 transitions, 68 flow [2022-03-15 21:35:35,231 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 70 states, 69 states have (on average 2.8405797101449277) internal successors, (196), 69 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:35,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 69 states have (on average 2.8405797101449277) internal successors, (196), 69 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:35,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:35:35,239 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:35,241 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:35,242 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:35:35,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:35,247 INFO L85 PathProgramCache]: Analyzing trace with hash 357412214, now seen corresponding path program 1 times [2022-03-15 21:35:35,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:35,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180158589] [2022-03-15 21:35:35,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:35,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:35,379 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:35:35,380 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:35,380 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180158589] [2022-03-15 21:35:35,381 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180158589] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:35:35,381 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:35:35,381 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:35:35,383 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [579899272] [2022-03-15 21:35:35,383 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:35,389 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:35,417 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 110 transitions. [2022-03-15 21:35:35,417 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:35,677 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:35:35,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:35:35,679 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:35,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:35:35,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:35:35,700 INFO L87 Difference]: Start difference. First operand has 70 states, 69 states have (on average 2.8405797101449277) internal successors, (196), 69 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:35,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:35,745 INFO L93 Difference]: Finished difference Result 87 states and 246 transitions. [2022-03-15 21:35:35,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:35:35,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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:35:35,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:35,755 INFO L225 Difference]: With dead ends: 87 [2022-03-15 21:35:35,755 INFO L226 Difference]: Without dead ends: 87 [2022-03-15 21:35:35,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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:35:35,759 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:35,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 5 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:35:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-03-15 21:35:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-03-15 21:35:35,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 2.86046511627907) internal successors, (246), 86 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:35,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 246 transitions. [2022-03-15 21:35:35,793 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 246 transitions. Word has length 14 [2022-03-15 21:35:35,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:35,794 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 246 transitions. [2022-03-15 21:35:35,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:35,794 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 246 transitions. [2022-03-15 21:35:35,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:35:35,795 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:35,795 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:35,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:35:35,796 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:35:35,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:35,797 INFO L85 PathProgramCache]: Analyzing trace with hash 198832972, now seen corresponding path program 1 times [2022-03-15 21:35:35,797 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:35,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597217694] [2022-03-15 21:35:35,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:35,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:35,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:35:35,821 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:35,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597217694] [2022-03-15 21:35:35,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597217694] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:35:35,822 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:35:35,822 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:35:35,822 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [379381436] [2022-03-15 21:35:35,822 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:35,823 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:35,829 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 141 transitions. [2022-03-15 21:35:35,830 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:36,120 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:35:36,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:35:36,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:36,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:35:36,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:35:36,123 INFO L87 Difference]: Start difference. First operand 87 states and 246 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:36,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:36,155 INFO L93 Difference]: Finished difference Result 106 states and 303 transitions. [2022-03-15 21:35:36,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:35:36,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:35:36,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:36,158 INFO L225 Difference]: With dead ends: 106 [2022-03-15 21:35:36,158 INFO L226 Difference]: Without dead ends: 106 [2022-03-15 21:35:36,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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:35:36,159 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:36,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 5 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:35:36,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-03-15 21:35:36,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-03-15 21:35:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 2.8857142857142857) internal successors, (303), 105 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 303 transitions. [2022-03-15 21:35:36,171 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 303 transitions. Word has length 15 [2022-03-15 21:35:36,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:36,172 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 303 transitions. [2022-03-15 21:35:36,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 303 transitions. [2022-03-15 21:35:36,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:35:36,173 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:36,173 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:36,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 21:35:36,174 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:35:36,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:36,174 INFO L85 PathProgramCache]: Analyzing trace with hash 307419222, now seen corresponding path program 1 times [2022-03-15 21:35:36,175 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:36,175 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355949979] [2022-03-15 21:35:36,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:36,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:36,212 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:36,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355949979] [2022-03-15 21:35:36,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355949979] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:35:36,213 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:35:36,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 21:35:36,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1493263792] [2022-03-15 21:35:36,213 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:36,215 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:36,222 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 125 transitions. [2022-03-15 21:35:36,222 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:36,539 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [776#(<= q2_back q2_front)] [2022-03-15 21:35:36,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:35:36,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:36,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:35:36,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:35:36,540 INFO L87 Difference]: Start difference. First operand 106 states and 303 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:36,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:36,576 INFO L93 Difference]: Finished difference Result 101 states and 276 transitions. [2022-03-15 21:35:36,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:35:36,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:35:36,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:36,578 INFO L225 Difference]: With dead ends: 101 [2022-03-15 21:35:36,578 INFO L226 Difference]: Without dead ends: 101 [2022-03-15 21:35:36,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 16 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:35:36,579 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:36,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 4 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:35:36,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-03-15 21:35:36,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-03-15 21:35:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 2.76) internal successors, (276), 100 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:36,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 276 transitions. [2022-03-15 21:35:36,595 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 276 transitions. Word has length 17 [2022-03-15 21:35:36,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:36,596 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 276 transitions. [2022-03-15 21:35:36,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:36,596 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 276 transitions. [2022-03-15 21:35:36,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:35:36,597 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:36,597 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:36,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 21:35:36,598 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:35:36,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:36,598 INFO L85 PathProgramCache]: Analyzing trace with hash 480387532, now seen corresponding path program 2 times [2022-03-15 21:35:36,599 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:36,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31372846] [2022-03-15 21:35:36,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:36,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:36,691 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:35:36,691 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:36,691 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31372846] [2022-03-15 21:35:36,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31372846] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:35:36,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479552503] [2022-03-15 21:35:36,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:35:36,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:36,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:36,694 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:35:36,730 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:35:36,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:35:36,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:35:36,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:35:36,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:35:36,934 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:35:36,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:35:37,017 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:35:37,018 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479552503] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:35:37,018 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:35:37,018 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-03-15 21:35:37,018 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1069967679] [2022-03-15 21:35:37,018 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:37,020 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:37,025 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 103 transitions. [2022-03-15 21:35:37,025 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:37,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-03-15 21:35:37,103 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-03-15 21:35:37,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-03-15 21:35:37,329 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-03-15 21:35:37,454 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-03-15 21:35:37,462 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-03-15 21:35:37,728 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [1188#(and (<= 0 N) (or (< 0 N) (= t 0))), 1186#(and (or (< t (+ N 1)) (not g)) (or (<= N t) (not g))), 1179#(or (and (<= 0 N) (<= N 0)) (< i N)), 1187#(and (or (<= N 0) (< i N)) (or (< i N) (= t 0)) (or (<= 0 N) (< i N)))] [2022-03-15 21:35:37,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 21:35:37,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:37,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 21:35:37,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-03-15 21:35:37,730 INFO L87 Difference]: Start difference. First operand 101 states and 276 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:38,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:38,083 INFO L93 Difference]: Finished difference Result 190 states and 514 transitions. [2022-03-15 21:35:38,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 21:35:38,084 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:35:38,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:38,086 INFO L225 Difference]: With dead ends: 190 [2022-03-15 21:35:38,086 INFO L226 Difference]: Without dead ends: 182 [2022-03-15 21:35:38,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 54 SyntacticMatches, 11 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2022-03-15 21:35:38,087 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 82 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:38,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 15 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:35:38,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-03-15 21:35:38,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 153. [2022-03-15 21:35:38,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.7565789473684212) internal successors, (419), 152 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 419 transitions. [2022-03-15 21:35:38,097 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 419 transitions. Word has length 17 [2022-03-15 21:35:38,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:38,097 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 419 transitions. [2022-03-15 21:35:38,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 419 transitions. [2022-03-15 21:35:38,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:35:38,099 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:38,099 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:38,124 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:35:38,317 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:35:38,317 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:35:38,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:38,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1244856226, now seen corresponding path program 3 times [2022-03-15 21:35:38,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:38,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344207113] [2022-03-15 21:35:38,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:38,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:38,363 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:35:38,364 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:38,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344207113] [2022-03-15 21:35:38,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344207113] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:35:38,364 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:35:38,364 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 21:35:38,364 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1856166890] [2022-03-15 21:35:38,364 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:38,366 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:38,372 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 21:35:38,372 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:38,511 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 6 treesize of output 4 [2022-03-15 21:35:38,647 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:35:38,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:35:38,647 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:38,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:35:38,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:35:38,648 INFO L87 Difference]: Start difference. First operand 153 states and 419 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:38,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:38,669 INFO L93 Difference]: Finished difference Result 123 states and 313 transitions. [2022-03-15 21:35:38,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:35:38,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:35:38,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:38,670 INFO L225 Difference]: With dead ends: 123 [2022-03-15 21:35:38,670 INFO L226 Difference]: Without dead ends: 123 [2022-03-15 21:35:38,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 8 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:35:38,671 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 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:35:38,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:35:38,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-03-15 21:35:38,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-03-15 21:35:38,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 2.5655737704918034) internal successors, (313), 122 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:38,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 313 transitions. [2022-03-15 21:35:38,678 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 313 transitions. Word has length 17 [2022-03-15 21:35:38,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:38,679 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 313 transitions. [2022-03-15 21:35:38,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:38,679 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 313 transitions. [2022-03-15 21:35:38,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:35:38,680 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:38,680 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:38,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 21:35:38,680 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:35:38,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:38,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2017388366, now seen corresponding path program 4 times [2022-03-15 21:35:38,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:38,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649144624] [2022-03-15 21:35:38,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:38,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:38,729 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:38,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649144624] [2022-03-15 21:35:38,729 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649144624] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:35:38,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572360923] [2022-03-15 21:35:38,729 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:35:38,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:38,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:38,732 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:35:38,755 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:35:38,772 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:35:38,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:35:38,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 21:35:38,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:35:38,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:38,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:35:38,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:38,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572360923] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:35:38,850 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:35:38,850 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 7 [2022-03-15 21:35:38,850 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1330588382] [2022-03-15 21:35:38,850 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:38,852 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:38,859 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 113 transitions. [2022-03-15 21:35:38,859 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:39,223 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [2187#f, 2185#(or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))), 2188#(or (not g) f), 2184#(or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))), 2186#(or (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1))), 2189#(or (not f) (= q2_back q2_front)), 2183#g] [2022-03-15 21:35:39,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 21:35:39,224 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:39,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 21:35:39,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-03-15 21:35:39,224 INFO L87 Difference]: Start difference. First operand 123 states and 313 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:39,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:39,645 INFO L93 Difference]: Finished difference Result 209 states and 551 transitions. [2022-03-15 21:35:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 21:35:39,646 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 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:35:39,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:39,647 INFO L225 Difference]: With dead ends: 209 [2022-03-15 21:35:39,647 INFO L226 Difference]: Without dead ends: 199 [2022-03-15 21:35:39,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2022-03-15 21:35:39,648 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 114 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:39,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 23 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:35:39,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-03-15 21:35:39,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 182. [2022-03-15 21:35:39,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 2.679558011049724) internal successors, (485), 181 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 485 transitions. [2022-03-15 21:35:39,656 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 485 transitions. Word has length 18 [2022-03-15 21:35:39,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:39,656 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 485 transitions. [2022-03-15 21:35:39,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:39,657 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 485 transitions. [2022-03-15 21:35:39,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:35:39,657 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:39,657 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:35:39,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 21:35:39,875 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:35:39,876 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:35:39,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:39,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1556472275, now seen corresponding path program 1 times [2022-03-15 21:35:39,878 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:39,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288098205] [2022-03-15 21:35:39,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:39,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:35:39,917 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:39,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288098205] [2022-03-15 21:35:39,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288098205] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:35:39,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053355985] [2022-03-15 21:35:39,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:39,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:39,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:39,919 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:35:39,929 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:35:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:39,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:35:39,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:35:39,983 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 21:35:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:35:39,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:35:40,028 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:35:40,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-03-15 21:35:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:35:40,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053355985] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:35:40,040 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:35:40,041 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-03-15 21:35:40,041 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1425877324] [2022-03-15 21:35:40,041 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:40,043 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:40,049 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 118 transitions. [2022-03-15 21:35:40,049 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:40,284 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2903#(or (= (select q1 q1_front) 1) (not f) (<= q1_back q1_front)), 2904#(or (= (select q1 q1_front) 1) (<= q1_back q1_front))] [2022-03-15 21:35:40,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:35:40,285 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:40,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:35:40,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-03-15 21:35:40,286 INFO L87 Difference]: Start difference. First operand 182 states and 485 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:40,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:40,413 INFO L93 Difference]: Finished difference Result 192 states and 490 transitions. [2022-03-15 21:35:40,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 21:35:40,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:35:40,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:40,415 INFO L225 Difference]: With dead ends: 192 [2022-03-15 21:35:40,415 INFO L226 Difference]: Without dead ends: 192 [2022-03-15 21:35:40,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-03-15 21:35:40,416 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 37 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:40,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 10 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:35:40,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-03-15 21:35:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 168. [2022-03-15 21:35:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 2.6706586826347305) internal successors, (446), 167 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:40,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 446 transitions. [2022-03-15 21:35:40,425 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 446 transitions. Word has length 18 [2022-03-15 21:35:40,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:40,425 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 446 transitions. [2022-03-15 21:35:40,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:40,426 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 446 transitions. [2022-03-15 21:35:40,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:35:40,426 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:40,426 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:40,451 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:35:40,627 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:35:40,627 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:35:40,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:40,628 INFO L85 PathProgramCache]: Analyzing trace with hash 859841624, now seen corresponding path program 5 times [2022-03-15 21:35:40,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:40,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851657571] [2022-03-15 21:35:40,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:40,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:35:40,662 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:40,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851657571] [2022-03-15 21:35:40,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851657571] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:35:40,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146348540] [2022-03-15 21:35:40,662 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:35:40,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:40,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:40,664 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:35:40,665 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:35:40,712 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:35:40,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:35:40,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 21:35:40,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:35:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:35:40,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 21:35:40,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146348540] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:35:40,761 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 21:35:40,761 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-03-15 21:35:40,761 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [451308247] [2022-03-15 21:35:40,762 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:40,764 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:40,772 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 115 transitions. [2022-03-15 21:35:40,772 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:40,825 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 6 treesize of output 4 [2022-03-15 21:35:40,997 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:35:40,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:35:40,998 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:40,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:35:40,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:35:40,998 INFO L87 Difference]: Start difference. First operand 168 states and 446 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:41,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:41,041 INFO L93 Difference]: Finished difference Result 313 states and 863 transitions. [2022-03-15 21:35:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 21:35:41,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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:35:41,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:41,043 INFO L225 Difference]: With dead ends: 313 [2022-03-15 21:35:41,043 INFO L226 Difference]: Without dead ends: 284 [2022-03-15 21:35:41,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:35:41,044 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 16 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:41,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 2 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:35:41,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-03-15 21:35:41,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 244. [2022-03-15 21:35:41,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 3.0041152263374484) internal successors, (730), 243 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 730 transitions. [2022-03-15 21:35:41,055 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 730 transitions. Word has length 20 [2022-03-15 21:35:41,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:41,055 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 730 transitions. [2022-03-15 21:35:41,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:41,055 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 730 transitions. [2022-03-15 21:35:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:35:41,056 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:41,056 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:35:41,081 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:35:41,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:41,271 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:35:41,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:41,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1415971077, now seen corresponding path program 2 times [2022-03-15 21:35:41,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:41,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073098091] [2022-03-15 21:35:41,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:41,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:35:41,325 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:41,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073098091] [2022-03-15 21:35:41,325 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073098091] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:35:41,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585308027] [2022-03-15 21:35:41,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:35:41,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:41,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:41,327 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:35:41,327 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:35:41,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:35:41,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:35:41,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 21:35:41,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:35:41,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-03-15 21:35:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:41,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:35:41,459 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:35:41,459 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-03-15 21:35:41,510 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:35:41,510 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-03-15 21:35:41,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:41,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585308027] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:35:41,541 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:35:41,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-03-15 21:35:41,542 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1897606544] [2022-03-15 21:35:41,542 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:41,544 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:41,551 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 130 transitions. [2022-03-15 21:35:41,551 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:41,870 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [4432#(or g (not f)), 4433#(or (not f) (= q2_back q2_front)), 4431#(not f)] [2022-03-15 21:35:41,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 21:35:41,870 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:41,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 21:35:41,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-03-15 21:35:41,871 INFO L87 Difference]: Start difference. First operand 244 states and 730 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:42,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:42,030 INFO L93 Difference]: Finished difference Result 295 states and 865 transitions. [2022-03-15 21:35:42,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 21:35:42,030 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 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:35:42,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:42,032 INFO L225 Difference]: With dead ends: 295 [2022-03-15 21:35:42,032 INFO L226 Difference]: Without dead ends: 288 [2022-03-15 21:35:42,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2022-03-15 21:35:42,033 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 63 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:42,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 11 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:35:42,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-03-15 21:35:42,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2022-03-15 21:35:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 2.950943396226415) internal successors, (782), 265 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 782 transitions. [2022-03-15 21:35:42,041 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 782 transitions. Word has length 20 [2022-03-15 21:35:42,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:42,042 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 782 transitions. [2022-03-15 21:35:42,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 782 transitions. [2022-03-15 21:35:42,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:35:42,043 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:42,043 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:42,069 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:35:42,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:42,270 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:35:42,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:42,270 INFO L85 PathProgramCache]: Analyzing trace with hash 864522993, now seen corresponding path program 3 times [2022-03-15 21:35:42,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:42,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265509739] [2022-03-15 21:35:42,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:42,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:42,493 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:42,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265509739] [2022-03-15 21:35:42,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265509739] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:35:42,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267774987] [2022-03-15 21:35:42,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:35:42,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:42,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:42,496 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:35:42,498 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:35:42,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:35:42,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:35:42,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 21:35:42,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:35:42,668 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 21:35:42,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 21:35:42,833 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:42,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:35:42,940 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:35:42,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 21:35:43,081 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:35:43,082 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 34 treesize of output 34 [2022-03-15 21:35:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:43,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267774987] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:35:43,173 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:35:43,173 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 25 [2022-03-15 21:35:43,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1851619605] [2022-03-15 21:35:43,174 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:43,178 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:43,187 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 130 transitions. [2022-03-15 21:35:43,187 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:44,702 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [5422#(and (or (<= N (select q2 q2_front)) (not (= j 0))) (or (<= (select q2 q2_front) N) (not (= j 0)))), 5423#(and (<= N (select q2 q2_front)) (<= (select q2 q2_front) N)), 5429#(and (or (<= q1_back q1_front) (<= 1 N)) (or (= (+ (- 1) (select q1 q1_front)) 0) (<= q1_back q1_front)) (or (<= q1_back q1_front) (<= N 1)) (or (<= q1_back q1_front) (= q2_back q2_front))), 5428#(and (or (= (+ (- 1) (select q1 q1_front)) 0) (<= q1_back q1_front)) (or (<= N (+ t 1)) (<= q1_back q1_front)) (or (<= q1_back q1_front) (<= (+ t 1) N)) (or (<= q1_back q1_front) (= q2_back q2_front))), 5430#(and (= (select q1 q1_front) 1) (<= i 1) (<= 1 N) (= q2_back q2_front)), 5420#(and (or f g (<= t N)) (or (<= N t) f g)), 5425#(and (or (<= N (+ t 1)) (not f) (<= q1_back q1_front)) (or (not f) (<= q1_back q1_front) (= q2_back q2_front)) (or (not f) (<= q1_back q1_front) (<= (+ t 1) N)) (or (= (+ (- 1) (select q1 q1_front)) 0) (not f) (<= q1_back q1_front))), 5424#(and (<= N 1) (<= 1 N) (= j 1) (= q2_back q2_front)), 5421#(and (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= t N)) (or (<= N t) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 5431#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 5432#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 5427#(and (= (select q1 q1_front) 1) (<= N 1) (<= 1 N) (= q2_back q2_front)), 5426#(and (or (not f) (<= q1_back q1_front) (<= 1 N)) (or (not f) (<= q1_back q1_front) (= q2_back q2_front)) (or (not f) (<= q1_back q1_front) (<= N 1)) (or (= (+ (- 1) (select q1 q1_front)) 0) (not f) (<= q1_back q1_front)))] [2022-03-15 21:35:44,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:35:44,703 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:44,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:35:44,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1352, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 21:35:44,704 INFO L87 Difference]: Start difference. First operand 266 states and 782 transitions. Second operand has 27 states, 26 states have (on average 3.0) internal successors, (78), 26 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:47,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:47,007 INFO L93 Difference]: Finished difference Result 645 states and 1772 transitions. [2022-03-15 21:35:47,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-15 21:35:47,008 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.0) internal successors, (78), 26 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:35:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:47,011 INFO L225 Difference]: With dead ends: 645 [2022-03-15 21:35:47,011 INFO L226 Difference]: Without dead ends: 637 [2022-03-15 21:35:47,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 52 SyntacticMatches, 11 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2491 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=932, Invalid=6378, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 21:35:47,014 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 212 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:47,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 31 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:35:47,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-03-15 21:35:47,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 306. [2022-03-15 21:35:47,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 2.8524590163934427) internal successors, (870), 305 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 870 transitions. [2022-03-15 21:35:47,026 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 870 transitions. Word has length 21 [2022-03-15 21:35:47,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:47,027 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 870 transitions. [2022-03-15 21:35:47,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.0) internal successors, (78), 26 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:47,027 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 870 transitions. [2022-03-15 21:35:47,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:35:47,028 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:47,028 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:47,051 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:35:47,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:47,229 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:35:47,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:47,229 INFO L85 PathProgramCache]: Analyzing trace with hash 371927231, now seen corresponding path program 4 times [2022-03-15 21:35:47,230 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:47,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686411156] [2022-03-15 21:35:47,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:47,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:47,453 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:47,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686411156] [2022-03-15 21:35:47,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686411156] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:35:47,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511544110] [2022-03-15 21:35:47,453 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:35:47,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:47,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:47,454 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:35:47,455 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:35:47,484 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:35:47,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:35:47,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 21:35:47,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:35:47,600 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 21:35:47,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 21:35:47,770 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:47,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:35:47,830 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:35:47,830 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2022-03-15 21:35:47,920 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:35:47,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2022-03-15 21:35:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:48,009 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511544110] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:35:48,009 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:35:48,009 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 22 [2022-03-15 21:35:48,009 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1202803514] [2022-03-15 21:35:48,010 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:48,011 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:48,018 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 120 transitions. [2022-03-15 21:35:48,018 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:49,206 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [6933#(and (or (<= N (select q2 q2_front)) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (<= (select q2 q2_front) N) (< i N))), 6935#(and (= (select q1 q1_front) 1) (<= i 1) (<= 1 N) (= q2_back q2_front)), 6928#(and (or (<= N (select q2 q2_front)) (not (= j 0))) (or (<= (select q2 q2_front) N) (not (= j 0)))), 6929#(and (<= N (select q2 q2_front)) (<= (select q2 q2_front) N)), 6926#(and (or f g (<= t N)) (or (<= N t) f g)), 6927#(and (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= t N)) (or (<= N t) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 6930#(and (<= N 1) (<= 1 N) (= j 1) (= q2_back q2_front)), 6932#(and (or (not (= (select q1 q1_back) 0)) (<= N (+ (select q2 q2_front) t)) (< i N)) (or (<= (+ (select q2 q2_front) t) N) (not (= (select q1 q1_back) 0)) (< i N))), 6937#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 6934#(and (<= i 1) (<= 1 N) (= j 1) (= q2_back q2_front)), 6931#(and (or (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 q1_front) 0)) (< i N) (<= t N)) (or (<= N t) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 q1_front) 0)) (< i N))), 6936#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front))] [2022-03-15 21:35:49,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 21:35:49,206 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:49,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 21:35:49,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1092, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 21:35:49,207 INFO L87 Difference]: Start difference. First operand 306 states and 870 transitions. Second operand has 26 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:53,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:53,055 INFO L93 Difference]: Finished difference Result 723 states and 1916 transitions. [2022-03-15 21:35:53,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-03-15 21:35:53,055 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:35:53,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:53,059 INFO L225 Difference]: With dead ends: 723 [2022-03-15 21:35:53,059 INFO L226 Difference]: Without dead ends: 715 [2022-03-15 21:35:53,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 50 SyntacticMatches, 13 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3576 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1124, Invalid=8976, Unknown=0, NotChecked=0, Total=10100 [2022-03-15 21:35:53,061 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 249 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 1893 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:53,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 37 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1893 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:35:53,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-03-15 21:35:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 309. [2022-03-15 21:35:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 2.8474025974025974) internal successors, (877), 308 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:53,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 877 transitions. [2022-03-15 21:35:53,074 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 877 transitions. Word has length 21 [2022-03-15 21:35:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:53,074 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 877 transitions. [2022-03-15 21:35:53,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 877 transitions. [2022-03-15 21:35:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:35:53,075 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:53,075 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:53,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 21:35:53,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:53,292 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:35:53,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:53,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1789029819, now seen corresponding path program 5 times [2022-03-15 21:35:53,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:53,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359693035] [2022-03-15 21:35:53,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:53,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:35:53,326 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:53,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359693035] [2022-03-15 21:35:53,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359693035] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:35:53,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442593222] [2022-03-15 21:35:53,326 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:35:53,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:53,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:53,328 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:35:53,359 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:35:53,371 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 21:35:53,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:35:53,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 21:35:53,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:35:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:35:53,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:35:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:35:53,442 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442593222] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:35:53,442 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:35:53,443 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2022-03-15 21:35:53,443 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1996789311] [2022-03-15 21:35:53,443 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:53,445 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:53,452 INFO L252 McrAutomatonBuilder]: Finished intersection with 77 states and 146 transitions. [2022-03-15 21:35:53,452 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:53,810 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:35:53,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 21:35:53,811 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:53,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 21:35:53,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:35:53,811 INFO L87 Difference]: Start difference. First operand 309 states and 877 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:53,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:53,856 INFO L93 Difference]: Finished difference Result 427 states and 1168 transitions. [2022-03-15 21:35:53,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 21:35:53,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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:35:53,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:53,858 INFO L225 Difference]: With dead ends: 427 [2022-03-15 21:35:53,858 INFO L226 Difference]: Without dead ends: 413 [2022-03-15 21:35:53,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 28 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:35:53,859 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:53,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 2 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:35:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-03-15 21:35:53,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 353. [2022-03-15 21:35:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 2.897727272727273) internal successors, (1020), 352 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:53,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1020 transitions. [2022-03-15 21:35:53,869 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1020 transitions. Word has length 22 [2022-03-15 21:35:53,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:53,869 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 1020 transitions. [2022-03-15 21:35:53,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:53,870 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1020 transitions. [2022-03-15 21:35:53,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:35:53,871 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:53,871 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:53,888 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:35:54,075 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,SelfDestructingSolverStorable11 [2022-03-15 21:35:54,076 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:35:54,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:54,076 INFO L85 PathProgramCache]: Analyzing trace with hash -762097669, now seen corresponding path program 6 times [2022-03-15 21:35:54,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:54,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462002156] [2022-03-15 21:35:54,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:54,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:54,120 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:35:54,120 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:54,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462002156] [2022-03-15 21:35:54,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462002156] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:35:54,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483841378] [2022-03-15 21:35:54,120 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:35:54,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:54,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:54,127 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:35:54,127 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:35:54,156 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:35:54,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:35:54,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:35:54,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:35:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:35:54,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:35:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:35:54,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483841378] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:35:54,241 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:35:54,241 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-03-15 21:35:54,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [664487687] [2022-03-15 21:35:54,241 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:54,242 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:54,249 INFO L252 McrAutomatonBuilder]: Finished intersection with 83 states and 158 transitions. [2022-03-15 21:35:54,249 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:54,661 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:35:54,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:35:54,662 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:54,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:35:54,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 21:35:54,662 INFO L87 Difference]: Start difference. First operand 353 states and 1020 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:54,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:54,717 INFO L93 Difference]: Finished difference Result 621 states and 1786 transitions. [2022-03-15 21:35:54,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 21:35:54,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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:35:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:54,721 INFO L225 Difference]: With dead ends: 621 [2022-03-15 21:35:54,721 INFO L226 Difference]: Without dead ends: 584 [2022-03-15 21:35:54,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 76 SyntacticMatches, 28 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 21:35:54,722 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 34 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:54,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 2 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:35:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-03-15 21:35:54,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 440. [2022-03-15 21:35:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.011389521640091) internal successors, (1322), 439 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:54,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1322 transitions. [2022-03-15 21:35:54,739 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1322 transitions. Word has length 22 [2022-03-15 21:35:54,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:54,739 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 1322 transitions. [2022-03-15 21:35:54,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:54,740 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1322 transitions. [2022-03-15 21:35:54,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:35:54,741 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:54,741 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:54,766 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:35:54,963 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,SelfDestructingSolverStorable12 [2022-03-15 21:35:54,964 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:35:54,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:54,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2036854664, now seen corresponding path program 7 times [2022-03-15 21:35:54,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:54,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314227894] [2022-03-15 21:35:54,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:54,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:55,043 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:35:55,044 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:55,044 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314227894] [2022-03-15 21:35:55,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314227894] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:35:55,044 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897199766] [2022-03-15 21:35:55,044 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:35:55,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:55,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:55,046 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:35:55,056 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:35:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:55,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 21:35:55,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:35:55,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 21:35:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:35:55,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:35:55,164 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:35:55,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-03-15 21:35:55,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:35:55,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897199766] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:35:55,186 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:35:55,186 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2022-03-15 21:35:55,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1324372201] [2022-03-15 21:35:55,187 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:55,188 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:55,195 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 135 transitions. [2022-03-15 21:35:55,195 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:55,827 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [11448#(or (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 q1_front) 0))), 11449#(or (not (= (select q1 q1_back) 1)) (not f) (not (= (select q1 q1_front) 0)) (not (= (select q1 (+ q1_back 1)) 0))), 11447#(or (not (= (select q1 q1_back) 1)) (not f) (not (= (select q1 q1_front) 0)) (not (= (select q1 (+ q1_back 1)) 0)) (<= (+ q1_back 2) q1_front)), 11445#(or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))), 11446#(or (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 q1_front) 0)))] [2022-03-15 21:35:55,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 21:35:55,827 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:55,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 21:35:55,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-03-15 21:35:55,828 INFO L87 Difference]: Start difference. First operand 440 states and 1322 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:56,065 INFO L93 Difference]: Finished difference Result 687 states and 1993 transitions. [2022-03-15 21:35:56,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 21:35:56,065 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:56,069 INFO L225 Difference]: With dead ends: 687 [2022-03-15 21:35:56,069 INFO L226 Difference]: Without dead ends: 687 [2022-03-15 21:35:56,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2022-03-15 21:35:56,069 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 90 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:56,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 14 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:35:56,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2022-03-15 21:35:56,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 641. [2022-03-15 21:35:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 640 states have (on average 2.9421875) internal successors, (1883), 640 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1883 transitions. [2022-03-15 21:35:56,084 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1883 transitions. Word has length 22 [2022-03-15 21:35:56,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:56,084 INFO L470 AbstractCegarLoop]: Abstraction has 641 states and 1883 transitions. [2022-03-15 21:35:56,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1883 transitions. [2022-03-15 21:35:56,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:35:56,086 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:56,086 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:56,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-03-15 21:35:56,299 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,SelfDestructingSolverStorable13 [2022-03-15 21:35:56,299 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:35:56,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:56,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1477774686, now seen corresponding path program 8 times [2022-03-15 21:35:56,300 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:56,300 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478322909] [2022-03-15 21:35:56,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:56,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:56,375 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:35:56,375 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:56,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478322909] [2022-03-15 21:35:56,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478322909] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:35:56,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016799592] [2022-03-15 21:35:56,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:35:56,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:56,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:56,377 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:35:56,385 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:35:56,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:35:56,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:35:56,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 21:35:56,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:35:56,456 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 21:35:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:35:56,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:35:56,524 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:35:56,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2022-03-15 21:35:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:35:56,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016799592] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:35:56,543 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:35:56,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-03-15 21:35:56,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [144742317] [2022-03-15 21:35:56,543 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:56,545 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:56,553 INFO L252 McrAutomatonBuilder]: Finished intersection with 77 states and 145 transitions. [2022-03-15 21:35:56,553 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:57,021 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [13576#(or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))), 13575#(or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (<= q1_back q1_front)), 13574#(or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not f) (not (< q1_front q1_back)))] [2022-03-15 21:35:57,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 21:35:57,022 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:57,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 21:35:57,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-03-15 21:35:57,022 INFO L87 Difference]: Start difference. First operand 641 states and 1883 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:57,455 INFO L93 Difference]: Finished difference Result 932 states and 2629 transitions. [2022-03-15 21:35:57,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 21:35:57,455 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 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:35:57,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:57,459 INFO L225 Difference]: With dead ends: 932 [2022-03-15 21:35:57,460 INFO L226 Difference]: Without dead ends: 932 [2022-03-15 21:35:57,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=871, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 21:35:57,461 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 132 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:57,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 16 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:35:57,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-03-15 21:35:57,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 718. [2022-03-15 21:35:57,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 2.9414225941422596) internal successors, (2109), 717 states have internal predecessors, (2109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 2109 transitions. [2022-03-15 21:35:57,479 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 2109 transitions. Word has length 22 [2022-03-15 21:35:57,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:57,479 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 2109 transitions. [2022-03-15 21:35:57,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:57,479 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 2109 transitions. [2022-03-15 21:35:57,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 21:35:57,481 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:57,481 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:57,506 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:35:57,699 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,SelfDestructingSolverStorable14 [2022-03-15 21:35:57,699 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:35:57,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:57,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1448483565, now seen corresponding path program 9 times [2022-03-15 21:35:57,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:57,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953124888] [2022-03-15 21:35:57,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:57,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:57,740 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:35:57,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:57,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953124888] [2022-03-15 21:35:57,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953124888] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:35:57,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301086890] [2022-03-15 21:35:57,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:35:57,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:57,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:57,742 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:35:57,749 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:35:57,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:35:57,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:35:57,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:35:57,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:35:57,811 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:35:57,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:35:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:35:57,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301086890] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:35:57,848 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:35:57,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-03-15 21:35:57,849 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [286316788] [2022-03-15 21:35:57,849 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:57,850 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:57,858 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 144 transitions. [2022-03-15 21:35:57,858 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:58,146 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:35:58,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:35:58,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:58,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:35:58,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 21:35:58,147 INFO L87 Difference]: Start difference. First operand 718 states and 2109 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:58,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:58,207 INFO L93 Difference]: Finished difference Result 1418 states and 4342 transitions. [2022-03-15 21:35:58,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 21:35:58,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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:35:58,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:58,214 INFO L225 Difference]: With dead ends: 1418 [2022-03-15 21:35:58,214 INFO L226 Difference]: Without dead ends: 1379 [2022-03-15 21:35:58,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 92 SyntacticMatches, 9 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 21:35:58,215 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 38 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:58,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 2 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:35:58,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2022-03-15 21:35:58,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1155. [2022-03-15 21:35:58,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 3.236568457538995) internal successors, (3735), 1154 states have internal predecessors, (3735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:58,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 3735 transitions. [2022-03-15 21:35:58,244 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 3735 transitions. Word has length 24 [2022-03-15 21:35:58,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:58,244 INFO L470 AbstractCegarLoop]: Abstraction has 1155 states and 3735 transitions. [2022-03-15 21:35:58,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:58,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 3735 transitions. [2022-03-15 21:35:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 21:35:58,247 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:58,247 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:58,276 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:35:58,466 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,SelfDestructingSolverStorable15 [2022-03-15 21:35:58,466 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:35:58,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:58,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1449453472, now seen corresponding path program 10 times [2022-03-15 21:35:58,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:58,467 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660470897] [2022-03-15 21:35:58,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:58,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:58,626 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:58,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660470897] [2022-03-15 21:35:58,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660470897] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:35:58,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357183294] [2022-03-15 21:35:58,627 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:35:58,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:58,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:58,628 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:35:58,628 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:35:58,659 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:35:58,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:35:58,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 21:35:58,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:35:58,738 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:35:58,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:35:58,768 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:35:58,768 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 12 treesize of output 11 [2022-03-15 21:35:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:35:58,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357183294] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:35:58,803 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:35:58,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 14 [2022-03-15 21:35:58,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [209487090] [2022-03-15 21:35:58,803 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:58,806 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:58,829 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 149 transitions. [2022-03-15 21:35:58,829 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:36:00,113 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [20002#(and (or (<= q2_back q2_front) (not f) (<= q1_back q1_front)) (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))) (or (not f) (<= q1_back q1_front) (< q2_front (+ q2_back 1)))), 20006#(and (or (not (= (select q1 q1_back) 1)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (not f) (not (= (select q1 q1_front) 0)) (not (= (select q1 (+ q1_back 1)) 0)))), 20005#(and (or (not (= (select q1 q1_back) 1)) (not f) (not (= (select q1 q1_front) 0)) (not (= (select q1 (+ q1_back 1)) 0)) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (< q2_front (+ q2_back 1)) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (<= q2_back q2_front) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (<= (+ q1_back 2) q1_front))), 20000#(or (not f) (<= q1_back q1_front)), 20001#(or g (not f) (<= q1_back q1_front)), 20004#(and (or (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 q1_front) 0))) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0))) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)))), 20003#(and (or (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 q1_front) 0))) (or (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (< q2_front (+ q2_back 1))) (or (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0))))] [2022-03-15 21:36:00,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 21:36:00,114 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:36:00,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 21:36:00,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2022-03-15 21:36:00,114 INFO L87 Difference]: Start difference. First operand 1155 states and 3735 transitions. Second operand has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 17 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:36:01,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:36:01,841 INFO L93 Difference]: Finished difference Result 2185 states and 6636 transitions. [2022-03-15 21:36:01,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 21:36:01,841 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 17 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 24 [2022-03-15 21:36:01,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:36:01,852 INFO L225 Difference]: With dead ends: 2185 [2022-03-15 21:36:01,852 INFO L226 Difference]: Without dead ends: 2185 [2022-03-15 21:36:01,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 81 SyntacticMatches, 10 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=491, Invalid=2931, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 21:36:01,853 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 165 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:36:01,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 23 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:36:01,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-03-15 21:36:01,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 1260. [2022-03-15 21:36:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 1259 states have (on average 3.2009531374106435) internal successors, (4030), 1259 states have internal predecessors, (4030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:01,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 4030 transitions. [2022-03-15 21:36:01,888 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 4030 transitions. Word has length 24 [2022-03-15 21:36:01,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:36:01,888 INFO L470 AbstractCegarLoop]: Abstraction has 1260 states and 4030 transitions. [2022-03-15 21:36:01,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 17 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:36:01,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 4030 transitions. [2022-03-15 21:36:01,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 21:36:01,891 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:36:01,891 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:36:01,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 21:36:02,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 21:36:02,103 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:36:02,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:36:02,104 INFO L85 PathProgramCache]: Analyzing trace with hash -756462704, now seen corresponding path program 11 times [2022-03-15 21:36:02,105 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:36:02,105 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489000281] [2022-03-15 21:36:02,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:36:02,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:36:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:36:02,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:02,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:36:02,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489000281] [2022-03-15 21:36:02,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489000281] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:36:02,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125203734] [2022-03-15 21:36:02,246 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:36:02,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:02,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:36:02,247 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:36:02,248 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:36:02,278 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:36:02,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:36:02,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 21:36:02,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:36:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:36:02,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:36:02,385 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:36:02,385 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2022-03-15 21:36:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:36:02,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125203734] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:36:02,416 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:36:02,416 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 14 [2022-03-15 21:36:02,417 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1407223984] [2022-03-15 21:36:02,417 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:36:02,418 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:36:02,427 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 159 transitions. [2022-03-15 21:36:02,427 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:36:03,416 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [24941#(or (not (= (select q2 q2_front) 0)) (not f) (<= q1_back q1_front)), 24940#(or g (not f) (<= q1_back q1_front)), 24943#(and (or (not (= (select q1 q1_back) 1)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (not f) (not (= (select q1 q1_front) 0)) (not (= (select q1 (+ q1_back 1)) 0)))), 24939#(or (not f) (<= q1_back q1_front)), 24942#(and (or (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 q1_front) 0))) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0))) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0))))] [2022-03-15 21:36:03,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:36:03,416 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:36:03,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:36:03,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:36:03,417 INFO L87 Difference]: Start difference. First operand 1260 states and 4030 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:04,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:36:04,235 INFO L93 Difference]: Finished difference Result 2618 states and 8106 transitions. [2022-03-15 21:36:04,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 21:36:04,235 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 0 states have call successors, (0), 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:36:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:36:04,247 INFO L225 Difference]: With dead ends: 2618 [2022-03-15 21:36:04,247 INFO L226 Difference]: Without dead ends: 2618 [2022-03-15 21:36:04,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 87 SyntacticMatches, 10 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=337, Invalid=2015, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 21:36:04,248 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 141 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:36:04,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 23 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:36:04,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2022-03-15 21:36:04,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 1569. [2022-03-15 21:36:04,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1568 states have (on average 3.1970663265306123) internal successors, (5013), 1568 states have internal predecessors, (5013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:04,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 5013 transitions. [2022-03-15 21:36:04,290 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 5013 transitions. Word has length 24 [2022-03-15 21:36:04,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:36:04,290 INFO L470 AbstractCegarLoop]: Abstraction has 1569 states and 5013 transitions. [2022-03-15 21:36:04,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:04,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 5013 transitions. [2022-03-15 21:36:04,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 21:36:04,293 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:36:04,293 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:36:04,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 21:36:04,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:04,495 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:36:04,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:36:04,496 INFO L85 PathProgramCache]: Analyzing trace with hash -273727164, now seen corresponding path program 12 times [2022-03-15 21:36:04,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:36:04,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138112462] [2022-03-15 21:36:04,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:36:04,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:36:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:36:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:04,678 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:36:04,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138112462] [2022-03-15 21:36:04,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138112462] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:36:04,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517431755] [2022-03-15 21:36:04,678 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:36:04,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:04,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:36:04,680 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:36:04,681 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:36:04,717 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:36:04,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:36:04,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:36:04,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:36:04,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 21:36:04,843 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:04,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:36:04,859 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:36:04,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-03-15 21:36:04,912 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:36:04,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-03-15 21:36:04,973 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:04,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517431755] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:36:04,973 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:36:04,973 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2022-03-15 21:36:04,973 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [616454166] [2022-03-15 21:36:04,973 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:36:04,975 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:36:04,983 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 134 transitions. [2022-03-15 21:36:04,983 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:36:05,963 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [30917#(and (or (not g) (<= q2_back q2_front) (not (= j 0))) (or (not g) (<= q2_back (+ q2_front 1)))), 30919#(or (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0))), 30918#(and (or (<= q2_back q2_front) (not (= j 0))) (<= q2_back (+ q2_front 1))), 30920#(or g (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0))), 30921#(or (not (= (select q2 q2_front) 0)) (not (= (select q1 q1_back) 0))), 30915#(or g (not f) (<= q1_back q1_front)), 30914#(or (not f) (<= q1_back q1_front)), 30916#(and (or (not (= j (select q2 q2_back))) (<= q2_front q2_back)) (or (not (= j (select q2 q2_back))) (<= q2_back q2_front)) (or (not (= j (select q2 q2_back))) (= j 0) (not (= (select q1 q1_front) 0)))), 30923#(and (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_back) 0)) (not (= (select q1 q1_front) 0))) (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_back) 0)) (< q2_front (+ q2_back 1))) (or (<= q2_back q2_front) (not f) (<= q1_back q1_front) (not (= (select q1 q1_back) 0)))), 30922#(and (or (<= q2_back q2_front) (not (= (select q1 q1_back) 0))) (or (not (= (select q1 q1_back) 0)) (< q2_front (+ q2_back 1))) (or (not (= (select q1 q1_back) 0)) (not (= j 0)))), 30924#(and (or (not (= (select q1 q1_back) 1)) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (< q2_front (+ q2_back 1))) (or (not (= (select q1 q1_back) 1)) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_front) 0)) (not (= (select q1 (+ q1_back 1)) 0))))] [2022-03-15 21:36:05,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 21:36:05,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:36:05,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 21:36:05,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2022-03-15 21:36:05,964 INFO L87 Difference]: Start difference. First operand 1569 states and 5013 transitions. Second operand has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:08,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:36:08,138 INFO L93 Difference]: Finished difference Result 3197 states and 9444 transitions. [2022-03-15 21:36:08,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-15 21:36:08,138 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 21 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 24 [2022-03-15 21:36:08,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:36:08,152 INFO L225 Difference]: With dead ends: 3197 [2022-03-15 21:36:08,152 INFO L226 Difference]: Without dead ends: 3189 [2022-03-15 21:36:08,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 71 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1848 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=826, Invalid=5494, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 21:36:08,154 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 298 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:36:08,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 22 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:36:08,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2022-03-15 21:36:08,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 1623. [2022-03-15 21:36:08,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1622 states have (on average 3.2003699136868065) internal successors, (5191), 1622 states have internal predecessors, (5191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:08,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 5191 transitions. [2022-03-15 21:36:08,198 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 5191 transitions. Word has length 24 [2022-03-15 21:36:08,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:36:08,199 INFO L470 AbstractCegarLoop]: Abstraction has 1623 states and 5191 transitions. [2022-03-15 21:36:08,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:08,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 5191 transitions. [2022-03-15 21:36:08,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 21:36:08,203 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:36:08,203 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:36:08,225 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:36:08,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:08,419 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:36:08,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:36:08,420 INFO L85 PathProgramCache]: Analyzing trace with hash 256465492, now seen corresponding path program 13 times [2022-03-15 21:36:08,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:36:08,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958253981] [2022-03-15 21:36:08,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:36:08,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:36:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:36:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:08,574 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:36:08,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958253981] [2022-03-15 21:36:08,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958253981] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:36:08,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295630826] [2022-03-15 21:36:08,575 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:36:08,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:08,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:36:08,576 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:36:08,583 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:36:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:36:08,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 21:36:08,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:36:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:36:08,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:36:08,728 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:36:08,728 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 14 treesize of output 13 [2022-03-15 21:36:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:36:08,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295630826] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:36:08,758 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:36:08,758 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 14 [2022-03-15 21:36:08,758 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2097584244] [2022-03-15 21:36:08,758 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:36:08,760 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:36:08,771 INFO L252 McrAutomatonBuilder]: Finished intersection with 83 states and 155 transitions. [2022-03-15 21:36:08,771 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:36:09,687 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [37629#(or (not (= 0 (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) 0))), 37623#(or (not f) (<= q1_back q1_front)), 37626#(or (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0))), 37630#(and (or (not (= j (select q2 q2_back))) (<= q2_front q2_back)) (or (not (= j (select q2 q2_back))) (<= q2_back q2_front)) (or (not (= j (select q2 q2_back))) (= j 0) (not (= (select q1 q1_front) 0)))), 37625#(or (not (= (select q2 q2_front) 0)) (not f) (<= q1_back q1_front)), 37624#(or g (not f) (<= q1_back q1_front)), 37627#(or g (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0))), 37628#(or (not (= (select q2 q2_front) 0)) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)))] [2022-03-15 21:36:09,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 21:36:09,687 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:36:09,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 21:36:09,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:36:09,688 INFO L87 Difference]: Start difference. First operand 1623 states and 5191 transitions. Second operand has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:36:10,615 INFO L93 Difference]: Finished difference Result 3168 states and 9706 transitions. [2022-03-15 21:36:10,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 21:36:10,616 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 18 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 24 [2022-03-15 21:36:10,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:36:10,629 INFO L225 Difference]: With dead ends: 3168 [2022-03-15 21:36:10,629 INFO L226 Difference]: Without dead ends: 3168 [2022-03-15 21:36:10,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 88 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=499, Invalid=2693, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 21:36:10,631 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 138 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:36:10,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 26 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:36:10,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3168 states. [2022-03-15 21:36:10,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3168 to 1439. [2022-03-15 21:36:10,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1438 states have (on average 3.1974965229485397) internal successors, (4598), 1438 states have internal predecessors, (4598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 4598 transitions. [2022-03-15 21:36:10,671 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 4598 transitions. Word has length 24 [2022-03-15 21:36:10,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:36:10,671 INFO L470 AbstractCegarLoop]: Abstraction has 1439 states and 4598 transitions. [2022-03-15 21:36:10,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:10,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 4598 transitions. [2022-03-15 21:36:10,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 21:36:10,675 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:36:10,675 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:36:10,697 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:36:10,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:10,891 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:36:10,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:36:10,892 INFO L85 PathProgramCache]: Analyzing trace with hash 265057222, now seen corresponding path program 14 times [2022-03-15 21:36:10,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:36:10,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119211075] [2022-03-15 21:36:10,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:36:10,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:36:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:36:11,013 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:11,013 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:36:11,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119211075] [2022-03-15 21:36:11,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119211075] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:36:11,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724507975] [2022-03-15 21:36:11,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:36:11,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:11,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:36:11,015 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:36:11,015 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:36:11,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:36:11,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:36:11,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:36:11,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:36:11,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 21:36:11,201 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:11,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:36:11,223 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:36:11,223 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-03-15 21:36:11,317 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:36:11,317 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2022-03-15 21:36:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:11,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724507975] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:36:11,355 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:36:11,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2022-03-15 21:36:11,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [323308712] [2022-03-15 21:36:11,355 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:36:11,357 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:36:11,365 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 159 transitions. [2022-03-15 21:36:11,365 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:36:12,241 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [43908#(and (or (= (+ q2_back (* (- 1) q2_front)) 0) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back)))), 43905#(or g (not f) (<= q1_back q1_front)), 43906#(and (or (<= q2_back q2_front) (not f) (<= q1_back q1_front)) (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))) (or (not f) (<= q1_back q1_front) (< q2_front (+ q2_back 1)))), 43907#(and (or (= (+ q2_back (* (- 1) q2_front)) 0) (not f) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not f) (not (< q1_front q1_back)))), 43904#(or (not f) (<= q1_back q1_front))] [2022-03-15 21:36:12,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:36:12,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:36:12,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:36:12,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2022-03-15 21:36:12,242 INFO L87 Difference]: Start difference. First operand 1439 states and 4598 transitions. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:36:13,210 INFO L93 Difference]: Finished difference Result 2519 states and 7747 transitions. [2022-03-15 21:36:13,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 21:36:13,211 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 21:36:13,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:36:13,217 INFO L225 Difference]: With dead ends: 2519 [2022-03-15 21:36:13,217 INFO L226 Difference]: Without dead ends: 2519 [2022-03-15 21:36:13,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 68 SyntacticMatches, 23 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=369, Invalid=2937, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 21:36:13,219 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 167 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:36:13,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 19 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:36:13,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2022-03-15 21:36:13,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 1563. [2022-03-15 21:36:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1562 states have (on average 3.1875800256081948) internal successors, (4979), 1562 states have internal predecessors, (4979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:13,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 4979 transitions. [2022-03-15 21:36:13,256 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 4979 transitions. Word has length 24 [2022-03-15 21:36:13,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:36:13,257 INFO L470 AbstractCegarLoop]: Abstraction has 1563 states and 4979 transitions. [2022-03-15 21:36:13,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:13,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 4979 transitions. [2022-03-15 21:36:13,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 21:36:13,261 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:36:13,261 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:36:13,286 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:36:13,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:13,483 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:36:13,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:36:13,484 INFO L85 PathProgramCache]: Analyzing trace with hash 958047990, now seen corresponding path program 15 times [2022-03-15 21:36:13,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:36:13,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469566391] [2022-03-15 21:36:13,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:36:13,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:36:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:36:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:13,623 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:36:13,623 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469566391] [2022-03-15 21:36:13,623 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469566391] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:36:13,623 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150702801] [2022-03-15 21:36:13,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:36:13,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:13,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:36:13,628 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:36:13,634 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:36:13,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:36:13,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:36:13,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 21:36:13,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:36:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:36:13,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:36:13,772 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:36:13,772 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 14 treesize of output 13 [2022-03-15 21:36:13,800 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:36:13,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150702801] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:36:13,800 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:36:13,801 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 14 [2022-03-15 21:36:13,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1383220946] [2022-03-15 21:36:13,801 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:36:13,811 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:36:13,820 INFO L252 McrAutomatonBuilder]: Finished intersection with 90 states and 173 transitions. [2022-03-15 21:36:13,820 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:36:14,631 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [49773#(or (not (= (select q2 q2_front) 0)) (not f) (<= q1_back q1_front)), 49772#(or g (not f) (<= q1_back q1_front)), 49774#(and (or (= (+ q2_back (* (- 1) q2_front)) 0) (not f) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not f) (not (< q1_front q1_back)))), 49775#(and (or (= (+ q2_back (* (- 1) q2_front)) 0) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back)))), 49771#(or (not f) (<= q1_back q1_front))] [2022-03-15 21:36:14,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:36:14,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:36:14,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:36:14,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:36:14,632 INFO L87 Difference]: Start difference. First operand 1563 states and 4979 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:15,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:36:15,349 INFO L93 Difference]: Finished difference Result 3547 states and 10954 transitions. [2022-03-15 21:36:15,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 21:36:15,349 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 0 states have call successors, (0), 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:36:15,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:36:15,357 INFO L225 Difference]: With dead ends: 3547 [2022-03-15 21:36:15,357 INFO L226 Difference]: Without dead ends: 3547 [2022-03-15 21:36:15,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 83 SyntacticMatches, 20 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=1619, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 21:36:15,358 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 142 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:36:15,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 19 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:36:15,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3547 states. [2022-03-15 21:36:15,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3547 to 1514. [2022-03-15 21:36:15,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1513 states have (on average 3.1989424983476535) internal successors, (4840), 1513 states have internal predecessors, (4840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:15,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 4840 transitions. [2022-03-15 21:36:15,398 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 4840 transitions. Word has length 24 [2022-03-15 21:36:15,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:36:15,398 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 4840 transitions. [2022-03-15 21:36:15,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:15,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 4840 transitions. [2022-03-15 21:36:15,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 21:36:15,402 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:36:15,402 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:36:15,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 21:36:15,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:15,619 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:36:15,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:36:15,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1588658188, now seen corresponding path program 16 times [2022-03-15 21:36:15,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:36:15,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261324360] [2022-03-15 21:36:15,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:36:15,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:36:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:36:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:15,769 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:36:15,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261324360] [2022-03-15 21:36:15,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261324360] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:36:15,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122466196] [2022-03-15 21:36:15,769 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:36:15,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:15,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:36:15,770 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:36:15,771 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:36:15,799 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:36:15,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:36:15,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 21:36:15,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:36:15,874 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 21:36:15,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:36:15,902 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:36:15,903 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 12 treesize of output 11 [2022-03-15 21:36:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 21:36:15,931 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122466196] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:36:15,931 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:36:15,932 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 14 [2022-03-15 21:36:15,932 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [25056948] [2022-03-15 21:36:15,932 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:36:15,933 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:36:15,941 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 149 transitions. [2022-03-15 21:36:15,941 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:36:17,113 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [56562#(and (or (<= (+ q2_back 1) q2_front) (not (= j (select q2 q2_back))) (= j 0) (not (= (select q1 q1_front) 0))) (or (not (= j (select q2 q2_back))) (<= q2_back q2_front))), 56556#(and (or (<= q2_back q2_front) (not (= j 0))) (<= q2_back (+ q2_front 1))), 56557#(and (or (<= q2_back q2_front) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))) (or (not f) (<= q2_back (+ q2_front 1)) (<= q1_back q1_front))), 56564#(or g (not f) (<= q1_back q1_front)), 56561#(and (or (<= (+ q2_back 1) q2_front) (not (= j (select q2 q2_back))) (= j 0) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))) (or (not (= j (select q2 q2_back))) (<= q2_back q2_front) (= j 0) (<= q1_back q1_front))), 56553#(and (or (<= q2_back q2_front) (not f) (<= q1_back q1_front)) (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))) (or (not f) (<= q1_back q1_front) (< q2_front (+ q2_back 1)))), 56555#(and (or (not g) (<= q2_back q2_front) (not f) (not (= (select q1 q1_front) 0))) (or (not g) (<= q2_back (+ q2_front 1)))), 56560#(and (or (<= (+ q2_back 1) q2_front) (not g) (not (= j (select q2 q2_back))) (= j 0) (not (= (select q1 q1_front) 0))) (or (not g) (not (= j (select q2 q2_back))) (<= q2_back q2_front))), 56552#(and (or (not g) (<= q2_back q2_front) (not (= j 0))) (or (not g) (<= q2_back (+ q2_front 1)))), 56554#(and (or (not g) (not f) (<= q2_back (+ q2_front 1)) (<= q1_back q1_front)) (or (not g) (<= q2_back q2_front) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 56563#(or (not f) (<= q1_back q1_front)), 56559#(and (or (<= (+ q2_back 1) q2_front) (not g) (not (= j (select q2 q2_back))) (= j 0) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))) (or (not g) (not (= j (select q2 q2_back))) (<= q2_back q2_front) (= j 0) (<= q1_back q1_front))), 56558#(and (or (<= q2_back q2_front) (not f) (not (= (select q1 q1_front) 0))) (<= q2_back (+ q2_front 1)))] [2022-03-15 21:36:17,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:36:17,114 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:36:17,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:36:17,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:36:17,114 INFO L87 Difference]: Start difference. First operand 1514 states and 4840 transitions. Second operand has 24 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:18,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:36:18,531 INFO L93 Difference]: Finished difference Result 3304 states and 9857 transitions. [2022-03-15 21:36:18,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 21:36:18,531 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 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:36:18,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:36:18,540 INFO L225 Difference]: With dead ends: 3304 [2022-03-15 21:36:18,541 INFO L226 Difference]: Without dead ends: 3304 [2022-03-15 21:36:18,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 74 SyntacticMatches, 11 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=820, Invalid=3736, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 21:36:18,542 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 419 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:36:18,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 19 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:36:18,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3304 states. [2022-03-15 21:36:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3304 to 1452. [2022-03-15 21:36:18,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 1451 states have (on average 3.1847002067539627) internal successors, (4621), 1451 states have internal predecessors, (4621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:18,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 4621 transitions. [2022-03-15 21:36:18,582 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 4621 transitions. Word has length 24 [2022-03-15 21:36:18,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:36:18,583 INFO L470 AbstractCegarLoop]: Abstraction has 1452 states and 4621 transitions. [2022-03-15 21:36:18,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:18,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 4621 transitions. [2022-03-15 21:36:18,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:36:18,586 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:36:18,586 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:36:18,611 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:36:18,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:18,803 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:36:18,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:36:18,803 INFO L85 PathProgramCache]: Analyzing trace with hash -173431252, now seen corresponding path program 17 times [2022-03-15 21:36:18,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:36:18,804 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449119091] [2022-03-15 21:36:18,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:36:18,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:36:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:36:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:19,157 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:36:19,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449119091] [2022-03-15 21:36:19,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449119091] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:36:19,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82280623] [2022-03-15 21:36:19,157 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:36:19,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:19,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:36:19,158 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:36:19,159 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:36:19,189 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:36:19,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:36:19,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 21:36:19,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:36:19,446 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:36:19,446 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2022-03-15 21:36:19,572 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 21:36:19,573 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 14 [2022-03-15 21:36:19,675 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:19,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:36:19,844 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:36:19,844 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 42 treesize of output 60 [2022-03-15 21:36:20,086 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:36:20,087 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 65 [2022-03-15 21:36:20,200 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:20,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82280623] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:36:20,201 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:36:20,201 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 34 [2022-03-15 21:36:20,201 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1579753643] [2022-03-15 21:36:20,201 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:36:20,203 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:36:20,211 INFO L252 McrAutomatonBuilder]: Finished intersection with 81 states and 149 transitions. [2022-03-15 21:36:20,211 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:36:22,595 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [63036#(and (<= N (+ (select q2 q2_front) (select q1 q1_front))) (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1))), 63039#(and (or (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (< i N) (< q2_front (+ q2_back 1))) (or (<= N (+ t (select q1 q1_front))) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ t (select q1 q1_front)) N) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (< i N))), 63049#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 63045#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= N (+ (select q2 q2_front) (select q1 q1_front))) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0)))), 63044#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)) (<= (+ (select q2 q2_front) t (select q1 q1_front)) N)) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ (select q2 q2_front) t (select q1 q1_front))) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0)))), 63038#(and (or (<= q2_back q2_front) (not f) (<= q1_back q1_front)) (or (<= N (+ t (select q1 q1_front))) (not f) (<= q1_back q1_front)) (or (<= (+ t (select q1 q1_front)) N) (not f) (<= q1_back q1_front)) (or (not f) (<= q1_back q1_front) (< q2_front (+ q2_back 1)))), 63035#(and (<= (+ (select q2 q2_front) j) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N (+ (select q2 q2_front) j))), 63048#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 63034#(and (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= t N)) (or (<= N t) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 63046#(and (<= i 1) (= q1_front q1_back) (= j 1) (<= 1 i) (= q2_back q2_front)), 63043#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back q2_front) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ t (select q1 q1_front))) (not (< i N)) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ t (select q1 q1_front)) N) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (<= (+ q1_back 2) q1_front)) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (< q2_front (+ q2_back 1)) (<= (+ q1_back 2) q1_front))), 63041#(and (or (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ (select q2 q2_front) (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 63047#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 63042#(and (= j (select q1 q1_front)) (<= 2 N) (<= i 2) (= j 1) (= q2_back q2_front)), 63033#(and (or f g (<= t N)) (or (<= N t) f g)), 63040#(and (or (not (= (select q1 q1_back) 0)) (< i N) (<= (+ (select q2 q2_front) t (select q1 q1_front)) N)) (or (<= N (+ (select q2 q2_front) t (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 63037#(and (= j (select q1 q1_front)) (<= 2 N) (<= N 2) (= j 1) (= q2_back q2_front))] [2022-03-15 21:36:22,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 21:36:22,596 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:36:22,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 21:36:22,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2505, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 21:36:22,597 INFO L87 Difference]: Start difference. First operand 1452 states and 4621 transitions. Second operand has 35 states, 34 states have (on average 2.764705882352941) internal successors, (94), 34 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:36,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:36:36,698 INFO L93 Difference]: Finished difference Result 4644 states and 12944 transitions. [2022-03-15 21:36:36,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-03-15 21:36:36,699 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.764705882352941) internal successors, (94), 34 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:36:36,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:36:36,709 INFO L225 Difference]: With dead ends: 4644 [2022-03-15 21:36:36,709 INFO L226 Difference]: Without dead ends: 4568 [2022-03-15 21:36:36,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 56 SyntacticMatches, 13 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11594 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=2852, Invalid=29728, Unknown=0, NotChecked=0, Total=32580 [2022-03-15 21:36:36,714 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 282 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 2928 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 3189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 2928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:36:36,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 28 Invalid, 3189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 2928 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 21:36:36,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4568 states. [2022-03-15 21:36:36,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4568 to 1467. [2022-03-15 21:36:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 1466 states have (on average 3.171214188267394) internal successors, (4649), 1466 states have internal predecessors, (4649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:36,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 4649 transitions. [2022-03-15 21:36:36,776 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 4649 transitions. Word has length 25 [2022-03-15 21:36:36,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:36:36,777 INFO L470 AbstractCegarLoop]: Abstraction has 1467 states and 4649 transitions. [2022-03-15 21:36:36,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.764705882352941) internal successors, (94), 34 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:36,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 4649 transitions. [2022-03-15 21:36:36,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:36:36,781 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:36:36,781 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:36:36,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 21:36:36,996 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,SelfDestructingSolverStorable23 [2022-03-15 21:36:36,996 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:36:36,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:36:36,996 INFO L85 PathProgramCache]: Analyzing trace with hash -165553924, now seen corresponding path program 18 times [2022-03-15 21:36:36,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:36:36,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126217829] [2022-03-15 21:36:36,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:36:36,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:36:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:36:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:37,307 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:36:37,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126217829] [2022-03-15 21:36:37,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126217829] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:36:37,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322134616] [2022-03-15 21:36:37,307 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:36:37,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:37,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:36:37,308 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:36:37,309 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:36:37,343 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:36:37,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:36:37,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 21:36:37,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:36:37,598 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:36:37,598 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2022-03-15 21:36:37,712 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:36:37,712 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 55 treesize of output 35 [2022-03-15 21:36:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:37,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:36:38,031 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:36:38,031 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 51 treesize of output 65 [2022-03-15 21:36:38,497 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:36:38,497 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 88 treesize of output 96 [2022-03-15 21:36:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:38,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322134616] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:36:38,643 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:36:38,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 37 [2022-03-15 21:36:38,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [704868859] [2022-03-15 21:36:38,643 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:36:38,645 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:36:38,657 INFO L252 McrAutomatonBuilder]: Finished intersection with 85 states and 159 transitions. [2022-03-15 21:36:38,657 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:36:40,828 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [71076#(and (or (not (= (select q1 q1_back) 0)) (< i N) (<= (+ (select q2 q2_front) t (select q1 q1_front)) N)) (or (<= N (+ (select q2 q2_front) t (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 71083#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 71075#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 71077#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)) (<= (+ (select q2 q2_front) t (select q1 q1_front)) N)) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ (select q2 q2_front) t (select q1 q1_front))) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0)))), 71081#(and (<= i 1) (= q1_front q1_back) (= j 1) (<= 1 i) (= q2_back q2_front)), 71070#(and (<= N (+ (select q2 q2_front) (select q1 q1_front))) (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1))), 71079#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= N (+ (select q2 q2_front) (select q1 q1_front))) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0)))), 71073#(and (or (not f) (<= q1_back q1_front) (<= N (+ (select q2 q2_front) t)) (not (= (select q1 q1_front) 0))) (or (<= (+ (select q2 q2_front) t) N) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 71078#(and (or (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ (select q2 q2_front) (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 71072#(and (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= t N)) (or (<= N t) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 71067#(and (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (not (= j 0))) (or (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N) (not (= j 0)))), 71080#(and (= j (select q1 q1_front)) (<= 2 N) (<= i 2) (= j 1) (= q2_back q2_front)), 71071#(and (or f g (<= t N)) (or (<= N t) f g)), 71082#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 71069#(and (<= (+ (select q2 q2_front) j) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N (+ (select q2 q2_front) j))), 71068#(and (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N)), 71074#(and (= j (select q1 q1_front)) (<= 2 N) (<= N 2) (= j 1) (= q2_back q2_front))] [2022-03-15 21:36:40,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 21:36:40,829 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:36:40,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 21:36:40,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=2780, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 21:36:40,829 INFO L87 Difference]: Start difference. First operand 1467 states and 4649 transitions. Second operand has 35 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 34 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:36:51,586 INFO L93 Difference]: Finished difference Result 4203 states and 11883 transitions. [2022-03-15 21:36:51,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-03-15 21:36:51,586 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 34 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:36:51,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:36:51,600 INFO L225 Difference]: With dead ends: 4203 [2022-03-15 21:36:51,600 INFO L226 Difference]: Without dead ends: 4172 [2022-03-15 21:36:51,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 58 SyntacticMatches, 12 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11200 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=3088, Invalid=28064, Unknown=0, NotChecked=0, Total=31152 [2022-03-15 21:36:51,602 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 301 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 3029 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 3029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:36:51,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 36 Invalid, 3290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 3029 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 21:36:51,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4172 states. [2022-03-15 21:36:51,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4172 to 1481. [2022-03-15 21:36:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1481 states, 1480 states have (on average 3.1614864864864867) internal successors, (4679), 1480 states have internal predecessors, (4679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:51,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 4679 transitions. [2022-03-15 21:36:51,650 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 4679 transitions. Word has length 25 [2022-03-15 21:36:51,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:36:51,650 INFO L470 AbstractCegarLoop]: Abstraction has 1481 states and 4679 transitions. [2022-03-15 21:36:51,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 34 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:51,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 4679 transitions. [2022-03-15 21:36:51,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:36:51,653 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:36:51,653 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:36:51,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 21:36:51,875 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,SelfDestructingSolverStorable24 [2022-03-15 21:36:51,875 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:36:51,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:36:51,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1886276214, now seen corresponding path program 19 times [2022-03-15 21:36:51,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:36:51,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83844307] [2022-03-15 21:36:51,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:36:51,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:36:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:36:52,165 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:52,165 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:36:52,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83844307] [2022-03-15 21:36:52,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83844307] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:36:52,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462373562] [2022-03-15 21:36:52,165 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:36:52,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:52,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:36:52,167 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:36:52,167 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:36:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:36:52,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-15 21:36:52,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:36:52,453 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 21:36:52,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-03-15 21:36:52,570 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 21:36:52,571 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2022-03-15 21:36:52,665 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:52,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:36:52,820 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:36:52,820 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 42 treesize of output 60 [2022-03-15 21:36:53,124 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:36:53,124 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 65 [2022-03-15 21:36:53,202 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:53,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462373562] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:36:53,202 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:36:53,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 33 [2022-03-15 21:36:53,202 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1048390462] [2022-03-15 21:36:53,202 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:36:53,204 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:36:53,213 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 161 transitions. [2022-03-15 21:36:53,213 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:36:55,420 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [78675#(and (<= N (+ (select q2 q2_front) (select q1 q1_front))) (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1))), 78687#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 78671#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1)))), 78685#(and (= j (select q1 q1_front)) (<= 2 N) (<= i 2) (= j 1) (= q2_back q2_front)), 78678#(and (or (< t (+ N 1)) f g) (or (<= N t) f g)), 78676#(and (or (not f) (<= q1_back q1_front) (<= N (+ (select q2 q2_front) t)) (not (= (select q1 q1_front) 0))) (or (<= (+ (select q2 q2_front) t) N) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 78683#(and (or (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ (select q2 q2_front) (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 78673#(and (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N)), 78681#(and (or (not (= (select q1 q1_back) 0)) (< i N) (<= (+ (select q2 q2_front) t (select q1 q1_front)) N)) (or (<= N (+ (select q2 q2_front) t (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 78672#(and (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (not (= j 0))) (or (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N) (not (= j 0)))), 78674#(and (<= (+ (select q2 q2_front) j) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N (+ (select q2 q2_front) j))), 78686#(and (<= i 1) (= q1_front q1_back) (= j 1) (<= 1 i) (= q2_back q2_front)), 78682#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)) (<= (+ (select q2 q2_front) t (select q1 q1_front)) N)) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ (select q2 q2_front) t (select q1 q1_front))) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0)))), 78679#(and (= j (select q1 q1_front)) (<= 2 N) (<= N 2) (= j 1) (= q2_back q2_front)), 78684#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= N (+ (select q2 q2_front) (select q1 q1_front))) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0)))), 78680#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 78670#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 78677#(and (or (<= N t) f) (or f (<= t N)))] [2022-03-15 21:36:55,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:36:55,420 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:36:55,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:36:55,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=2476, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 21:36:55,421 INFO L87 Difference]: Start difference. First operand 1481 states and 4679 transitions. Second operand has 36 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 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:37:08,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:37:08,007 INFO L93 Difference]: Finished difference Result 4703 states and 13277 transitions. [2022-03-15 21:37:08,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-03-15 21:37:08,008 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 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 25 [2022-03-15 21:37:08,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:37:08,017 INFO L225 Difference]: With dead ends: 4703 [2022-03-15 21:37:08,017 INFO L226 Difference]: Without dead ends: 4655 [2022-03-15 21:37:08,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 63 SyntacticMatches, 11 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9978 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=2731, Invalid=25325, Unknown=0, NotChecked=0, Total=28056 [2022-03-15 21:37:08,019 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 327 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 3405 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 3673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 3405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:37:08,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 51 Invalid, 3673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 3405 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 21:37:08,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4655 states. [2022-03-15 21:37:08,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4655 to 1489. [2022-03-15 21:37:08,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 1488 states have (on average 3.153225806451613) internal successors, (4692), 1488 states have internal predecessors, (4692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:37:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 4692 transitions. [2022-03-15 21:37:08,076 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 4692 transitions. Word has length 25 [2022-03-15 21:37:08,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:37:08,076 INFO L470 AbstractCegarLoop]: Abstraction has 1489 states and 4692 transitions. [2022-03-15 21:37:08,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 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:37:08,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 4692 transitions. [2022-03-15 21:37:08,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:37:08,079 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:37:08,079 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:37:08,104 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:37:08,301 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,SelfDestructingSolverStorable25 [2022-03-15 21:37:08,301 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:37:08,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:37:08,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1655550604, now seen corresponding path program 20 times [2022-03-15 21:37:08,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:37:08,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407250686] [2022-03-15 21:37:08,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:37:08,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:37:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:37:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:08,604 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:37:08,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407250686] [2022-03-15 21:37:08,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407250686] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:37:08,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143168638] [2022-03-15 21:37:08,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:37:08,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:37:08,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:37:08,608 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:37:08,611 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:37:08,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:37:08,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:37:08,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-15 21:37:08,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:37:08,847 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 21:37:08,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-03-15 21:37:08,995 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:37:08,995 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-03-15 21:37:09,090 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:09,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:37:09,302 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:37:09,303 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 42 treesize of output 60 [2022-03-15 21:37:09,539 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:37:09,540 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 65 [2022-03-15 21:37:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:09,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143168638] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:37:09,644 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:37:09,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 34 [2022-03-15 21:37:09,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [203756251] [2022-03-15 21:37:09,644 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:37:09,646 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:37:09,654 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 132 transitions. [2022-03-15 21:37:09,654 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:37:11,635 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [86785#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (< q2_front (+ q2_back 1))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ t (select q1 q1_front))) (not (< i N)) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ t (select q1 q1_front)) N) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 (+ q1_back 1)) 0)))), 86789#(and (<= i (+ (select q2 q2_front) j)) (<= (+ (select q2 q2_front) j) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1))), 86794#(and (<= i 1) (= q1_front q1_back) (= j 1) (<= 1 i) (= q2_back q2_front)), 86792#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ (select q2 q2_front) (select q1 q1_front)) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ i 1) (+ (select q2 q2_front) (select q1 q1_front)))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1)))), 86783#(and (or (<= (+ j t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back q2_front) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ j t)) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (< q2_front (+ q2_back 1)))), 86787#(and (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j) N)) (or (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) j))) (<= q2_back (+ q2_front 1))), 86790#(and (<= i (+ (select q2 q2_front) (select q1 q1_front))) (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1))), 86779#(and (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= t N)) (or (<= N t) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 86784#(and (or (<= N (+ t (select q1 q1_front))) (not f) (<= q1_back q1_front) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back q2_front) (not f) (<= q1_back q1_front) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ t (select q1 q1_front)) N) (not f) (<= q1_back q1_front) (not (= (select q1 q1_back) 0)) (< i N)) (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_back) 0)) (< i N) (< q2_front (+ q2_back 1)))), 86782#(and (or (not (= (select q1 q1_back) 0)) (<= N (+ (select q2 q2_front) t)) (< i N)) (or (<= (+ (select q2 q2_front) t) N) (not (= (select q1 q1_back) 0)) (< i N))), 86786#(and (or (<= N (+ (select q2 q2_front) j t)) (not g) (not (< q2_front q2_back))) (or (not g) (<= q2_back (+ q2_front 1))) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j t) N))), 86791#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ i 1) (+ (select q2 q2_front) t (select q1 q1_front)))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ (select q2 q2_front) t (select q1 q1_front)) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1)))), 86780#(and (or f g (<= t N)) (or (<= N t) f g)), 86797#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 86793#(and (= j (select q1 q1_front)) (<= 2 N) (<= i 2) (= j 1) (= q2_back q2_front)), 86796#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 86795#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 86788#(and (<= (+ (select q2 q2_front) j) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N (+ (select q2 q2_front) j))), 86781#(and (or (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 q1_front) 0)) (< i N) (<= t N)) (or (<= N t) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 q1_front) 0)) (< i N)))] [2022-03-15 21:37:11,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 21:37:11,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:37:11,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 21:37:11,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=2685, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 21:37:11,636 INFO L87 Difference]: Start difference. First operand 1489 states and 4692 transitions. Second operand has 37 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 36 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:37:36,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:37:36,932 INFO L93 Difference]: Finished difference Result 5055 states and 13846 transitions. [2022-03-15 21:37:36,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2022-03-15 21:37:36,932 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 36 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:37:36,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:37:36,940 INFO L225 Difference]: With dead ends: 5055 [2022-03-15 21:37:36,940 INFO L226 Difference]: Without dead ends: 4972 [2022-03-15 21:37:36,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 48 SyntacticMatches, 13 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26022 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=5461, Invalid=61361, Unknown=0, NotChecked=0, Total=66822 [2022-03-15 21:37:36,943 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 507 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 3882 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 4304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 3882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:37:36,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [507 Valid, 24 Invalid, 4304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 3882 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 21:37:36,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4972 states. [2022-03-15 21:37:36,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4972 to 1496. [2022-03-15 21:37:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 1495 states have (on average 3.1464882943143815) internal successors, (4704), 1495 states have internal predecessors, (4704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:37:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 4704 transitions. [2022-03-15 21:37:36,997 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 4704 transitions. Word has length 25 [2022-03-15 21:37:36,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:37:36,997 INFO L470 AbstractCegarLoop]: Abstraction has 1496 states and 4704 transitions. [2022-03-15 21:37:36,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 36 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:37:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 4704 transitions. [2022-03-15 21:37:37,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:37:37,000 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:37:37,000 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:37:37,019 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:37:37,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:37:37,212 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:37:37,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:37:37,212 INFO L85 PathProgramCache]: Analyzing trace with hash 911653756, now seen corresponding path program 21 times [2022-03-15 21:37:37,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:37:37,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845049349] [2022-03-15 21:37:37,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:37:37,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:37:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:37:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:37,544 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:37:37,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845049349] [2022-03-15 21:37:37,545 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845049349] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:37:37,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605476093] [2022-03-15 21:37:37,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:37:37,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:37:37,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:37:37,546 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:37:37,548 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:37:37,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:37:37,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:37:37,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-15 21:37:37,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:37:37,797 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 21:37:37,797 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 33 treesize of output 17 [2022-03-15 21:37:37,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:37:37,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:37:37,971 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 57 treesize of output 35 [2022-03-15 21:37:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:38,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:37:38,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:37:38,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:37:38,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:37:38,587 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:37:38,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2022-03-15 21:37:39,124 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:37:39,125 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 104 treesize of output 106 [2022-03-15 21:37:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:39,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605476093] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:37:39,430 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:37:39,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 40 [2022-03-15 21:37:39,430 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1499071114] [2022-03-15 21:37:39,430 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:37:39,432 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:37:39,462 INFO L252 McrAutomatonBuilder]: Finished intersection with 83 states and 153 transitions. [2022-03-15 21:37:39,462 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:37:41,453 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [95439#(and (or f g (<= t N)) (or (<= N t) f g)), 95441#(and (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (not (= j 0))) (or (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N) (not (= j 0)))), 95443#(and (or (not f) (<= q1_back q1_front) (<= N (+ (select q2 q2_front) t)) (not (= (select q1 q1_front) 0))) (or (<= (+ (select q2 q2_front) t) N) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 95455#(and (<= i 1) (= q1_front q1_back) (= j 1) (<= 1 i) (= q2_back q2_front)), 95447#(and (or (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) N) (not (= (select q1 q1_back) 0)) (< i N))), 95450#(and (<= i (+ (select q2 q2_front) j)) (<= (+ (select q2 q2_front) j) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1))), 95440#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 95454#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ (select q2 q2_front) (select q1 q1_front)) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ i 1) (+ (select q2 q2_front) (select q1 q1_front)))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1)))), 95457#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 95452#(and (= j (select q1 q1_front)) (<= 2 N) (<= i 2) (= j 1) (= q2_back q2_front)), 95444#(and (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N)), 95445#(and (or (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 q1_front) 0)) (< i N) (<= t N)) (or (<= N t) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 q1_front) 0)) (< i N))), 95451#(and (<= i (+ (select q2 q2_front) (select q1 q1_front))) (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1))), 95442#(and (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= t N)) (or (<= N t) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 95448#(and (or (not (= (select q1 q1_back) 0)) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N) (< i N)) (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) 0)) (< i N))), 95453#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ i 1) (+ (select q2 q2_front) t (select q1 q1_front)))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ (select q2 q2_front) t (select q1 q1_front)) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1)))), 95446#(and (or (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (<= N (+ (select q2 q2_front) t)) (not (= (select q1 q1_front) 0)) (< i N)) (or (<= (+ (select q2 q2_front) t) N) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 q1_front) 0)) (< i N))), 95456#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 95449#(and (<= (+ (select q2 q2_front) j) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N (+ (select q2 q2_front) j)))] [2022-03-15 21:37:41,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 21:37:41,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:37:41,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 21:37:41,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=3245, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 21:37:41,454 INFO L87 Difference]: Start difference. First operand 1496 states and 4704 transitions. Second operand has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 36 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:38:03,884 INFO L93 Difference]: Finished difference Result 4980 states and 13774 transitions. [2022-03-15 21:38:03,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2022-03-15 21:38:03,885 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 36 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:38:03,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:38:03,895 INFO L225 Difference]: With dead ends: 4980 [2022-03-15 21:38:03,895 INFO L226 Difference]: Without dead ends: 4935 [2022-03-15 21:38:03,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 50 SyntacticMatches, 13 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29663 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=6775, Invalid=65317, Unknown=0, NotChecked=0, Total=72092 [2022-03-15 21:38:03,899 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 495 mSDsluCounter, 1927 mSDsCounter, 0 mSdLazyCounter, 4353 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 4760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 4353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:38:03,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [495 Valid, 37 Invalid, 4760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 4353 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 21:38:03,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4935 states. [2022-03-15 21:38:03,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4935 to 1509. [2022-03-15 21:38:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 3.1379310344827585) internal successors, (4732), 1508 states have internal predecessors, (4732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:03,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 4732 transitions. [2022-03-15 21:38:03,945 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 4732 transitions. Word has length 25 [2022-03-15 21:38:03,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:38:03,945 INFO L470 AbstractCegarLoop]: Abstraction has 1509 states and 4732 transitions. [2022-03-15 21:38:03,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 36 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:03,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 4732 transitions. [2022-03-15 21:38:03,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:38:03,948 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:38:03,949 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:38:03,971 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:38:04,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 21:38:04,163 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:38:04,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:38:04,164 INFO L85 PathProgramCache]: Analyzing trace with hash -809068534, now seen corresponding path program 22 times [2022-03-15 21:38:04,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:38:04,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113767030] [2022-03-15 21:38:04,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:38:04,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:38:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:38:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:04,507 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:38:04,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113767030] [2022-03-15 21:38:04,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113767030] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:38:04,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423036344] [2022-03-15 21:38:04,508 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:38:04,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:38:04,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:38:04,512 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:38:04,513 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:38:04,550 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:38:04,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:38:04,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-15 21:38:04,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:38:04,812 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:38:04,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2022-03-15 21:38:04,975 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 21:38:04,976 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 33 treesize of output 17 [2022-03-15 21:38:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:05,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:38:05,257 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:38:05,258 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 42 treesize of output 60 [2022-03-15 21:38:05,501 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:38:05,501 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 65 [2022-03-15 21:38:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:05,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423036344] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:38:05,603 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:38:05,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 33 [2022-03-15 21:38:05,603 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [871849386] [2022-03-15 21:38:05,603 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:38:05,605 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:38:05,614 INFO L252 McrAutomatonBuilder]: Finished intersection with 83 states and 153 transitions. [2022-03-15 21:38:05,614 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:38:07,523 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [104062#(and (<= i (+ (select q2 q2_front) (select q1 q1_front))) (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1))), 104052#(and (or (<= N t) f) (or f (<= t N))), 104058#(and (or (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) N) (not (= (select q1 q1_back) 0)) (< i N))), 104055#(and (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (not (= j 0))) (or (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N) (not (= j 0)))), 104053#(and (or (< t (+ N 1)) f g) (or (<= N t) f g)), 104054#(and (or (not f) (<= q1_back q1_front) (<= N (+ (select q2 q2_front) t)) (not (= (select q1 q1_front) 0))) (or (<= (+ (select q2 q2_front) t) N) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 104060#(and (<= (+ (select q2 q2_front) j) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N (+ (select q2 q2_front) j))), 104068#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 104069#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1)))), 104057#(and (or (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (<= N (+ (select q2 q2_front) t)) (not (= (select q1 q1_front) 0)) (< i N)) (or (<= (+ (select q2 q2_front) t) N) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 q1_front) 0)) (< i N))), 104061#(and (<= i (+ (select q2 q2_front) j)) (<= (+ (select q2 q2_front) j) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1))), 104064#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ i 1) (+ (select q2 q2_front) t (select q1 q1_front)))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ (select q2 q2_front) t (select q1 q1_front)) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1)))), 104056#(and (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N)), 104059#(and (or (not (= (select q1 q1_back) 0)) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N) (< i N)) (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) 0)) (< i N))), 104063#(and (= j (select q1 q1_front)) (<= 2 N) (<= i 2) (= j 1) (= q2_back q2_front)), 104066#(and (<= i 1) (= q1_front q1_back) (= j 1) (<= 1 i) (= q2_back q2_front)), 104065#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ (select q2 q2_front) (select q1 q1_front)) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ i 1) (+ (select q2 q2_front) (select q1 q1_front)))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1)))), 104051#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 104067#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front))] [2022-03-15 21:38:07,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 21:38:07,524 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:38:07,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 21:38:07,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=2586, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 21:38:07,524 INFO L87 Difference]: Start difference. First operand 1509 states and 4732 transitions. Second operand has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 36 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:30,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:38:30,108 INFO L93 Difference]: Finished difference Result 5041 states and 13994 transitions. [2022-03-15 21:38:30,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2022-03-15 21:38:30,109 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 36 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:38:30,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:38:30,117 INFO L225 Difference]: With dead ends: 5041 [2022-03-15 21:38:30,117 INFO L226 Difference]: Without dead ends: 4973 [2022-03-15 21:38:30,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 59 SyntacticMatches, 11 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24407 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=5789, Invalid=55963, Unknown=0, NotChecked=0, Total=61752 [2022-03-15 21:38:30,121 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 497 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 3915 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 4309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 3915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:38:30,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [497 Valid, 34 Invalid, 4309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 3915 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 21:38:30,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4973 states. [2022-03-15 21:38:30,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4973 to 1489. [2022-03-15 21:38:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 1488 states have (on average 3.151209677419355) internal successors, (4689), 1488 states have internal predecessors, (4689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:30,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 4689 transitions. [2022-03-15 21:38:30,169 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 4689 transitions. Word has length 25 [2022-03-15 21:38:30,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:38:30,169 INFO L470 AbstractCegarLoop]: Abstraction has 1489 states and 4689 transitions. [2022-03-15 21:38:30,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 36 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 4689 transitions. [2022-03-15 21:38:30,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:38:30,172 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:38:30,172 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:38:30,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 21:38:30,394 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,SelfDestructingSolverStorable28 [2022-03-15 21:38:30,394 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:38:30,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:38:30,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1436792710, now seen corresponding path program 23 times [2022-03-15 21:38:30,395 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:38:30,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188209240] [2022-03-15 21:38:30,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:38:30,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:38:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:38:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:30,673 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:38:30,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188209240] [2022-03-15 21:38:30,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188209240] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:38:30,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870044490] [2022-03-15 21:38:30,673 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:38:30,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:38:30,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:38:30,675 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:38:30,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 21:38:30,716 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:38:30,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:38:30,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 21:38:30,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:38:30,969 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 21:38:30,970 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 33 treesize of output 17 [2022-03-15 21:38:31,082 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:38:31,082 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-03-15 21:38:31,177 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:31,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:38:31,354 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:38:31,355 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 42 treesize of output 60 [2022-03-15 21:38:31,617 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:38:31,617 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 65 [2022-03-15 21:38:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:31,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870044490] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:38:31,719 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:38:31,719 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 34 [2022-03-15 21:38:31,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1185348262] [2022-03-15 21:38:31,719 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:38:31,734 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:38:31,743 INFO L252 McrAutomatonBuilder]: Finished intersection with 85 states and 159 transitions. [2022-03-15 21:38:31,743 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:38:33,635 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [112670#(and (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (<= 2 N) (<= i 2) (= q2_back q2_front)), 112666#(and (or (<= 2 N) (not f) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not f) (not (< q1_front q1_back))) (or (not f) (not (< q1_front q1_back)) (= q2_back q2_front)) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not f) (not (< q1_front q1_back))) (or (not f) (<= N 2) (not (< q1_front q1_back)))), 112665#(and (or (= (select q1 q1_front) 1) (not f) (not (< q1_front q1_back))) (or (not f) (not (< q1_front q1_back)) (= q2_back q2_front)) (or (not f) (<= (+ 2 t) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not f) (not (< q1_front q1_back))) (or (<= N (+ 2 t)) (not f) (not (< q1_front q1_back)))), 112673#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 112668#(and (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ 2 t) N) (not (< q1_front q1_back))) (or (<= N (+ 2 t)) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 112663#(and (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= t N)) (or (<= N t) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 112660#(and (<= N (+ (select q2 q2_front) (select q1 q1_front))) (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1))), 112661#(and (= j (select q1 q1_front)) (<= 2 N) (<= N 2) (= j 1) (= q2_back q2_front)), 112667#(and (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (<= 2 N) (<= N 2) (= q2_back q2_front)), 112669#(and (or (<= N 2) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back))) (or (<= 2 N) (not (< q1_front q1_back)))), 112672#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 112671#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 112664#(and (or (<= q2_back q2_front) (not f) (<= q1_back q1_front)) (or (<= N (+ t (select q1 q1_front))) (not f) (<= q1_back q1_front)) (or (<= (+ t (select q1 q1_front)) N) (not f) (<= q1_back q1_front)) (or (not f) (<= q1_back q1_front) (< q2_front (+ q2_back 1)))), 112662#(and (or f g (<= t N)) (or (<= N t) f g)), 112659#(and (<= (+ (select q2 q2_front) j) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N (+ (select q2 q2_front) j)))] [2022-03-15 21:38:33,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:38:33,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:38:33,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:38:33,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2297, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 21:38:33,636 INFO L87 Difference]: Start difference. First operand 1489 states and 4689 transitions. Second operand has 33 states, 32 states have (on average 2.9375) internal successors, (94), 32 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:37,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:38:37,713 INFO L93 Difference]: Finished difference Result 3154 states and 9377 transitions. [2022-03-15 21:38:37,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-15 21:38:37,713 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.9375) internal successors, (94), 32 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:38:37,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:38:37,718 INFO L225 Difference]: With dead ends: 3154 [2022-03-15 21:38:37,718 INFO L226 Difference]: Without dead ends: 3134 [2022-03-15 21:38:37,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 62 SyntacticMatches, 13 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4843 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1508, Invalid=13254, Unknown=0, NotChecked=0, Total=14762 [2022-03-15 21:38:37,719 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 207 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 2098 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 2301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 2098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:38:37,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 44 Invalid, 2301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 2098 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:38:37,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3134 states. [2022-03-15 21:38:37,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3134 to 1515. [2022-03-15 21:38:37,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1514 states have (on average 3.1334214002642007) internal successors, (4744), 1514 states have internal predecessors, (4744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:37,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 4744 transitions. [2022-03-15 21:38:37,753 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 4744 transitions. Word has length 25 [2022-03-15 21:38:37,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:38:37,753 INFO L470 AbstractCegarLoop]: Abstraction has 1515 states and 4744 transitions. [2022-03-15 21:38:37,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.9375) internal successors, (94), 32 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:37,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 4744 transitions. [2022-03-15 21:38:37,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:38:37,756 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:38:37,756 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:38:37,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 21:38:37,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:38:37,971 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:38:37,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:38:37,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1444670038, now seen corresponding path program 24 times [2022-03-15 21:38:37,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:38:37,973 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158592241] [2022-03-15 21:38:37,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:38:37,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:38:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:38:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:38,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:38:38,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158592241] [2022-03-15 21:38:38,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158592241] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:38:38,271 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141403349] [2022-03-15 21:38:38,271 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:38:38,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:38:38,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:38:38,272 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:38:38,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 21:38:38,308 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:38:38,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:38:38,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-15 21:38:38,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:38:38,567 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:38:38,567 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2022-03-15 21:38:38,704 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:38:38,704 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-03-15 21:38:38,802 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:38,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:38:39,007 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:38:39,007 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 63 [2022-03-15 21:38:39,408 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:38:39,408 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 83 treesize of output 93 [2022-03-15 21:38:39,517 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:39,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141403349] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:38:39,517 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:38:39,517 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 35 [2022-03-15 21:38:39,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [140443820] [2022-03-15 21:38:39,517 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:38:39,519 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:38:39,528 INFO L252 McrAutomatonBuilder]: Finished intersection with 91 states and 173 transitions. [2022-03-15 21:38:39,529 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:38:41,573 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [119189#(and (or f g (<= t N)) (or (<= N t) f g)), 119183#(and (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N)), 119188#(and (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ 2 t) N) (not (< q1_front q1_back))) (or (<= N (+ 2 t)) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 119185#(and (<= N (+ (select q2 q2_front) (select q1 q1_front))) (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1))), 119190#(and (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= t N)) (or (<= N t) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 119186#(and (= j (select q1 q1_front)) (<= 2 N) (<= N 2) (= j 1) (= q2_back q2_front)), 119192#(and (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (<= 2 N) (<= N 2) (= q2_back q2_front)), 119184#(and (<= (+ (select q2 q2_front) j) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N (+ (select q2 q2_front) j))), 119194#(and (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (<= 2 N) (<= i 2) (= q2_back q2_front)), 119191#(and (or (not f) (<= q1_back q1_front) (<= N (+ (select q2 q2_front) t)) (not (= (select q1 q1_front) 0))) (or (<= (+ (select q2 q2_front) t) N) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 119182#(and (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (not (= j 0))) (or (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N) (not (= j 0)))), 119193#(and (or (<= N 2) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back))) (or (<= 2 N) (not (< q1_front q1_back)))), 119196#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 119187#(and (or (<= 2 N) (not f) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not f) (not (< q1_front q1_back))) (or (not f) (not (< q1_front q1_back)) (= q2_back q2_front)) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not f) (not (< q1_front q1_back))) (or (not f) (<= N 2) (not (< q1_front q1_back)))), 119197#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 119195#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 119181#(and (or (= (select q1 q1_front) 1) (not f) (not (< q1_front q1_back))) (or (not f) (not (< q1_front q1_back)) (= q2_back q2_front)) (or (not f) (<= (+ 2 t) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not f) (not (< q1_front q1_back))) (or (<= N (+ 2 t)) (not f) (not (< q1_front q1_back))))] [2022-03-15 21:38:41,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 21:38:41,573 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:38:41,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 21:38:41,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=2570, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 21:38:41,574 INFO L87 Difference]: Start difference. First operand 1515 states and 4744 transitions. Second operand has 35 states, 34 states have (on average 3.0) internal successors, (102), 34 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:38:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:38:49,265 INFO L93 Difference]: Finished difference Result 3440 states and 10152 transitions. [2022-03-15 21:38:49,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-03-15 21:38:49,265 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.0) internal successors, (102), 34 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 25 [2022-03-15 21:38:49,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:38:49,270 INFO L225 Difference]: With dead ends: 3440 [2022-03-15 21:38:49,270 INFO L226 Difference]: Without dead ends: 3430 [2022-03-15 21:38:49,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 64 SyntacticMatches, 14 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9250 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=2780, Invalid=22980, Unknown=0, NotChecked=0, Total=25760 [2022-03-15 21:38:49,272 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 259 mSDsluCounter, 1406 mSDsCounter, 0 mSdLazyCounter, 2814 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 3105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 2814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:38:49,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 65 Invalid, 3105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 2814 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 21:38:49,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2022-03-15 21:38:49,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 1551. [2022-03-15 21:38:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1550 states have (on average 3.1270967741935483) internal successors, (4847), 1550 states have internal predecessors, (4847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:49,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 4847 transitions. [2022-03-15 21:38:49,304 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 4847 transitions. Word has length 25 [2022-03-15 21:38:49,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:38:49,305 INFO L470 AbstractCegarLoop]: Abstraction has 1551 states and 4847 transitions. [2022-03-15 21:38:49,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.0) internal successors, (102), 34 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:38:49,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 4847 transitions. [2022-03-15 21:38:49,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:38:49,307 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:38:49,308 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:38:49,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-03-15 21:38:49,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:38:49,529 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:38:49,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:38:49,529 INFO L85 PathProgramCache]: Analyzing trace with hash -276052252, now seen corresponding path program 25 times [2022-03-15 21:38:49,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:38:49,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599883153] [2022-03-15 21:38:49,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:38:49,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:38:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:38:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:49,855 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:38:49,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599883153] [2022-03-15 21:38:49,856 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599883153] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:38:49,856 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854691429] [2022-03-15 21:38:49,856 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:38:49,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:38:49,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:38:49,857 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:38:49,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 21:38:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:38:49,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-15 21:38:49,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:38:50,151 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 21:38:50,152 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-03-15 21:38:50,274 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 21:38:50,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2022-03-15 21:38:50,359 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:50,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:38:50,507 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:38:50,507 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 42 treesize of output 60 [2022-03-15 21:38:50,768 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:38:50,769 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 65 [2022-03-15 21:38:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:50,875 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854691429] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:38:50,875 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:38:50,875 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 33 [2022-03-15 21:38:50,875 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1472938004] [2022-03-15 21:38:50,875 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:38:50,877 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:38:50,887 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 175 transitions. [2022-03-15 21:38:50,887 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:38:52,919 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [126137#(and (<= N (+ (select q2 q2_front) (select q1 q1_front))) (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1))), 126135#(and (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N)), 126150#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 126139#(and (or (<= 2 N) (not f) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not f) (not (< q1_front q1_back))) (or (not f) (not (< q1_front q1_back)) (= q2_back q2_front)) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not f) (not (< q1_front q1_back))) (or (not f) (<= N 2) (not (< q1_front q1_back)))), 126133#(and (or (= (select q1 q1_front) 1) (not f) (not (< q1_front q1_back))) (or (not f) (not (< q1_front q1_back)) (= q2_back q2_front)) (or (not f) (<= (+ 2 t) N) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not f) (not (< q1_front q1_back))) (or (<= N (+ 2 t)) (not f) (not (< q1_front q1_back)))), 126148#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1)))), 126147#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 126138#(and (= j (select q1 q1_front)) (<= 2 N) (<= N 2) (= j 1) (= q2_back q2_front)), 126144#(and (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (<= 2 N) (<= N 2) (= q2_back q2_front)), 126141#(and (or (not f) (<= q1_back q1_front) (<= N (+ (select q2 q2_front) t)) (not (= (select q1 q1_front) 0))) (or (<= (+ (select q2 q2_front) t) N) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 126140#(and (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (<= (+ 2 t) N) (not (< q1_front q1_back))) (or (<= N (+ 2 t)) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back)))), 126143#(and (or (< t (+ N 1)) f g) (or (<= N t) f g)), 126149#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 126145#(and (or (<= N 2) (not (< q1_front q1_back))) (or (not (< q1_front q1_back)) (= q2_back q2_front)) (or (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not (< q1_front q1_back))) (or (<= 2 N) (not (< q1_front q1_back)))), 126136#(and (<= (+ (select q2 q2_front) j) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N (+ (select q2 q2_front) j))), 126146#(and (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (<= 2 N) (<= i 2) (= q2_back q2_front)), 126142#(and (or (<= N t) f) (or f (<= t N))), 126134#(and (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (not (= j 0))) (or (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N) (not (= j 0))))] [2022-03-15 21:38:52,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:38:52,919 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:38:52,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:38:52,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=2470, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 21:38:52,920 INFO L87 Difference]: Start difference. First operand 1551 states and 4847 transitions. Second operand has 36 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 35 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:39:01,668 INFO L93 Difference]: Finished difference Result 3862 states and 11338 transitions. [2022-03-15 21:39:01,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2022-03-15 21:39:01,669 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 35 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:39:01,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:39:01,675 INFO L225 Difference]: With dead ends: 3862 [2022-03-15 21:39:01,675 INFO L226 Difference]: Without dead ends: 3830 [2022-03-15 21:39:01,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 69 SyntacticMatches, 11 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8309 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=2499, Invalid=21681, Unknown=0, NotChecked=0, Total=24180 [2022-03-15 21:39:01,676 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 361 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 3245 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 3587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 3245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:39:01,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 71 Invalid, 3587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 3245 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 21:39:01,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3830 states. [2022-03-15 21:39:01,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3830 to 1535. [2022-03-15 21:39:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1534 states have (on average 3.1271186440677967) internal successors, (4797), 1534 states have internal predecessors, (4797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:01,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 4797 transitions. [2022-03-15 21:39:01,741 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 4797 transitions. Word has length 25 [2022-03-15 21:39:01,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:39:01,741 INFO L470 AbstractCegarLoop]: Abstraction has 1535 states and 4797 transitions. [2022-03-15 21:39:01,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 35 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:01,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 4797 transitions. [2022-03-15 21:39:01,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:39:01,744 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:39:01,744 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:39:01,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 21:39:01,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:01,959 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:39:01,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:39:01,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1875269896, now seen corresponding path program 26 times [2022-03-15 21:39:01,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:39:01,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919568408] [2022-03-15 21:39:01,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:39:01,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:39:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:02,273 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:02,273 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:39:02,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919568408] [2022-03-15 21:39:02,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919568408] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:39:02,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123714485] [2022-03-15 21:39:02,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:39:02,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:02,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:39:02,274 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:39:02,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 21:39:02,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:39:02,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:39:02,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-15 21:39:02,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:39:02,560 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:39:02,560 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2022-03-15 21:39:02,697 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:39:02,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-03-15 21:39:02,799 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:02,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:39:03,045 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:39:03,045 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 68 [2022-03-15 21:39:03,646 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:39:03,646 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 107 treesize of output 111 [2022-03-15 21:39:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:03,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123714485] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:39:03,805 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:39:03,805 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 37 [2022-03-15 21:39:03,806 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1020884164] [2022-03-15 21:39:03,806 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:39:03,807 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:39:03,816 INFO L252 McrAutomatonBuilder]: Finished intersection with 81 states and 149 transitions. [2022-03-15 21:39:03,816 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:39:05,737 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [133484#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 133478#(and (or (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (< i N) (< q2_front (+ q2_back 1))) (or (<= N (+ t (select q1 q1_front))) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ t (select q1 q1_front)) N) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back q2_front) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (< i N))), 133485#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 133481#(and (= j (select q1 q1_front)) (<= 2 N) (<= i 2) (= j 1) (= q2_back q2_front)), 133473#(and (<= N (+ (select q2 q2_front) (select q1 q1_front))) (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1))), 133474#(and (= j (select q1 q1_front)) (<= 2 N) (<= N 2) (= j 1) (= q2_back q2_front)), 133477#(and (or (<= q2_back q2_front) (not f) (<= q1_back q1_front)) (or (<= N (+ t (select q1 q1_front))) (not f) (<= q1_back q1_front)) (or (<= (+ t (select q1 q1_front)) N) (not f) (<= q1_back q1_front)) (or (not f) (<= q1_back q1_front) (< q2_front (+ q2_back 1)))), 133482#(and (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (<= 2 N) (<= i 2) (= q2_back q2_front)), 133480#(and (or (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ (select q2 q2_front) (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 133479#(and (or (not (= (select q1 q1_back) 0)) (< i N) (<= (+ (select q2 q2_front) t (select q1 q1_front)) N)) (or (<= N (+ (select q2 q2_front) t (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 133483#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 133472#(and (<= (+ (select q2 q2_front) j) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N (+ (select q2 q2_front) j))), 133475#(and (or f g (<= t N)) (or (<= N t) f g)), 133476#(and (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= t N)) (or (<= N t) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))))] [2022-03-15 21:39:05,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 21:39:05,738 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:39:05,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 21:39:05,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=2504, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 21:39:05,738 INFO L87 Difference]: Start difference. First operand 1535 states and 4797 transitions. Second operand has 32 states, 31 states have (on average 2.870967741935484) internal successors, (89), 31 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:11,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:39:11,923 INFO L93 Difference]: Finished difference Result 3245 states and 9520 transitions. [2022-03-15 21:39:11,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-03-15 21:39:11,923 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.870967741935484) internal successors, (89), 31 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:39:11,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:39:11,928 INFO L225 Difference]: With dead ends: 3245 [2022-03-15 21:39:11,928 INFO L226 Difference]: Without dead ends: 3185 [2022-03-15 21:39:11,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 58 SyntacticMatches, 11 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6523 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1824, Invalid=17916, Unknown=0, NotChecked=0, Total=19740 [2022-03-15 21:39:11,930 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 186 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:39:11,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 36 Invalid, 3313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 3108 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 21:39:11,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3185 states. [2022-03-15 21:39:11,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 1538. [2022-03-15 21:39:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 1537 states have (on average 3.1236174365647367) internal successors, (4801), 1537 states have internal predecessors, (4801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 4801 transitions. [2022-03-15 21:39:11,956 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 4801 transitions. Word has length 25 [2022-03-15 21:39:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:39:11,956 INFO L470 AbstractCegarLoop]: Abstraction has 1538 states and 4801 transitions. [2022-03-15 21:39:11,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.870967741935484) internal successors, (89), 31 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 4801 transitions. [2022-03-15 21:39:11,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:39:11,959 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:39:11,959 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:39:11,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 21:39:12,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:12,159 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:39:12,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:39:12,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1867392568, now seen corresponding path program 27 times [2022-03-15 21:39:12,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:39:12,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480437819] [2022-03-15 21:39:12,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:39:12,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:39:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:12,430 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:39:12,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480437819] [2022-03-15 21:39:12,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480437819] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:39:12,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722524577] [2022-03-15 21:39:12,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:39:12,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:12,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:39:12,432 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:39:12,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 21:39:12,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:39:12,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:39:12,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-15 21:39:12,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:39:12,729 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:39:12,730 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2022-03-15 21:39:12,827 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 21:39:12,827 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2022-03-15 21:39:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:12,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:39:13,085 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:39:13,086 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 42 treesize of output 60 [2022-03-15 21:39:13,327 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:39:13,328 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 65 [2022-03-15 21:39:13,415 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:13,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722524577] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:39:13,415 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:39:13,415 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 34 [2022-03-15 21:39:13,416 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1248540658] [2022-03-15 21:39:13,416 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:39:13,418 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:39:13,427 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 161 transitions. [2022-03-15 21:39:13,427 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:39:15,250 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [140174#(and (= j (select q1 q1_front)) (<= 2 N) (<= i 2) (= j 1) (= q2_back q2_front)), 140163#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 140171#(and (= j (select q1 q1_front)) (<= 2 N) (<= N 2) (= j 1) (= q2_back q2_front)), 140169#(and (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= t N)) (or (<= N t) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 140167#(and (<= N (+ (select q2 q2_front) (select q1 q1_front))) (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1))), 140168#(and (or f g (<= t N)) (or (<= N t) f g)), 140165#(and (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N)), 140166#(and (<= (+ (select q2 q2_front) j) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N (+ (select q2 q2_front) j))), 140176#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 140177#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 140170#(and (or (not f) (<= q1_back q1_front) (<= N (+ (select q2 q2_front) t)) (not (= (select q1 q1_front) 0))) (or (<= (+ (select q2 q2_front) t) N) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 140175#(and (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (<= 2 N) (<= i 2) (= q2_back q2_front)), 140173#(and (or (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ (select q2 q2_front) (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 140164#(and (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (not (= j 0))) (or (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N) (not (= j 0)))), 140172#(and (or (not (= (select q1 q1_back) 0)) (< i N) (<= (+ (select q2 q2_front) t (select q1 q1_front)) N)) (or (<= N (+ (select q2 q2_front) t (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N)))] [2022-03-15 21:39:15,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:39:15,251 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:39:15,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:39:15,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=2292, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 21:39:15,251 INFO L87 Difference]: Start difference. First operand 1538 states and 4801 transitions. Second operand has 33 states, 32 states have (on average 2.96875) internal successors, (95), 32 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:22,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:39:22,848 INFO L93 Difference]: Finished difference Result 3421 states and 10008 transitions. [2022-03-15 21:39:22,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-03-15 21:39:22,848 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.96875) internal successors, (95), 32 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:39:22,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:39:22,854 INFO L225 Difference]: With dead ends: 3421 [2022-03-15 21:39:22,854 INFO L226 Difference]: Without dead ends: 3390 [2022-03-15 21:39:22,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 62 SyntacticMatches, 14 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7748 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2390, Invalid=19662, Unknown=0, NotChecked=0, Total=22052 [2022-03-15 21:39:22,856 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 248 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 3656 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 3907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 3656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:39:22,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 63 Invalid, 3907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 3656 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 21:39:22,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3390 states. [2022-03-15 21:39:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3390 to 1552. [2022-03-15 21:39:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1551 states have (on average 3.114764667956157) internal successors, (4831), 1551 states have internal predecessors, (4831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 4831 transitions. [2022-03-15 21:39:22,891 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 4831 transitions. Word has length 25 [2022-03-15 21:39:22,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:39:22,891 INFO L470 AbstractCegarLoop]: Abstraction has 1552 states and 4831 transitions. [2022-03-15 21:39:22,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.96875) internal successors, (95), 32 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:22,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 4831 transitions. [2022-03-15 21:39:22,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:39:22,894 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:39:22,894 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:39:22,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-15 21:39:23,107 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,SelfDestructingSolverStorable33 [2022-03-15 21:39:23,107 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:39:23,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:39:23,108 INFO L85 PathProgramCache]: Analyzing trace with hash 706852438, now seen corresponding path program 28 times [2022-03-15 21:39:23,108 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:39:23,108 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365748575] [2022-03-15 21:39:23,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:39:23,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:39:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:23,442 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:23,442 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:39:23,443 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365748575] [2022-03-15 21:39:23,443 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365748575] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:39:23,443 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069539916] [2022-03-15 21:39:23,443 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:39:23,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:23,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:39:23,448 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:39:23,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 21:39:23,500 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:39:23,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:39:23,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-15 21:39:23,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:39:23,808 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 21:39:23,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-03-15 21:39:23,960 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 21:39:23,960 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 33 treesize of output 17 [2022-03-15 21:39:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:24,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:39:24,208 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:39:24,208 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 42 treesize of output 60 [2022-03-15 21:39:24,445 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:39:24,446 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 65 [2022-03-15 21:39:24,543 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:24,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069539916] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:39:24,544 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:39:24,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 33 [2022-03-15 21:39:24,544 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [83326288] [2022-03-15 21:39:24,544 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:39:24,545 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:39:24,555 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 163 transitions. [2022-03-15 21:39:24,555 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:39:26,417 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [147087#(and (or (not (= (select q1 q1_back) 0)) (< i N) (<= (+ (select q2 q2_front) t (select q1 q1_front)) N)) (or (<= N (+ (select q2 q2_front) t (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 147078#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 147079#(and (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (not (= j 0))) (or (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N) (not (= j 0)))), 147091#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 147086#(and (= j (select q1 q1_front)) (<= 2 N) (<= N 2) (= j 1) (= q2_back q2_front)), 147084#(and (or (<= N t) f) (or f (<= t N))), 147090#(and (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (<= 2 N) (<= i 2) (= q2_back q2_front)), 147093#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 147085#(and (or (< t (+ N 1)) f g) (or (<= N t) f g)), 147088#(and (or (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ (select q2 q2_front) (select q1 q1_front))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 147089#(and (= j (select q1 q1_front)) (<= 2 N) (<= i 2) (= j 1) (= q2_back q2_front)), 147092#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1)))), 147082#(and (<= N (+ (select q2 q2_front) (select q1 q1_front))) (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1))), 147083#(and (or (not f) (<= q1_back q1_front) (<= N (+ (select q2 q2_front) t)) (not (= (select q1 q1_front) 0))) (or (<= (+ (select q2 q2_front) t) N) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 147081#(and (<= (+ (select q2 q2_front) j) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N (+ (select q2 q2_front) j))), 147080#(and (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N))] [2022-03-15 21:39:26,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 21:39:26,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:39:26,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 21:39:26,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2291, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 21:39:26,418 INFO L87 Difference]: Start difference. First operand 1552 states and 4831 transitions. Second operand has 34 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 33 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:34,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:39:34,338 INFO L93 Difference]: Finished difference Result 3712 states and 10847 transitions. [2022-03-15 21:39:34,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-03-15 21:39:34,338 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 33 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:39:34,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:39:34,343 INFO L225 Difference]: With dead ends: 3712 [2022-03-15 21:39:34,343 INFO L226 Difference]: Without dead ends: 3664 [2022-03-15 21:39:34,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 66 SyntacticMatches, 11 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6372 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2059, Invalid=17401, Unknown=0, NotChecked=0, Total=19460 [2022-03-15 21:39:34,345 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 303 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 3103 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 3376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 3103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:39:34,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 39 Invalid, 3376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 3103 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 21:39:34,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3664 states. [2022-03-15 21:39:34,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3664 to 1523. [2022-03-15 21:39:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1522 states have (on average 3.1346911957950065) internal successors, (4771), 1522 states have internal predecessors, (4771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 4771 transitions. [2022-03-15 21:39:34,387 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 4771 transitions. Word has length 25 [2022-03-15 21:39:34,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:39:34,387 INFO L470 AbstractCegarLoop]: Abstraction has 1523 states and 4771 transitions. [2022-03-15 21:39:34,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 33 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:34,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 4771 transitions. [2022-03-15 21:39:34,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:39:34,390 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:39:34,390 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:39:34,405 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 21:39:34,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:34,591 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:39:34,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:39:34,591 INFO L85 PathProgramCache]: Analyzing trace with hash -46288040, now seen corresponding path program 29 times [2022-03-15 21:39:34,592 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:39:34,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15701164] [2022-03-15 21:39:34,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:39:34,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:39:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:34,881 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:34,882 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:39:34,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15701164] [2022-03-15 21:39:34,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15701164] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:39:34,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460358594] [2022-03-15 21:39:34,882 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:39:34,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:34,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:39:34,883 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:39:34,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 21:39:34,915 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:39:34,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:39:34,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 21:39:34,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:39:35,121 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 21:39:35,122 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-03-15 21:39:35,294 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:39:35,294 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-03-15 21:39:35,399 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:35,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:39:35,706 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:39:35,706 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 68 [2022-03-15 21:39:36,118 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:39:36,118 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 93 treesize of output 99 [2022-03-15 21:39:36,234 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:36,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460358594] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:39:36,234 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:39:36,234 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 37 [2022-03-15 21:39:36,234 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1779152218] [2022-03-15 21:39:36,234 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:39:36,236 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:39:36,245 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 132 transitions. [2022-03-15 21:39:36,245 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:39:37,933 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [154228#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 154213#(and (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= t N)) (or (<= N t) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 154218#(and (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j) N)) (or (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) j))) (<= q2_back (+ q2_front 1))), 154222#(and (= j (select q1 q1_front)) (<= 2 N) (<= i 2) (= j 1) (= q2_back q2_front)), 154227#(and (or (<= N (+ t (select q1 q1_front))) (not f) (<= q1_back q1_front) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back q2_front) (not f) (<= q1_back q1_front) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ t (select q1 q1_front)) N) (not f) (<= q1_back q1_front) (not (= (select q1 q1_back) 0)) (< i N)) (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_back) 0)) (< i N) (< q2_front (+ q2_back 1)))), 154221#(and (<= i (+ (select q2 q2_front) (select q1 q1_front))) (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1))), 154223#(and (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (<= 2 N) (<= i 2) (= q2_back q2_front)), 154219#(and (<= (+ (select q2 q2_front) j) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N (+ (select q2 q2_front) j))), 154220#(and (<= i (+ (select q2 q2_front) j)) (<= (+ (select q2 q2_front) j) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1))), 154224#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 154216#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 154214#(and (or f g (<= t N)) (or (<= N t) f g)), 154225#(and (or (not (= (select q1 q1_back) 0)) (<= N (+ (select q2 q2_front) t)) (< i N)) (or (<= (+ (select q2 q2_front) t) N) (not (= (select q1 q1_back) 0)) (< i N))), 154217#(and (or (<= N (+ (select q2 q2_front) j t)) (not g) (not (< q2_front q2_back))) (or (not g) (<= q2_back (+ q2_front 1))) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) j t) N))), 154226#(and (or (<= (+ j t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back q2_front) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ j t)) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (< q2_front (+ q2_back 1)))), 154215#(and (or (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 q1_front) 0)) (< i N) (<= t N)) (or (<= N t) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 q1_front) 0)) (< i N)))] [2022-03-15 21:39:37,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 21:39:37,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:39:37,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 21:39:37,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2675, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 21:39:37,935 INFO L87 Difference]: Start difference. First operand 1523 states and 4771 transitions. Second operand has 34 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 33 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:49,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:39:49,152 INFO L93 Difference]: Finished difference Result 3362 states and 9742 transitions. [2022-03-15 21:39:49,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2022-03-15 21:39:49,152 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 33 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:39:49,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:39:49,157 INFO L225 Difference]: With dead ends: 3362 [2022-03-15 21:39:49,157 INFO L226 Difference]: Without dead ends: 3297 [2022-03-15 21:39:49,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 50 SyntacticMatches, 11 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10575 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=2813, Invalid=27289, Unknown=0, NotChecked=0, Total=30102 [2022-03-15 21:39:49,158 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 429 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 3272 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 3668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 3272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:39:49,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 31 Invalid, 3668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 3272 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 21:39:49,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3297 states. [2022-03-15 21:39:49,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3297 to 1523. [2022-03-15 21:39:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1522 states have (on average 3.132720105124836) internal successors, (4768), 1522 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 4768 transitions. [2022-03-15 21:39:49,194 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 4768 transitions. Word has length 25 [2022-03-15 21:39:49,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:39:49,194 INFO L470 AbstractCegarLoop]: Abstraction has 1523 states and 4768 transitions. [2022-03-15 21:39:49,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 33 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 4768 transitions. [2022-03-15 21:39:49,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:39:49,197 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:39:49,197 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:39:49,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 21:39:49,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:49,398 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:39:49,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:39:49,398 INFO L85 PathProgramCache]: Analyzing trace with hash -790184888, now seen corresponding path program 30 times [2022-03-15 21:39:49,399 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:39:49,399 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522411004] [2022-03-15 21:39:49,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:39:49,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:39:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:49,673 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:39:49,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522411004] [2022-03-15 21:39:49,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522411004] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:39:49,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558297786] [2022-03-15 21:39:49,674 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:39:49,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:49,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:39:49,676 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:39:49,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 21:39:49,709 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:39:49,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:39:49,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 21:39:49,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:39:49,911 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 21:39:49,911 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-03-15 21:39:50,069 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:39:50,069 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-03-15 21:39:50,162 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:50,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:39:50,367 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:39:50,367 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 42 treesize of output 60 [2022-03-15 21:39:50,572 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:39:50,572 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 65 [2022-03-15 21:39:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:50,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558297786] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:39:50,677 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:39:50,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 34 [2022-03-15 21:39:50,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1882432738] [2022-03-15 21:39:50,678 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:39:50,679 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:39:50,689 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 155 transitions. [2022-03-15 21:39:50,689 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:39:52,504 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [161066#(and (<= i (+ (select q2 q2_front) j)) (<= (+ (select q2 q2_front) j) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1))), 161065#(and (<= (+ (select q2 q2_front) j) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N (+ (select q2 q2_front) j))), 161063#(and (or (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) N) (not (= (select q1 q1_back) 0)) (< i N))), 161064#(and (or (not (= (select q1 q1_back) 0)) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N) (< i N)) (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) 0)) (< i N))), 161068#(and (= j (select q1 q1_front)) (<= 2 N) (<= i 2) (= j 1) (= q2_back q2_front)), 161056#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 161055#(and (or f g (<= t N)) (or (<= N t) f g)), 161058#(and (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= t N)) (or (<= N t) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 161059#(and (or (not f) (<= q1_back q1_front) (<= N (+ (select q2 q2_front) t)) (not (= (select q1 q1_front) 0))) (or (<= (+ (select q2 q2_front) t) N) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 161057#(and (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (not (= j 0))) (or (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N) (not (= j 0)))), 161062#(and (or (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (<= N (+ (select q2 q2_front) t)) (not (= (select q1 q1_front) 0)) (< i N)) (or (<= (+ (select q2 q2_front) t) N) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 q1_front) 0)) (< i N))), 161070#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 161067#(and (<= i (+ (select q2 q2_front) (select q1 q1_front))) (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1))), 161071#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 161060#(and (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N)), 161069#(and (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (<= 2 N) (<= i 2) (= q2_back q2_front)), 161061#(and (or (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 q1_front) 0)) (< i N) (<= t N)) (or (<= N t) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 q1_front) 0)) (< i N)))] [2022-03-15 21:39:52,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 21:39:52,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:39:52,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 21:39:52,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=2485, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 21:39:52,505 INFO L87 Difference]: Start difference. First operand 1523 states and 4768 transitions. Second operand has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 34 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:06,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:06,065 INFO L93 Difference]: Finished difference Result 3809 states and 10921 transitions. [2022-03-15 21:40:06,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2022-03-15 21:40:06,065 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 34 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:40:06,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:06,071 INFO L225 Difference]: With dead ends: 3809 [2022-03-15 21:40:06,071 INFO L226 Difference]: Without dead ends: 3768 [2022-03-15 21:40:06,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 58 SyntacticMatches, 14 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14417 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=3959, Invalid=34261, Unknown=0, NotChecked=0, Total=38220 [2022-03-15 21:40:06,072 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 410 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 3706 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 4085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 3706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:06,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 34 Invalid, 4085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 3706 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 21:40:06,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2022-03-15 21:40:06,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 1518. [2022-03-15 21:40:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1517 states have (on average 3.135135135135135) internal successors, (4756), 1517 states have internal predecessors, (4756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 4756 transitions. [2022-03-15 21:40:06,099 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 4756 transitions. Word has length 25 [2022-03-15 21:40:06,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:06,099 INFO L470 AbstractCegarLoop]: Abstraction has 1518 states and 4756 transitions. [2022-03-15 21:40:06,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 34 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:06,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 4756 transitions. [2022-03-15 21:40:06,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:40:06,102 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:06,102 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:06,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 21:40:06,324 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,SelfDestructingSolverStorable36 [2022-03-15 21:40:06,325 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:40:06,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:06,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1784060118, now seen corresponding path program 31 times [2022-03-15 21:40:06,326 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:06,326 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094438301] [2022-03-15 21:40:06,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:06,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:06,595 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:06,595 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:06,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094438301] [2022-03-15 21:40:06,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094438301] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:06,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896281020] [2022-03-15 21:40:06,596 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:40:06,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:06,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:06,597 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:40:06,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 21:40:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:06,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-15 21:40:06,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:06,837 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 21:40:06,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 33 treesize of output 17 [2022-03-15 21:40:07,006 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 21:40:07,006 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 33 treesize of output 17 [2022-03-15 21:40:07,100 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:07,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:07,303 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:40:07,303 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 42 treesize of output 60 [2022-03-15 21:40:07,513 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:40:07,513 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 65 [2022-03-15 21:40:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:07,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896281020] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:07,632 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:07,632 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 33 [2022-03-15 21:40:07,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1549702650] [2022-03-15 21:40:07,633 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:07,634 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:07,644 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 155 transitions. [2022-03-15 21:40:07,644 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:09,390 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [168393#(and (<= i (+ (select q2 q2_front) (select q1 q1_front))) (<= (+ (select q2 q2_front) (select q1 q1_front)) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1))), 168398#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1)))), 168392#(and (<= i (+ (select q2 q2_front) j)) (<= (+ (select q2 q2_front) j) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1))), 168387#(and (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N)), 168396#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 168385#(and (or (not f) (<= q1_back q1_front) (<= N (+ (select q2 q2_front) t)) (not (= (select q1 q1_front) 0))) (or (<= (+ (select q2 q2_front) t) N) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 168388#(and (or (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (<= N (+ (select q2 q2_front) t)) (not (= (select q1 q1_front) 0)) (< i N)) (or (<= (+ (select q2 q2_front) t) N) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 q1_front) 0)) (< i N))), 168395#(and (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) (select q1 q1_front)) (<= 2 N) (<= i 2) (= q2_back q2_front)), 168397#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 168384#(and (or (< t (+ N 1)) f g) (or (<= N t) f g)), 168394#(and (= j (select q1 q1_front)) (<= 2 N) (<= i 2) (= j 1) (= q2_back q2_front)), 168391#(and (<= (+ (select q2 q2_front) j) N) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N (+ (select q2 q2_front) j))), 168382#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 168386#(and (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (not (= j 0))) (or (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N) (not (= j 0)))), 168383#(and (or (<= N t) f) (or f (<= t N))), 168389#(and (or (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) N) (not (= (select q1 q1_back) 0)) (< i N))), 168390#(and (or (not (= (select q1 q1_back) 0)) (<= (+ (select q2 q2_front) (select q2 (+ q2_front 1))) N) (< i N)) (or (<= N (+ (select q2 q2_front) (select q2 (+ q2_front 1)))) (not (= (select q1 q1_back) 0)) (< i N)))] [2022-03-15 21:40:09,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 21:40:09,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:09,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 21:40:09,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2390, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 21:40:09,391 INFO L87 Difference]: Start difference. First operand 1518 states and 4756 transitions. Second operand has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 34 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:22,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:22,170 INFO L93 Difference]: Finished difference Result 3923 states and 11315 transitions. [2022-03-15 21:40:22,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2022-03-15 21:40:22,170 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 34 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:40:22,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:22,176 INFO L225 Difference]: With dead ends: 3923 [2022-03-15 21:40:22,176 INFO L226 Difference]: Without dead ends: 3855 [2022-03-15 21:40:22,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 62 SyntacticMatches, 11 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11608 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=3312, Invalid=28908, Unknown=0, NotChecked=0, Total=32220 [2022-03-15 21:40:22,178 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 441 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 3872 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 4272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 3872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:22,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 40 Invalid, 4272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 3872 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 21:40:22,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3855 states. [2022-03-15 21:40:22,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3855 to 1494. [2022-03-15 21:40:22,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1493 states have (on average 3.1500334896182185) internal successors, (4703), 1493 states have internal predecessors, (4703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:22,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 4703 transitions. [2022-03-15 21:40:22,205 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 4703 transitions. Word has length 25 [2022-03-15 21:40:22,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:22,205 INFO L470 AbstractCegarLoop]: Abstraction has 1494 states and 4703 transitions. [2022-03-15 21:40:22,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 34 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:22,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 4703 transitions. [2022-03-15 21:40:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:40:22,207 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:22,207 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:22,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-15 21:40:22,416 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,SelfDestructingSolverStorable37 [2022-03-15 21:40:22,416 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:40:22,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:22,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1613544542, now seen corresponding path program 32 times [2022-03-15 21:40:22,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:22,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858402280] [2022-03-15 21:40:22,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:22,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:22,457 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:40:22,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:22,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858402280] [2022-03-15 21:40:22,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858402280] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:22,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749973750] [2022-03-15 21:40:22,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:40:22,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:22,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:22,459 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:40:22,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 21:40:22,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:40:22,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:22,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:40:22,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:40:22,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:22,599 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:40:22,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749973750] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:22,599 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:22,599 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-03-15 21:40:22,599 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [833155687] [2022-03-15 21:40:22,599 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:22,602 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:22,618 INFO L252 McrAutomatonBuilder]: Finished intersection with 99 states and 189 transitions. [2022-03-15 21:40:22,618 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:23,040 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:40:23,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 21:40:23,041 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:23,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 21:40:23,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-03-15 21:40:23,041 INFO L87 Difference]: Start difference. First operand 1494 states and 4703 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:23,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:23,099 INFO L93 Difference]: Finished difference Result 2699 states and 8405 transitions. [2022-03-15 21:40:23,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:40:23,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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:40:23,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:23,103 INFO L225 Difference]: With dead ends: 2699 [2022-03-15 21:40:23,103 INFO L226 Difference]: Without dead ends: 2647 [2022-03-15 21:40:23,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 103 SyntacticMatches, 22 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-03-15 21:40:23,103 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 44 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:23,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 2 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:40:23,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2022-03-15 21:40:23,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 1891. [2022-03-15 21:40:23,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1890 states have (on average 3.1973544973544974) internal successors, (6043), 1890 states have internal predecessors, (6043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:23,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 6043 transitions. [2022-03-15 21:40:23,129 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 6043 transitions. Word has length 26 [2022-03-15 21:40:23,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:23,129 INFO L470 AbstractCegarLoop]: Abstraction has 1891 states and 6043 transitions. [2022-03-15 21:40:23,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:23,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 6043 transitions. [2022-03-15 21:40:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:40:23,132 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:23,132 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:23,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-15 21:40:23,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 21:40:23,333 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:40:23,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:23,333 INFO L85 PathProgramCache]: Analyzing trace with hash -924179943, now seen corresponding path program 33 times [2022-03-15 21:40:23,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:23,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860502433] [2022-03-15 21:40:23,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:23,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:40:23,418 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:23,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860502433] [2022-03-15 21:40:23,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860502433] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:23,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558462975] [2022-03-15 21:40:23,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:40:23,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:23,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:23,419 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:40:23,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 21:40:23,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:40:23,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:23,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 21:40:23,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:23,510 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 21:40:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:40:23,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:23,563 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:40:23,563 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2022-03-15 21:40:23,586 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:40:23,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558462975] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:23,587 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:23,587 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2022-03-15 21:40:23,587 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1533292501] [2022-03-15 21:40:23,587 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:23,589 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:23,600 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 164 transitions. [2022-03-15 21:40:23,600 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:24,332 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [182374#(or (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 (+ q1_front 1)) 0))), 182371#(or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))), 182376#(or (not (= (select q1 q1_back) 1)) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (not (= (select q1 (+ q1_front 1)) 0))), 182372#(or (not f) (<= q1_back q1_front) (not (= (select q1 (+ q1_front 1)) 0))), 182375#(or (not (= (select q1 q1_back) 1)) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (not (= (select q1 (+ q1_front 1)) 0)) (<= (+ q1_back 2) q1_front)), 182373#(or (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (not (= (select q1 (+ q1_front 1)) 0)))] [2022-03-15 21:40:24,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 21:40:24,333 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:24,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 21:40:24,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:40:24,333 INFO L87 Difference]: Start difference. First operand 1891 states and 6043 transitions. Second operand has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:24,984 INFO L93 Difference]: Finished difference Result 4553 states and 14055 transitions. [2022-03-15 21:40:24,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 21:40:24,984 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 21:40:24,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:24,991 INFO L225 Difference]: With dead ends: 4553 [2022-03-15 21:40:24,991 INFO L226 Difference]: Without dead ends: 4553 [2022-03-15 21:40:24,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=368, Invalid=1612, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 21:40:24,992 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 279 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:24,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 24 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:40:24,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4553 states. [2022-03-15 21:40:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4553 to 1886. [2022-03-15 21:40:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1885 states have (on average 3.2429708222811673) internal successors, (6113), 1885 states have internal predecessors, (6113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:25,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 6113 transitions. [2022-03-15 21:40:25,059 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 6113 transitions. Word has length 26 [2022-03-15 21:40:25,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:25,059 INFO L470 AbstractCegarLoop]: Abstraction has 1886 states and 6113 transitions. [2022-03-15 21:40:25,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:25,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 6113 transitions. [2022-03-15 21:40:25,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:40:25,061 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:25,061 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:25,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-03-15 21:40:25,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 21:40:25,262 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:40:25,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:25,263 INFO L85 PathProgramCache]: Analyzing trace with hash 686044019, now seen corresponding path program 34 times [2022-03-15 21:40:25,263 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:25,263 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357634187] [2022-03-15 21:40:25,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:25,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:25,342 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:40:25,342 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:25,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357634187] [2022-03-15 21:40:25,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357634187] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:25,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078971126] [2022-03-15 21:40:25,343 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:40:25,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:25,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:25,344 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:40:25,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 21:40:25,385 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:40:25,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:25,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 21:40:25,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:25,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 21:40:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:40:25,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:25,532 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:40:25,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2022-03-15 21:40:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:40:25,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078971126] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:25,561 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:25,562 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-03-15 21:40:25,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1886622729] [2022-03-15 21:40:25,562 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:25,578 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:25,592 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 174 transitions. [2022-03-15 21:40:25,592 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:26,154 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [190918#(or (not f) (<= q1_back q1_front) (not (= (select q1 (+ q1_front 1)) 0))), 190917#(or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))), 190916#(or (<= q1_back q1_front) (= (select q1 q1_front) (select q1 (+ q1_front 2)))), 190915#(or (not f) (not (< q1_front q1_back)) (= (select q1 q1_front) (select q1 (+ q1_front 2))))] [2022-03-15 21:40:26,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 21:40:26,154 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:26,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 21:40:26,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:40:26,155 INFO L87 Difference]: Start difference. First operand 1886 states and 6113 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:26,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:26,779 INFO L93 Difference]: Finished difference Result 4214 states and 13191 transitions. [2022-03-15 21:40:26,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 21:40:26,779 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 21:40:26,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:26,786 INFO L225 Difference]: With dead ends: 4214 [2022-03-15 21:40:26,786 INFO L226 Difference]: Without dead ends: 4214 [2022-03-15 21:40:26,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=338, Invalid=1732, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 21:40:26,786 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 194 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:26,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 16 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:40:26,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4214 states. [2022-03-15 21:40:26,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4214 to 2164. [2022-03-15 21:40:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2164 states, 2163 states have (on average 3.2662968099861303) internal successors, (7065), 2163 states have internal predecessors, (7065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 2164 states and 7065 transitions. [2022-03-15 21:40:26,817 INFO L78 Accepts]: Start accepts. Automaton has 2164 states and 7065 transitions. Word has length 26 [2022-03-15 21:40:26,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:26,817 INFO L470 AbstractCegarLoop]: Abstraction has 2164 states and 7065 transitions. [2022-03-15 21:40:26,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:26,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 7065 transitions. [2022-03-15 21:40:26,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:40:26,820 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:26,820 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:26,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 21:40:27,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:27,021 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:40:27,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:27,021 INFO L85 PathProgramCache]: Analyzing trace with hash -386991725, now seen corresponding path program 35 times [2022-03-15 21:40:27,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:27,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725521629] [2022-03-15 21:40:27,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:27,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:40:27,169 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:27,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725521629] [2022-03-15 21:40:27,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725521629] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:27,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677271841] [2022-03-15 21:40:27,169 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:40:27,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:27,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:27,170 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:40:27,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 21:40:27,201 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:40:27,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:27,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 21:40:27,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 21:40:27,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:27,305 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:40:27,305 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 12 treesize of output 11 [2022-03-15 21:40:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 21:40:27,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677271841] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:27,335 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:27,335 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 14 [2022-03-15 21:40:27,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1306104010] [2022-03-15 21:40:27,335 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:27,338 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:27,349 INFO L252 McrAutomatonBuilder]: Finished intersection with 95 states and 180 transitions. [2022-03-15 21:40:27,349 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:28,914 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [199680#(and (or (<= q2_back q2_front) (not f) (<= q1_back q1_front)) (or (not f) (<= q1_back q1_front) (< q2_front (+ q2_back 1))) (or (= (select q1 q1_front) 1) (not f) (<= q1_back q1_front))), 199683#(or (not f) (<= q1_back q1_front)), 199687#(and (or (<= (+ q2_back 1) q2_front) (= (select q1 q1_front) 1) (not g) (not (= j (select q2 q2_back))) (= j 0) (<= q1_back q1_front)) (or (not g) (not (= j (select q2 q2_back))) (<= q2_back q2_front) (= j 0) (<= q1_back q1_front))), 199682#(and (or (not f) (<= q2_back (+ q2_front 1)) (<= q1_back q1_front)) (or (= (select q1 q1_front) 1) (<= q2_back q2_front) (not f) (<= q1_back q1_front))), 199679#(and (or (<= q2_back q2_front) (= j 1)) (<= q2_back (+ q2_front 1))), 199690#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0)) (< q2_front (+ q2_back 1))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (<= q2_back q2_front) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0)))), 199688#(and (or (not (= j (select q2 q2_back))) (<= q2_front q2_back)) (or (not (= j (select q2 q2_back))) (<= q2_back q2_front)) (or (= (select q1 q1_front) 1) (not (= j (select q2 q2_back))) (= j 0))), 199689#(and (or (<= (+ q2_back 1) q2_front) (= (select q1 q1_front) 1) (not (= j (select q2 q2_back))) (= j 0) (<= q1_back q1_front)) (or (not (= j (select q2 q2_back))) (<= q2_back q2_front) (= j 0) (<= q1_back q1_front))), 199681#(and (or (not g) (not f) (<= q2_back (+ q2_front 1)) (<= q1_back q1_front)) (or (= (select q1 q1_front) 1) (not g) (<= q2_back q2_front) (not f) (<= q1_back q1_front))), 199684#(or g (not f) (<= q1_back q1_front)), 199685#(and (or (<= q2_back q2_front) (not (= (select q1 q1_back) 0))) (or (not (= (select q1 q1_back) 0)) (< q2_front (+ q2_back 1))) (or (= (select q1 q1_front) 1) (not f) (not (= (select q1 q1_back) 0)))), 199686#(and (or (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 0)) (< q2_front (+ q2_back 1))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not f) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= q2_back q2_front) (not (= (select q1 (+ q1_back 1)) 0)))), 199678#(and (or (not g) (<= q2_back q2_front) (= j 1)) (or (not g) (<= q2_back (+ q2_front 1))))] [2022-03-15 21:40:28,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:40:28,915 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:28,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:40:28,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:40:28,915 INFO L87 Difference]: Start difference. First operand 2164 states and 7065 transitions. Second operand has 24 states, 24 states have (on average 3.375) internal successors, (81), 23 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:30,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:30,390 INFO L93 Difference]: Finished difference Result 4198 states and 12923 transitions. [2022-03-15 21:40:30,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 21:40:30,391 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.375) internal successors, (81), 23 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:40:30,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:30,397 INFO L225 Difference]: With dead ends: 4198 [2022-03-15 21:40:30,398 INFO L226 Difference]: Without dead ends: 4198 [2022-03-15 21:40:30,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 98 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=736, Invalid=3170, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 21:40:30,398 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 267 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:30,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 21 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:40:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4198 states. [2022-03-15 21:40:30,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4198 to 2145. [2022-03-15 21:40:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 2144 states have (on average 3.2686567164179103) internal successors, (7008), 2144 states have internal predecessors, (7008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:30,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 7008 transitions. [2022-03-15 21:40:30,445 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 7008 transitions. Word has length 27 [2022-03-15 21:40:30,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:30,445 INFO L470 AbstractCegarLoop]: Abstraction has 2145 states and 7008 transitions. [2022-03-15 21:40:30,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.375) internal successors, (81), 23 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:30,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 7008 transitions. [2022-03-15 21:40:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 21:40:30,449 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:30,449 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:30,472 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 21:40:30,663 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,SelfDestructingSolverStorable41 [2022-03-15 21:40:30,663 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:40:30,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:30,664 INFO L85 PathProgramCache]: Analyzing trace with hash 65178125, now seen corresponding path program 36 times [2022-03-15 21:40:30,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:30,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95601066] [2022-03-15 21:40:30,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:30,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:30,722 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 21:40:30,722 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:30,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95601066] [2022-03-15 21:40:30,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95601066] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:30,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953507649] [2022-03-15 21:40:30,722 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:40:30,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:30,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:30,724 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:40:30,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 21:40:30,771 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:40:30,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:30,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 21:40:30,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:30,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 21:40:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:40:30,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:30,977 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:40:30,978 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-03-15 21:40:31,131 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:40:31,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2022-03-15 21:40:31,176 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:40:31,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953507649] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:31,176 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:31,176 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 21 [2022-03-15 21:40:31,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [308672629] [2022-03-15 21:40:31,177 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:31,180 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:31,193 INFO L252 McrAutomatonBuilder]: Finished intersection with 95 states and 178 transitions. [2022-03-15 21:40:31,193 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:31,810 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [208434#(not f), 208435#(or g (not f)), 208433#(or (not f) (= q2_back q2_front))] [2022-03-15 21:40:31,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 21:40:31,810 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:31,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 21:40:31,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2022-03-15 21:40:31,811 INFO L87 Difference]: Start difference. First operand 2145 states and 7008 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:32,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:32,048 INFO L93 Difference]: Finished difference Result 4124 states and 13180 transitions. [2022-03-15 21:40:32,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 21:40:32,048 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 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:40:32,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:32,055 INFO L225 Difference]: With dead ends: 4124 [2022-03-15 21:40:32,055 INFO L226 Difference]: Without dead ends: 4093 [2022-03-15 21:40:32,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 72 SyntacticMatches, 34 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=1159, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 21:40:32,055 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 85 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:32,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 12 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:40:32,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4093 states. [2022-03-15 21:40:32,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4093 to 2314. [2022-03-15 21:40:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2314 states, 2313 states have (on average 3.2520536100302637) internal successors, (7522), 2313 states have internal predecessors, (7522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:32,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 7522 transitions. [2022-03-15 21:40:32,109 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 7522 transitions. Word has length 28 [2022-03-15 21:40:32,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:32,109 INFO L470 AbstractCegarLoop]: Abstraction has 2314 states and 7522 transitions. [2022-03-15 21:40:32,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:32,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 7522 transitions. [2022-03-15 21:40:32,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 21:40:32,112 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:32,113 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:32,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 21:40:32,313 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,SelfDestructingSolverStorable42 [2022-03-15 21:40:32,313 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:40:32,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:32,314 INFO L85 PathProgramCache]: Analyzing trace with hash 758168893, now seen corresponding path program 37 times [2022-03-15 21:40:32,315 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:32,315 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198240449] [2022-03-15 21:40:32,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:32,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:32,367 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-15 21:40:32,367 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:32,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198240449] [2022-03-15 21:40:32,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198240449] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:32,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459124677] [2022-03-15 21:40:32,368 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:40:32,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:32,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:32,369 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:40:32,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 21:40:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:32,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 21:40:32,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-15 21:40:32,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:32,516 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:40:32,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 14 treesize of output 13 [2022-03-15 21:40:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-15 21:40:32,557 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459124677] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:32,557 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:32,557 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-03-15 21:40:32,557 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2023949210] [2022-03-15 21:40:32,557 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:32,559 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:32,572 INFO L252 McrAutomatonBuilder]: Finished intersection with 95 states and 178 transitions. [2022-03-15 21:40:32,572 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:33,218 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [217383#(or (not f) (= q2_back q2_front)), 217385#(or g (not f)), 217386#(or (not (= (select q2 q2_front) 0)) (not f)), 217384#(not f)] [2022-03-15 21:40:33,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 21:40:33,218 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:33,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 21:40:33,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-03-15 21:40:33,219 INFO L87 Difference]: Start difference. First operand 2314 states and 7522 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:33,571 INFO L93 Difference]: Finished difference Result 3500 states and 11162 transitions. [2022-03-15 21:40:33,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 21:40:33,571 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 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:40:33,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:33,577 INFO L225 Difference]: With dead ends: 3500 [2022-03-15 21:40:33,577 INFO L226 Difference]: Without dead ends: 3469 [2022-03-15 21:40:33,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 82 SyntacticMatches, 36 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=734, Unknown=0, NotChecked=0, Total=930 [2022-03-15 21:40:33,577 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 115 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:33,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 15 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:40:33,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3469 states. [2022-03-15 21:40:33,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3469 to 2357. [2022-03-15 21:40:33,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 2356 states have (on average 3.2635823429541597) internal successors, (7689), 2356 states have internal predecessors, (7689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:33,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 7689 transitions. [2022-03-15 21:40:33,622 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 7689 transitions. Word has length 28 [2022-03-15 21:40:33,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:33,622 INFO L470 AbstractCegarLoop]: Abstraction has 2357 states and 7689 transitions. [2022-03-15 21:40:33,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:33,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 7689 transitions. [2022-03-15 21:40:33,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 21:40:33,627 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:33,627 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:33,651 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 21:40:33,849 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,SelfDestructingSolverStorable43 [2022-03-15 21:40:33,849 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:40:33,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:33,850 INFO L85 PathProgramCache]: Analyzing trace with hash -954644259, now seen corresponding path program 38 times [2022-03-15 21:40:33,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:33,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682172212] [2022-03-15 21:40:33,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:33,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:33,909 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 21:40:33,910 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:33,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682172212] [2022-03-15 21:40:33,910 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682172212] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:33,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787514722] [2022-03-15 21:40:33,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:40:33,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:33,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:33,911 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:40:33,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 21:40:33,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:40:33,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:33,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 21:40:33,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:34,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-03-15 21:40:34,158 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:40:34,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:34,174 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:40:34,175 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-03-15 21:40:34,292 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:40:34,292 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2022-03-15 21:40:34,338 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:40:34,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787514722] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:34,338 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:34,338 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 24 [2022-03-15 21:40:34,338 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1741708018] [2022-03-15 21:40:34,338 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:34,340 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:34,353 INFO L252 McrAutomatonBuilder]: Finished intersection with 98 states and 186 transitions. [2022-03-15 21:40:34,353 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:34,997 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [225826#(or (not f) (= q2_back q2_front)), 225825#(or g (not f)), 225824#(not f), 225827#(and (or (<= (+ q2_front 1) q2_back) (not f)) (or (not f) (<= q2_back (+ q2_front 1))))] [2022-03-15 21:40:34,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 21:40:34,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:34,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 21:40:34,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2022-03-15 21:40:34,997 INFO L87 Difference]: Start difference. First operand 2357 states and 7689 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:35,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:35,409 INFO L93 Difference]: Finished difference Result 5268 states and 16869 transitions. [2022-03-15 21:40:35,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 21:40:35,409 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 21:40:35,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:35,418 INFO L225 Difference]: With dead ends: 5268 [2022-03-15 21:40:35,418 INFO L226 Difference]: Without dead ends: 5237 [2022-03-15 21:40:35,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 77 SyntacticMatches, 28 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=290, Invalid=2160, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 21:40:35,418 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 161 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:35,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 18 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:40:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5237 states. [2022-03-15 21:40:35,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5237 to 3177. [2022-03-15 21:40:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3177 states, 3176 states have (on average 3.440491183879093) internal successors, (10927), 3176 states have internal predecessors, (10927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 3177 states and 10927 transitions. [2022-03-15 21:40:35,471 INFO L78 Accepts]: Start accepts. Automaton has 3177 states and 10927 transitions. Word has length 28 [2022-03-15 21:40:35,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:35,471 INFO L470 AbstractCegarLoop]: Abstraction has 3177 states and 10927 transitions. [2022-03-15 21:40:35,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:35,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 10927 transitions. [2022-03-15 21:40:35,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 21:40:35,475 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:35,475 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:35,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-03-15 21:40:35,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:35,676 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:40:35,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:35,677 INFO L85 PathProgramCache]: Analyzing trace with hash -261653491, now seen corresponding path program 39 times [2022-03-15 21:40:35,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:35,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705362128] [2022-03-15 21:40:35,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:35,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 21:40:35,738 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:35,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705362128] [2022-03-15 21:40:35,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705362128] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:35,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557828383] [2022-03-15 21:40:35,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:40:35,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:35,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:35,740 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:40:35,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 21:40:35,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:40:35,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:35,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:40:35,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:35,914 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 21:40:36,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 21:40:36,023 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:40:36,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:36,050 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:40:36,050 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 14 treesize of output 18 [2022-03-15 21:40:36,122 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:40:36,122 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 18 treesize of output 22 [2022-03-15 21:40:36,177 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:40:36,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557828383] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:36,177 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:36,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 18 [2022-03-15 21:40:36,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1300911156] [2022-03-15 21:40:36,177 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:36,179 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:36,192 INFO L252 McrAutomatonBuilder]: Finished intersection with 98 states and 186 transitions. [2022-03-15 21:40:36,192 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:36,893 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [237676#(or (not (= (select q2 q2_front) 0)) (not f)), 237675#(or g (not f)), 237673#(and (or (<= (+ q2_front 1) q2_back) (not f)) (or (not f) (<= q2_back (+ q2_front 1)))), 237674#(not f)] [2022-03-15 21:40:36,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 21:40:36,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:36,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 21:40:36,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:40:36,894 INFO L87 Difference]: Start difference. First operand 3177 states and 10927 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 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 21:40:37,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:37,313 INFO L93 Difference]: Finished difference Result 4804 states and 15456 transitions. [2022-03-15 21:40:37,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 21:40:37,314 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 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 28 [2022-03-15 21:40:37,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:37,322 INFO L225 Difference]: With dead ends: 4804 [2022-03-15 21:40:37,322 INFO L226 Difference]: Without dead ends: 4773 [2022-03-15 21:40:37,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 81 SyntacticMatches, 30 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=251, Invalid=1555, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 21:40:37,322 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 184 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:37,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 15 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:40:37,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4773 states. [2022-03-15 21:40:37,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4773 to 2201. [2022-03-15 21:40:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2201 states, 2200 states have (on average 3.2904545454545455) internal successors, (7239), 2200 states have internal predecessors, (7239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2201 states to 2201 states and 7239 transitions. [2022-03-15 21:40:37,368 INFO L78 Accepts]: Start accepts. Automaton has 2201 states and 7239 transitions. Word has length 28 [2022-03-15 21:40:37,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:37,369 INFO L470 AbstractCegarLoop]: Abstraction has 2201 states and 7239 transitions. [2022-03-15 21:40:37,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 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 21:40:37,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2201 states and 7239 transitions. [2022-03-15 21:40:37,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 21:40:37,372 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:37,372 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:37,387 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 21:40:37,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:37,573 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:40:37,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:37,573 INFO L85 PathProgramCache]: Analyzing trace with hash -253776163, now seen corresponding path program 40 times [2022-03-15 21:40:37,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:37,579 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095592419] [2022-03-15 21:40:37,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:37,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:37,650 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:40:37,650 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:37,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095592419] [2022-03-15 21:40:37,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095592419] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:37,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76964973] [2022-03-15 21:40:37,650 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:40:37,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:37,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:37,652 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:40:37,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 21:40:37,698 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:40:37,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:37,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 21:40:37,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:40:37,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:37,831 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:40:37,831 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 14 treesize of output 13 [2022-03-15 21:40:37,868 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:40:37,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76964973] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:37,868 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:37,869 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2022-03-15 21:40:37,869 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1455190580] [2022-03-15 21:40:37,869 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:37,871 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:37,884 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 200 transitions. [2022-03-15 21:40:37,884 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:38,570 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [247097#(or g (not f)), 247099#(or (not (= 0 (select q2 (+ q2_front 1)))) (not f)), 247096#(not f), 247098#(or (not (= (select q2 q2_front) 0)) (not f))] [2022-03-15 21:40:38,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 21:40:38,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:38,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 21:40:38,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-03-15 21:40:38,570 INFO L87 Difference]: Start difference. First operand 2201 states and 7239 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 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:40:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:39,123 INFO L93 Difference]: Finished difference Result 2773 states and 8905 transitions. [2022-03-15 21:40:39,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 21:40:39,123 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 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:40:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:39,128 INFO L225 Difference]: With dead ends: 2773 [2022-03-15 21:40:39,128 INFO L226 Difference]: Without dead ends: 2742 [2022-03-15 21:40:39,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 97 SyntacticMatches, 28 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=1329, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 21:40:39,128 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 166 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:39,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 21 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:40:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2022-03-15 21:40:39,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2534. [2022-03-15 21:40:39,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2534 states, 2533 states have (on average 3.299249901302803) internal successors, (8357), 2533 states have internal predecessors, (8357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 8357 transitions. [2022-03-15 21:40:39,162 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 8357 transitions. Word has length 28 [2022-03-15 21:40:39,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:39,162 INFO L470 AbstractCegarLoop]: Abstraction has 2534 states and 8357 transitions. [2022-03-15 21:40:39,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 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:40:39,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 8357 transitions. [2022-03-15 21:40:39,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 21:40:39,165 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:39,166 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:39,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-03-15 21:40:39,366 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,SelfDestructingSolverStorable46 [2022-03-15 21:40:39,366 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:40:39,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:39,366 INFO L85 PathProgramCache]: Analyzing trace with hash 313457758, now seen corresponding path program 41 times [2022-03-15 21:40:39,367 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:39,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060616524] [2022-03-15 21:40:39,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:39,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:39,396 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:40:39,396 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:39,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060616524] [2022-03-15 21:40:39,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060616524] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:39,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035635916] [2022-03-15 21:40:39,397 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:40:39,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:39,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:39,398 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:40:39,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 21:40:39,432 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 21:40:39,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:39,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:40:39,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:40:39,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:39,529 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:40:39,530 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035635916] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:39,530 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:39,530 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-03-15 21:40:39,530 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1577216790] [2022-03-15 21:40:39,530 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:39,532 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:39,544 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 173 transitions. [2022-03-15 21:40:39,544 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:39,894 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:40:39,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 21:40:39,895 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:39,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 21:40:39,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-03-15 21:40:39,895 INFO L87 Difference]: Start difference. First operand 2534 states and 8357 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 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:40:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:39,966 INFO L93 Difference]: Finished difference Result 4779 states and 15294 transitions. [2022-03-15 21:40:39,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:40:39,966 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 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 28 [2022-03-15 21:40:39,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:39,975 INFO L225 Difference]: With dead ends: 4779 [2022-03-15 21:40:39,975 INFO L226 Difference]: Without dead ends: 4714 [2022-03-15 21:40:39,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 112 SyntacticMatches, 9 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-03-15 21:40:39,975 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 59 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:39,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 2 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:40:39,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4714 states. [2022-03-15 21:40:40,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4714 to 3276. [2022-03-15 21:40:40,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3276 states, 3275 states have (on average 3.282442748091603) internal successors, (10750), 3275 states have internal predecessors, (10750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:40,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 10750 transitions. [2022-03-15 21:40:40,050 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 10750 transitions. Word has length 28 [2022-03-15 21:40:40,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:40,050 INFO L470 AbstractCegarLoop]: Abstraction has 3276 states and 10750 transitions. [2022-03-15 21:40:40,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 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:40:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 10750 transitions. [2022-03-15 21:40:40,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 21:40:40,055 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:40,055 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:40,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-03-15 21:40:40,255 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,SelfDestructingSolverStorable47 [2022-03-15 21:40:40,255 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:40:40,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:40,256 INFO L85 PathProgramCache]: Analyzing trace with hash -464492001, now seen corresponding path program 42 times [2022-03-15 21:40:40,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:40,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952669797] [2022-03-15 21:40:40,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:40,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:40,770 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:40,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952669797] [2022-03-15 21:40:40,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952669797] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:40,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61045778] [2022-03-15 21:40:40,770 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:40:40,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:40,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:40,771 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:40:40,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-15 21:40:40,807 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:40:40,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:40,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 75 conjunts are in the unsatisfiable core [2022-03-15 21:40:40,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:41,307 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:40:41,307 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 47 treesize of output 27 [2022-03-15 21:40:41,464 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:40:41,464 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 43 treesize of output 23 [2022-03-15 21:40:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:41,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:42,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:40:42,009 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:40:42,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:40:42,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:40:42,013 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:40:42,013 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:40:42,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:40:42,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:40:42,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:40:42,033 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:40:42,033 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 106 [2022-03-15 21:40:42,815 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:40:42,815 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 129 treesize of output 167 [2022-03-15 21:40:43,243 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:43,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61045778] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:43,244 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:43,244 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 52 [2022-03-15 21:40:43,244 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1523347552] [2022-03-15 21:40:43,244 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:43,246 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:43,277 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 178 transitions. [2022-03-15 21:40:43,277 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:48,216 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [266720#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (= (select q1 (+ q1_front 1)) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N 3)), 266729#(and (<= 2 i) (= (select q1 q1_front) 1) (<= i 2) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (= j 1) (= q2_back q2_front)), 266724#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= N 3)) (or (<= 3 N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 266733#(and (<= i 1) (<= q1_back q1_front) (<= q1_front q1_back) (= j 1) (<= 1 i) (= q2_back q2_front)), 266718#(and (or (<= N (+ t 1)) (not f) (<= q1_back q1_front)) (or (not f) (<= q1_back q1_front) (= q2_back q2_front)) (or (not f) (<= q1_back q1_front) (<= (+ t 1) N)) (or (= (select q1 q1_front) 1) (not f) (<= q1_back q1_front))), 266723#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ 3 t)) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ 3 t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 266730#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (< q1_front (+ q1_back 3))) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (<= N (+ 2 t)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (< q1_front (+ q1_back 3))) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (< q1_front (+ q1_back 3))) (<= (+ 2 t) N) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (< q1_front (+ q1_back 3))) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (< q1_front (+ q1_back 3))) (<= q2_front q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= q2_back q2_front) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (< q1_front (+ q1_back 3))) (not (= (select q1 (+ q1_back 2)) 0)))), 266735#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 266727#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ 3 t) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ 3 t)) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)))), 266736#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 266732#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (<= 3 N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0)) (<= N 3))), 266719#(and (<= 3 N) (= (select q1 q1_front) 1) (= (+ (- 1) j) 0) (= (select q2 q2_front) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N 3)), 266731#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= N (+ 3 t)) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 3 t) N) (not (= (select q1 (+ q1_back 2)) 0)))), 266734#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 266725#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) 1) (= j 1) (= q2_back q2_front) (<= i 3)), 266716#(and (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= t N)) (or (<= N t) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 266726#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< q1_front (+ q1_back 2))) (not (< i N)) (not f) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= N (+ 2 t)) (< (+ i 1) N) (not (< q1_front (+ q1_back 2))) (not (< i N)) (not f) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< q1_front (+ q1_back 2))) (not (< i N)) (<= q2_back q2_front) (not f) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< q1_front (+ q1_back 2))) (not (< i N)) (not f) (<= q2_front q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< q1_front (+ q1_back 2))) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not f) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< q1_front (+ q1_back 2))) (not (< i N)) (not f) (<= (+ 2 t) N) (not (= (select q1 (+ q1_back 1)) 0)))), 266728#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)) (<= N 3)) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= 3 N) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0)))), 266717#(and (or (<= q2_back q2_front) (not f) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not f) (not (< q1_front q1_back))) (or (not f) (<= (+ 2 t) N) (not (< q1_front q1_back))) (or (not f) (<= q2_front q2_back) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) 1) (not f) (not (< q1_front q1_back))) (or (<= N (+ 2 t)) (not f) (not (< q1_front q1_back)))), 266721#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) 1) (= j 1) (<= N 3) (= q2_back q2_front)), 266715#(and (or f g (<= t N)) (or (<= N t) f g)), 266722#(and (or (not f) (<= (+ 2 t) N) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front (+ q1_back 1)))) (or (not f) (not (= (select q1 q1_back) 0)) (< i N) (<= q2_front q2_back) (not (< q1_front (+ q1_back 1)))) (or (= (select q1 (+ q1_front 1)) 1) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ 2 t)) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front (+ q1_back 1)))) (or (<= q2_back q2_front) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front (+ q1_back 1)))) (or (= (select q1 q1_front) 1) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front (+ q1_back 1)))))] [2022-03-15 21:40:48,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 21:40:48,217 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:48,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 21:40:48,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=5255, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 21:40:48,218 INFO L87 Difference]: Start difference. First operand 3276 states and 10750 transitions. Second operand has 44 states, 43 states have (on average 2.6744186046511627) internal successors, (115), 43 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:21,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:21,155 INFO L93 Difference]: Finished difference Result 10445 states and 30342 transitions. [2022-03-15 21:41:21,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2022-03-15 21:41:21,157 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.6744186046511627) internal successors, (115), 43 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 21:41:21,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:21,174 INFO L225 Difference]: With dead ends: 10445 [2022-03-15 21:41:21,174 INFO L226 Difference]: Without dead ends: 10379 [2022-03-15 21:41:21,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 56 SyntacticMatches, 13 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18794 ImplicationChecksByTransitivity, 33.0s TimeCoverageRelationStatistics Valid=4453, Invalid=49139, Unknown=0, NotChecked=0, Total=53592 [2022-03-15 21:41:21,176 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 481 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 5109 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 5109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:21,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [481 Valid, 32 Invalid, 5491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 5109 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 21:41:21,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10379 states. [2022-03-15 21:41:21,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10379 to 3302. [2022-03-15 21:41:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3302 states, 3301 states have (on average 3.273553468645865) internal successors, (10806), 3301 states have internal predecessors, (10806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 10806 transitions. [2022-03-15 21:41:21,258 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 10806 transitions. Word has length 29 [2022-03-15 21:41:21,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:21,258 INFO L470 AbstractCegarLoop]: Abstraction has 3302 states and 10806 transitions. [2022-03-15 21:41:21,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.6744186046511627) internal successors, (115), 43 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:21,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 10806 transitions. [2022-03-15 21:41:21,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 21:41:21,263 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:21,263 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:21,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-15 21:41:21,463 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,SelfDestructingSolverStorable48 [2022-03-15 21:41:21,464 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:41:21,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:21,464 INFO L85 PathProgramCache]: Analyzing trace with hash -456614673, now seen corresponding path program 43 times [2022-03-15 21:41:21,465 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:21,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857141201] [2022-03-15 21:41:21,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:21,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:21,980 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:21,980 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857141201] [2022-03-15 21:41:21,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857141201] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:21,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440382020] [2022-03-15 21:41:21,981 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:41:21,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:21,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:21,984 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:41:21,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-15 21:41:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:22,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-15 21:41:22,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:22,543 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-15 21:41:22,544 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 51 treesize of output 27 [2022-03-15 21:41:22,683 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:41:22,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 20 [2022-03-15 21:41:22,795 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:22,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:23,176 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:41:23,176 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 64 treesize of output 118 [2022-03-15 21:41:23,672 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:41:23,673 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 65 treesize of output 119 [2022-03-15 21:41:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:23,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440382020] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:23,828 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:23,828 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 47 [2022-03-15 21:41:23,828 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1953590814] [2022-03-15 21:41:23,829 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:23,831 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:23,845 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 178 transitions. [2022-03-15 21:41:23,845 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:28,805 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [284330#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) 1) (= j 1) (<= N 3) (= q2_back q2_front)), 284331#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) 1) (= j 1) (= q2_back q2_front) (<= i 3)), 284335#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 284323#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= N 3)) (or (<= 3 N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 284322#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ 3 t)) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ 3 t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 284336#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 284316#(and (or f g (<= t N)) (or (<= N t) f g)), 284319#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (= (select q1 (+ q1_front 1)) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N 3)), 284324#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< q1_front (+ q1_back 2))) (not (< i N)) (not f) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= N (+ 2 t)) (< (+ i 1) N) (not (< q1_front (+ q1_back 2))) (not (< i N)) (not f) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< q1_front (+ q1_back 2))) (not (< i N)) (<= q2_back q2_front) (not f) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< q1_front (+ q1_back 2))) (not (< i N)) (not f) (<= q2_front q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< q1_front (+ q1_back 2))) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not f) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< q1_front (+ q1_back 2))) (not (< i N)) (not f) (<= (+ 2 t) N) (not (= (select q1 (+ q1_back 1)) 0)))), 284332#(and (<= 2 i) (= (select q1 q1_front) 1) (<= i 2) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (= j 1) (= q2_back q2_front)), 284325#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ 3 t) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ 3 t)) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)))), 284328#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)) (<= N 3)) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= 3 N) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0)))), 284317#(and (or (<= N (+ t 1)) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))) (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= (+ t 1) N)) (or (= (select q2 q2_front) 1) (not f) (<= q1_back q1_front))), 284321#(and (or (not f) (<= (+ 2 t) N) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front (+ q1_back 1)))) (or (not f) (not (= (select q1 q1_back) 0)) (< i N) (<= q2_front q2_back) (not (< q1_front (+ q1_back 1)))) (or (= (select q1 (+ q1_front 1)) 1) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ 2 t)) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front (+ q1_back 1)))) (or (<= q2_back q2_front) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front (+ q1_back 1)))) (or (= (select q1 q1_front) 1) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front (+ q1_back 1))))), 284320#(and (or (<= q2_back q2_front) (not f) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not f) (not (< q1_front q1_back))) (or (not f) (<= (+ 2 t) N) (not (< q1_front q1_back))) (or (not f) (<= q2_front q2_back) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) 1) (not f) (not (< q1_front q1_back))) (or (<= N (+ 2 t)) (not f) (not (< q1_front q1_back)))), 284326#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (< q1_front (+ q1_back 3))) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (<= N (+ 2 t)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (< q1_front (+ q1_back 3))) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (< q1_front (+ q1_back 3))) (<= (+ 2 t) N) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (< q1_front (+ q1_back 3))) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (< q1_front (+ q1_back 3))) (<= q2_front q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= q2_back q2_front) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (< q1_front (+ q1_back 3))) (not (= (select q1 (+ q1_back 2)) 0)))), 284329#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (<= 3 N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0)) (<= N 3))), 284315#(and (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= t N)) (or (<= N t) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 284333#(and (<= i 1) (<= q1_back q1_front) (<= q1_front q1_back) (= j 1) (<= 1 i) (= q2_back q2_front)), 284334#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 284327#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= N (+ 3 t)) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 3 t) N) (not (= (select q1 (+ q1_back 2)) 0)))), 284318#(and (<= 3 N) (= (select q1 q1_front) 1) (= (+ (- 1) j) 0) (= (select q2 q2_front) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N 3))] [2022-03-15 21:41:28,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 21:41:28,806 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:28,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 21:41:28,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=4615, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 21:41:28,807 INFO L87 Difference]: Start difference. First operand 3302 states and 10806 transitions. Second operand has 44 states, 43 states have (on average 2.6744186046511627) internal successors, (115), 43 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:07,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:07,714 INFO L93 Difference]: Finished difference Result 10615 states and 30769 transitions. [2022-03-15 21:42:07,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2022-03-15 21:42:07,714 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.6744186046511627) internal successors, (115), 43 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 21:42:07,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:07,730 INFO L225 Difference]: With dead ends: 10615 [2022-03-15 21:42:07,730 INFO L226 Difference]: Without dead ends: 10585 [2022-03-15 21:42:07,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 58 SyntacticMatches, 16 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20405 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=4740, Invalid=53582, Unknown=0, NotChecked=0, Total=58322 [2022-03-15 21:42:07,732 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 454 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 5357 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 5763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 5357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:07,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [454 Valid, 45 Invalid, 5763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 5357 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-03-15 21:42:07,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10585 states. [2022-03-15 21:42:07,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10585 to 3310. [2022-03-15 21:42:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3310 states, 3309 states have (on average 3.2704744635841645) internal successors, (10822), 3309 states have internal predecessors, (10822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 3310 states and 10822 transitions. [2022-03-15 21:42:07,826 INFO L78 Accepts]: Start accepts. Automaton has 3310 states and 10822 transitions. Word has length 29 [2022-03-15 21:42:07,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:07,826 INFO L470 AbstractCegarLoop]: Abstraction has 3310 states and 10822 transitions. [2022-03-15 21:42:07,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.6744186046511627) internal successors, (115), 43 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:07,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3310 states and 10822 transitions. [2022-03-15 21:42:07,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 21:42:07,830 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:07,830 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:07,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-03-15 21:42:08,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:08,031 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:08,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:08,032 INFO L85 PathProgramCache]: Analyzing trace with hash 2117630333, now seen corresponding path program 44 times [2022-03-15 21:42:08,032 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:08,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832426694] [2022-03-15 21:42:08,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:08,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:08,482 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:08,482 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:08,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832426694] [2022-03-15 21:42:08,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832426694] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:08,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122904965] [2022-03-15 21:42:08,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:42:08,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:08,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:08,483 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:42:08,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-15 21:42:08,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:42:08,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:08,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-15 21:42:08,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:09,023 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-15 21:42:09,024 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 51 treesize of output 27 [2022-03-15 21:42:09,185 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-15 21:42:09,186 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 16 [2022-03-15 21:42:09,289 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:09,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:09,677 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:42:09,678 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 64 treesize of output 118 [2022-03-15 21:42:10,245 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:42:10,246 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 65 treesize of output 119 [2022-03-15 21:42:10,431 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:10,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122904965] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:10,431 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:10,431 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 47 [2022-03-15 21:42:10,431 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [263637111] [2022-03-15 21:42:10,431 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:10,433 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:10,447 INFO L252 McrAutomatonBuilder]: Finished intersection with 97 states and 180 transitions. [2022-03-15 21:42:10,447 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:15,490 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [302144#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)) (<= N 3)) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= 3 N) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0)))), 302145#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (<= 3 N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0)) (<= N 3))), 302151#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 302137#(and (or (not f) (<= (+ 2 t) N) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front (+ q1_back 1)))) (or (not f) (not (= (select q1 q1_back) 0)) (< i N) (<= q2_front q2_back) (not (< q1_front (+ q1_back 1)))) (or (= (select q1 (+ q1_front 1)) 1) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front (+ q1_back 1)))) (or (<= N (+ 2 t)) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front (+ q1_back 1)))) (or (<= q2_back q2_front) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front (+ q1_back 1)))) (or (= (select q1 q1_front) 1) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front (+ q1_back 1))))), 302149#(and (<= i 1) (<= q1_back q1_front) (<= q1_front q1_back) (= j 1) (<= 1 i) (= q2_back q2_front)), 302152#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 302135#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (= (select q1 (+ q1_front 1)) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N 3)), 302146#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) 1) (= j 1) (<= N 3) (= q2_back q2_front)), 302134#(and (<= 3 N) (= (select q1 q1_front) 1) (= (+ (- 1) j) 0) (= (select q2 q2_front) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N 3)), 302139#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= N 3)) (or (<= 3 N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 302142#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (< q1_front (+ q1_back 3))) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (<= N (+ 2 t)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (< q1_front (+ q1_back 3))) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (< q1_front (+ q1_back 3))) (<= (+ 2 t) N) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (< q1_front (+ q1_back 3))) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (< q1_front (+ q1_back 3))) (<= q2_front q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= q2_back q2_front) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (< q1_front (+ q1_back 3))) (not (= (select q1 (+ q1_back 2)) 0)))), 302133#(and (or (<= N (+ t 1)) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))) (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= (+ t 1) N)) (or (= (select q2 q2_front) 1) (not f) (<= q1_back q1_front))), 302132#(and (or (< t (+ N 1)) f g) (or (<= N t) f g)), 302131#(and (or (<= N t) f) (or f (<= t N))), 302143#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= N (+ 3 t)) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 3 t) N) (not (= (select q1 (+ q1_back 2)) 0)))), 302153#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1)))), 302147#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) 1) (= j 1) (= q2_back q2_front) (<= i 3)), 302150#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 302141#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ 3 t) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ 3 t)) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)))), 302138#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ 3 t)) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ 3 t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 302148#(and (<= 2 i) (= (select q1 q1_front) 1) (<= i 2) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (= j 1) (= q2_back q2_front)), 302136#(and (or (<= q2_back q2_front) (not f) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not f) (not (< q1_front q1_back))) (or (not f) (<= (+ 2 t) N) (not (< q1_front q1_back))) (or (not f) (<= q2_front q2_back) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) 1) (not f) (not (< q1_front q1_back))) (or (<= N (+ 2 t)) (not f) (not (< q1_front q1_back)))), 302140#(and (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< q1_front (+ q1_back 2))) (not (< i N)) (not f) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= N (+ 2 t)) (< (+ i 1) N) (not (< q1_front (+ q1_back 2))) (not (< i N)) (not f) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< q1_front (+ q1_back 2))) (not (< i N)) (<= q2_back q2_front) (not f) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< q1_front (+ q1_back 2))) (not (< i N)) (not f) (<= q2_front q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< q1_front (+ q1_back 2))) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not f) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< q1_front (+ q1_back 2))) (not (< i N)) (not f) (<= (+ 2 t) N) (not (= (select q1 (+ q1_back 1)) 0))))] [2022-03-15 21:42:15,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 21:42:15,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:15,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 21:42:15,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=4762, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 21:42:15,492 INFO L87 Difference]: Start difference. First operand 3310 states and 10822 transitions. Second operand has 45 states, 44 states have (on average 2.659090909090909) internal successors, (117), 44 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:52,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:52,212 INFO L93 Difference]: Finished difference Result 7663 states and 22163 transitions. [2022-03-15 21:42:52,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2022-03-15 21:42:52,213 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.659090909090909) internal successors, (117), 44 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 21:42:52,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:52,225 INFO L225 Difference]: With dead ends: 7663 [2022-03-15 21:42:52,225 INFO L226 Difference]: Without dead ends: 7563 [2022-03-15 21:42:52,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 61 SyntacticMatches, 13 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15115 ImplicationChecksByTransitivity, 36.2s TimeCoverageRelationStatistics Valid=3941, Invalid=42931, Unknown=0, NotChecked=0, Total=46872 [2022-03-15 21:42:52,227 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 476 mSDsluCounter, 2641 mSDsCounter, 0 mSdLazyCounter, 6322 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 6625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 6322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:52,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [476 Valid, 58 Invalid, 6625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 6322 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-03-15 21:42:52,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7563 states. [2022-03-15 21:42:52,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7563 to 3294. [2022-03-15 21:42:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3294 states, 3293 states have (on average 3.276343759489827) internal successors, (10789), 3293 states have internal predecessors, (10789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 10789 transitions. [2022-03-15 21:42:52,287 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 10789 transitions. Word has length 29 [2022-03-15 21:42:52,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:52,287 INFO L470 AbstractCegarLoop]: Abstraction has 3294 states and 10789 transitions. [2022-03-15 21:42:52,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.659090909090909) internal successors, (117), 44 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:52,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 10789 transitions. [2022-03-15 21:42:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 21:42:52,291 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:52,291 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:52,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-03-15 21:42:52,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:52,492 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:52,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:52,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2014214833, now seen corresponding path program 45 times [2022-03-15 21:42:52,493 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:52,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305151249] [2022-03-15 21:42:52,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:52,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:53,007 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:53,007 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305151249] [2022-03-15 21:42:53,007 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305151249] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:53,007 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255331121] [2022-03-15 21:42:53,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:42:53,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:53,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:53,009 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:42:53,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-15 21:42:53,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 21:42:53,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:53,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-15 21:42:53,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:53,491 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:42:53,491 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 45 treesize of output 25 [2022-03-15 21:42:53,679 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:42:53,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 20 [2022-03-15 21:42:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:53,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:54,190 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:42:54,191 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 64 treesize of output 118 [2022-03-15 21:42:54,793 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:42:54,793 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 65 treesize of output 119 [2022-03-15 21:42:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:55,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255331121] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:55,025 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:55,025 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 47 [2022-03-15 21:42:55,025 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [734656489] [2022-03-15 21:42:55,025 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:55,027 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:55,042 INFO L252 McrAutomatonBuilder]: Finished intersection with 99 states and 186 transitions. [2022-03-15 21:42:55,042 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:59,281 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [316916#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) 1) (= j 1) (<= N 3) (= q2_back q2_front)), 316925#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)) (<= N 3)) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= 3 N) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0)))), 316912#(and (<= q2_back (+ q2_front 2)) (<= N (+ 2 (select q2 (+ q2_front 1)))) (<= (+ q2_front 2) q2_back) (= (select q2 q2_front) 1) (= j 1) (<= (+ 2 (select q2 (+ q2_front 1))) N)), 316929#(and (<= 2 i) (= (select q1 q1_front) 1) (<= i 2) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (= j 1) (= q2_back q2_front)), 316921#(and (or f g (<= t N)) (or (<= N t) f g)), 316926#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= N (+ 3 t)) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 3 t) N) (not (= (select q1 (+ q1_back 2)) 0)))), 316917#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 316932#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 316927#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (<= 3 N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0)) (<= N 3))), 316913#(and (<= q2_back (+ q2_front 2)) (<= N (+ 2 (select q2 (+ q2_front 1)))) (= (select q1 q1_front) 1) (<= (+ q2_front 2) q2_back) (= (select q2 q2_front) 1) (<= (+ 2 (select q2 (+ q2_front 1))) N)), 316922#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ 3 t)) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ 3 t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 316923#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= N 3)) (or (<= 3 N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 316924#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ 3 t) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ 3 t)) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)))), 316931#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 316920#(and (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= t N)) (or (<= N t) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 316918#(and (or (<= N (+ t 1)) (not f) (<= q1_back q1_front)) (or (not f) (<= q1_back q1_front) (= q2_back q2_front)) (or (not f) (<= q1_back q1_front) (<= (+ t 1) N)) (or (= (select q1 q1_front) 1) (not f) (<= q1_back q1_front))), 316919#(and (or (not f) (<= q2_back (+ q2_front 1)) (<= q1_back q1_front)) (or (<= (+ (select q2 q2_front) t 1) N) (not f) (<= q1_back q1_front)) (or (not f) (<= N (+ (select q2 q2_front) t 1)) (<= q1_back q1_front)) (or (<= (+ q2_front 1) q2_back) (not f) (<= q1_back q1_front)) (or (= (select q1 q1_front) 1) (not f) (<= q1_back q1_front))), 316915#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (= (select q1 (+ q1_front 1)) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N 3)), 316928#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) 1) (= j 1) (= q2_back q2_front) (<= i 3)), 316930#(and (<= i 1) (<= q1_back q1_front) (<= q1_front q1_back) (= j 1) (<= 1 i) (= q2_back q2_front)), 316914#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (= j 1) (<= N 3))] [2022-03-15 21:42:59,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 21:42:59,281 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:59,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 21:42:59,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=4478, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 21:42:59,282 INFO L87 Difference]: Start difference. First operand 3294 states and 10789 transitions. Second operand has 43 states, 42 states have (on average 2.7857142857142856) internal successors, (117), 42 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:43:12,879 INFO L93 Difference]: Finished difference Result 8652 states and 25810 transitions. [2022-03-15 21:43:12,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-03-15 21:43:12,880 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.7857142857142856) internal successors, (117), 42 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 21:43:12,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:43:12,893 INFO L225 Difference]: With dead ends: 8652 [2022-03-15 21:43:12,894 INFO L226 Difference]: Without dead ends: 8615 [2022-03-15 21:43:12,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 64 SyntacticMatches, 14 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9391 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=2378, Invalid=27378, Unknown=0, NotChecked=0, Total=29756 [2022-03-15 21:43:12,895 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 288 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 4958 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 5225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 4958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:43:12,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 53 Invalid, 5225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 4958 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 21:43:12,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8615 states. [2022-03-15 21:43:12,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8615 to 3308. [2022-03-15 21:43:12,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3308 states, 3307 states have (on average 3.2715452071363775) internal successors, (10819), 3307 states have internal predecessors, (10819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:12,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 10819 transitions. [2022-03-15 21:43:12,992 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 10819 transitions. Word has length 29 [2022-03-15 21:43:12,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:43:12,992 INFO L470 AbstractCegarLoop]: Abstraction has 3308 states and 10819 transitions. [2022-03-15 21:43:12,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.7857142857142856) internal successors, (117), 42 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:12,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 10819 transitions. [2022-03-15 21:43:12,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 21:43:12,997 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:43:12,997 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:43:13,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-03-15 21:43:13,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:13,198 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:43:13,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:43:13,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2006337505, now seen corresponding path program 46 times [2022-03-15 21:43:13,199 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:43:13,199 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99931370] [2022-03-15 21:43:13,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:43:13,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:43:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:43:13,650 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:13,650 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:43:13,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99931370] [2022-03-15 21:43:13,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99931370] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:43:13,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481994931] [2022-03-15 21:43:13,650 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:43:13,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:13,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:43:13,651 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:43:13,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-15 21:43:13,699 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:43:13,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:43:13,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-15 21:43:13,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:43:14,154 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-15 21:43:14,154 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 49 treesize of output 25 [2022-03-15 21:43:14,335 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:43:14,336 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 20 [2022-03-15 21:43:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:14,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:43:14,825 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:43:14,825 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 64 treesize of output 118 [2022-03-15 21:43:15,331 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:43:15,332 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 65 treesize of output 119 [2022-03-15 21:43:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:15,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481994931] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:43:15,524 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:43:15,524 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 47 [2022-03-15 21:43:15,525 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [114132486] [2022-03-15 21:43:15,525 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:43:15,527 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:43:15,541 INFO L252 McrAutomatonBuilder]: Finished intersection with 99 states and 186 transitions. [2022-03-15 21:43:15,541 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:43:19,729 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [332630#(and (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= t N)) (or (<= N t) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 332627#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (= j 1) (<= N 3)), 332634#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= N 3)) (or (<= 3 N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 332631#(and (or (<= N (+ t 1)) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))) (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= (+ t 1) N)) (or (= (select q2 q2_front) 1) (not f) (<= q1_back q1_front))), 332643#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 332633#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ 3 t)) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ 3 t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 332628#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (= (select q1 (+ q1_front 1)) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N 3)), 332637#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)) (<= N 3)) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= 3 N) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0)))), 332626#(and (<= q2_back (+ q2_front 2)) (<= N (+ 2 (select q2 (+ q2_front 1)))) (= (select q1 q1_front) 1) (<= (+ q2_front 2) q2_back) (= (select q2 q2_front) 1) (<= (+ 2 (select q2 (+ q2_front 1))) N)), 332642#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 332638#(and (<= 2 i) (= (select q1 q1_front) 1) (<= i 2) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (= j 1) (= q2_back q2_front)), 332625#(and (<= q2_back (+ q2_front 2)) (<= N (+ 2 (select q2 (+ q2_front 1)))) (<= (+ q2_front 2) q2_back) (= (select q2 q2_front) 1) (= j 1) (<= (+ 2 (select q2 (+ q2_front 1))) N)), 332624#(and (or f g (<= t N)) (or (<= N t) f g)), 332635#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) 1) (= j 1) (= q2_back q2_front) (<= i 3)), 332636#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ 3 t) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ 3 t)) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)))), 332629#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) 1) (= j 1) (<= N 3) (= q2_back q2_front)), 332641#(and (<= i 1) (<= q1_back q1_front) (<= q1_front q1_back) (= j 1) (<= 1 i) (= q2_back q2_front)), 332632#(and (or (not f) (<= q2_back (+ q2_front 1)) (<= q1_back q1_front)) (or (<= (+ (select q2 q2_front) t 1) N) (not f) (<= q1_back q1_front)) (or (not f) (<= N (+ (select q2 q2_front) t 1)) (<= q1_back q1_front)) (or (<= (+ q2_front 1) q2_back) (not f) (<= q1_back q1_front)) (or (= (select q1 q1_front) 1) (not f) (<= q1_back q1_front))), 332639#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= N (+ 3 t)) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 3 t) N) (not (= (select q1 (+ q1_back 2)) 0)))), 332640#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (<= 3 N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0)) (<= N 3))), 332644#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0))))] [2022-03-15 21:43:19,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 21:43:19,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:43:19,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 21:43:19,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=4473, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 21:43:19,730 INFO L87 Difference]: Start difference. First operand 3308 states and 10819 transitions. Second operand has 43 states, 42 states have (on average 2.7857142857142856) internal successors, (117), 42 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:34,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:43:34,217 INFO L93 Difference]: Finished difference Result 8832 states and 26244 transitions. [2022-03-15 21:43:34,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-03-15 21:43:34,217 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.7857142857142856) internal successors, (117), 42 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 21:43:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:43:34,232 INFO L225 Difference]: With dead ends: 8832 [2022-03-15 21:43:34,232 INFO L226 Difference]: Without dead ends: 8808 [2022-03-15 21:43:34,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 63 SyntacticMatches, 15 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10769 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=2792, Invalid=30514, Unknown=0, NotChecked=0, Total=33306 [2022-03-15 21:43:34,233 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 282 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 3718 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 3956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 3718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:43:34,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 32 Invalid, 3956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 3718 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 21:43:34,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8808 states. [2022-03-15 21:43:34,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8808 to 3316. [2022-03-15 21:43:34,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3316 states, 3315 states have (on average 3.268476621417798) internal successors, (10835), 3315 states have internal predecessors, (10835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:34,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 10835 transitions. [2022-03-15 21:43:34,305 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 10835 transitions. Word has length 29 [2022-03-15 21:43:34,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:43:34,305 INFO L470 AbstractCegarLoop]: Abstraction has 3316 states and 10835 transitions. [2022-03-15 21:43:34,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.7857142857142856) internal successors, (117), 42 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:34,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 10835 transitions. [2022-03-15 21:43:34,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 21:43:34,308 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:43:34,308 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:43:34,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-15 21:43:34,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-03-15 21:43:34,510 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:43:34,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:43:34,510 INFO L85 PathProgramCache]: Analyzing trace with hash 567907501, now seen corresponding path program 47 times [2022-03-15 21:43:34,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:43:34,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931778889] [2022-03-15 21:43:34,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:43:34,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:43:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:43:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:34,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:43:34,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931778889] [2022-03-15 21:43:34,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931778889] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:43:34,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290322152] [2022-03-15 21:43:34,988 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:43:34,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:34,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:43:34,989 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:43:34,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-03-15 21:43:35,027 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:43:35,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:43:35,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 66 conjunts are in the unsatisfiable core [2022-03-15 21:43:35,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:43:35,490 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:43:35,490 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 47 treesize of output 27 [2022-03-15 21:43:35,690 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:43:35,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 20 [2022-03-15 21:43:35,792 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:35,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:43:36,172 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:43:36,173 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 64 treesize of output 118 [2022-03-15 21:43:36,781 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:43:36,781 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 65 treesize of output 119 [2022-03-15 21:43:37,007 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:37,007 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290322152] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:43:37,007 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:43:37,007 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 47 [2022-03-15 21:43:37,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1667022424] [2022-03-15 21:43:37,008 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:43:37,010 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:43:37,046 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 188 transitions. [2022-03-15 21:43:37,046 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:43:41,320 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [348568#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (<= 3 N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0)) (<= N 3))), 348565#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)) (<= N 3)) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= 3 N) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0)))), 348570#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 348556#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) 1) (= j 1) (<= N 3) (= q2_back q2_front)), 348555#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (= (select q1 (+ q1_front 1)) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N 3)), 348561#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ 3 t)) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ 3 t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 348567#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= N (+ 3 t)) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 3 t) N) (not (= (select q1 (+ q1_back 2)) 0)))), 348573#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1)))), 348559#(and (or (<= N (+ t 1)) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))) (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= (+ t 1) N)) (or (= (select q2 q2_front) 1) (not f) (<= q1_back q1_front))), 348554#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (= j 1) (<= N 3)), 348562#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= N 3)) (or (<= 3 N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 348563#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) 1) (= j 1) (= q2_back q2_front) (<= i 3)), 348566#(and (<= 2 i) (= (select q1 q1_front) 1) (<= i 2) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (= j 1) (= q2_back q2_front)), 348558#(and (or (< t (+ N 1)) f g) (or (<= N t) f g)), 348553#(and (<= q2_back (+ q2_front 2)) (<= N (+ 2 (select q2 (+ q2_front 1)))) (= (select q1 q1_front) 1) (<= (+ q2_front 2) q2_back) (= (select q2 q2_front) 1) (<= (+ 2 (select q2 (+ q2_front 1))) N)), 348557#(and (or (<= N t) f) (or f (<= t N))), 348552#(and (<= q2_back (+ q2_front 2)) (<= N (+ 2 (select q2 (+ q2_front 1)))) (<= (+ q2_front 2) q2_back) (= (select q2 q2_front) 1) (= j 1) (<= (+ 2 (select q2 (+ q2_front 1))) N)), 348572#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 348560#(and (or (not f) (<= q2_back (+ q2_front 1)) (<= q1_back q1_front)) (or (<= (+ (select q2 q2_front) t 1) N) (not f) (<= q1_back q1_front)) (or (not f) (<= N (+ (select q2 q2_front) t 1)) (<= q1_back q1_front)) (or (<= (+ q2_front 1) q2_back) (not f) (<= q1_back q1_front)) (or (= (select q1 q1_front) 1) (not f) (<= q1_back q1_front))), 348564#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ 3 t) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ 3 t)) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)))), 348571#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 348569#(and (<= i 1) (<= q1_back q1_front) (<= q1_front q1_back) (= j 1) (<= 1 i) (= q2_back q2_front))] [2022-03-15 21:43:41,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 21:43:41,321 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:43:41,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 21:43:41,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=4620, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 21:43:41,321 INFO L87 Difference]: Start difference. First operand 3316 states and 10835 transitions. Second operand has 44 states, 43 states have (on average 2.7674418604651163) internal successors, (119), 43 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:56,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:43:56,673 INFO L93 Difference]: Finished difference Result 6159 states and 18343 transitions. [2022-03-15 21:43:56,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-03-15 21:43:56,673 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.7674418604651163) internal successors, (119), 43 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 29 [2022-03-15 21:43:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:43:56,682 INFO L225 Difference]: With dead ends: 6159 [2022-03-15 21:43:56,682 INFO L226 Difference]: Without dead ends: 6103 [2022-03-15 21:43:56,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 66 SyntacticMatches, 12 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7702 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=2184, Invalid=23898, Unknown=0, NotChecked=0, Total=26082 [2022-03-15 21:43:56,683 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 315 mSDsluCounter, 2283 mSDsCounter, 0 mSdLazyCounter, 5192 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 5356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 5192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:43:56,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 55 Invalid, 5356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 5192 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 21:43:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6103 states. [2022-03-15 21:43:56,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6103 to 3304. [2022-03-15 21:43:56,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3304 states, 3303 states have (on average 3.2724795640326976) internal successors, (10809), 3303 states have internal predecessors, (10809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3304 states to 3304 states and 10809 transitions. [2022-03-15 21:43:56,733 INFO L78 Accepts]: Start accepts. Automaton has 3304 states and 10809 transitions. Word has length 29 [2022-03-15 21:43:56,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:43:56,733 INFO L470 AbstractCegarLoop]: Abstraction has 3304 states and 10809 transitions. [2022-03-15 21:43:56,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.7674418604651163) internal successors, (119), 43 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:56,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3304 states and 10809 transitions. [2022-03-15 21:43:56,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 21:43:56,737 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:43:56,737 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:43:56,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-03-15 21:43:56,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-03-15 21:43:56,937 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:43:56,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:43:56,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1762140337, now seen corresponding path program 48 times [2022-03-15 21:43:56,938 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:43:56,938 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606218105] [2022-03-15 21:43:56,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:43:56,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:43:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:43:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:57,463 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:43:57,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606218105] [2022-03-15 21:43:57,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606218105] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:43:57,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115744478] [2022-03-15 21:43:57,463 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:43:57,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:57,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:43:57,468 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:43:57,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-03-15 21:43:57,515 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:43:57,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:43:57,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-15 21:43:57,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:43:57,999 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:43:57,999 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 47 treesize of output 27 [2022-03-15 21:43:58,188 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-15 21:43:58,188 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 16 [2022-03-15 21:43:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:58,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:43:58,655 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:43:58,655 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 64 treesize of output 118 [2022-03-15 21:43:59,367 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:43:59,367 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 65 treesize of output 119 [2022-03-15 21:43:59,565 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:59,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115744478] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:43:59,566 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:43:59,566 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 47 [2022-03-15 21:43:59,566 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1050222584] [2022-03-15 21:43:59,566 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:43:59,568 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:43:59,583 INFO L252 McrAutomatonBuilder]: Finished intersection with 105 states and 200 transitions. [2022-03-15 21:43:59,583 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:04,019 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [361742#(and (or (<= N (+ t 1)) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))) (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= (+ t 1) N)) (or (= (select q2 q2_front) 1) (not f) (<= q1_back q1_front))), 361752#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ 3 t) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ 3 t)) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)))), 361747#(and (<= q2_back (+ q2_front 2)) (<= N (+ 2 (select q2 (+ q2_front 1)))) (<= (+ q2_front 2) q2_back) (= (select q2 q2_front) 1) (= j 1) (<= (+ 2 (select q2 (+ q2_front 1))) N)), 361740#(and (or f g (<= t N)) (or (<= N t) f g)), 361744#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ 3 t)) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ 3 t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 361755#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) 1) (= j 1) (= q2_back q2_front) (<= i 3)), 361753#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)) (<= N 3)) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= 3 N) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0)))), 361759#(and (<= i 1) (<= q1_back q1_front) (<= q1_front q1_back) (= j 1) (<= 1 i) (= q2_back q2_front)), 361743#(and (or (not f) (= 1 (select q2 (+ q2_front 1))) (<= q1_back q1_front)) (or (not f) (<= N (+ (select q2 q2_front) t 1)) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))) (or (<= (+ (select q2 q2_front) t 1) N) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 361761#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 361756#(and (<= 2 i) (= (select q1 q1_front) 1) (<= i 2) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (= j 1) (= q2_back q2_front)), 361745#(and (or (<= (+ 2 (select q2 (+ q2_front 1))) N) (not (= j 0))) (or (<= N (+ 2 (select q2 (+ q2_front 1)))) (not (= j 0))) (or (= (select q2 q2_front) 1) (not (= j 0))) (= (select q2 (+ q2_front 2)) 1)), 361749#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (= j 1) (<= N 3)), 361758#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (<= 3 N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0)) (<= N 3))), 361748#(and (<= q2_back (+ q2_front 2)) (<= N (+ 2 (select q2 (+ q2_front 1)))) (= (select q1 q1_front) 1) (<= (+ q2_front 2) q2_back) (= (select q2 q2_front) 1) (<= (+ 2 (select q2 (+ q2_front 1))) N)), 361746#(and (<= N (+ 2 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 1) (<= (+ 2 (select q2 (+ q2_front 1))) N) (= (select q2 (+ q2_front 2)) 1)), 361760#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 361754#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) 1) (= j 1) (<= N 3) (= q2_back q2_front)), 361750#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (= (select q1 (+ q1_front 1)) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N 3)), 361757#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= N (+ 3 t)) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 3 t) N) (not (= (select q1 (+ q1_back 2)) 0)))), 361762#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 361741#(and (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= t N)) (or (<= N t) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 361751#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= N 3)) (or (<= 3 N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N)))] [2022-03-15 21:44:04,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 21:44:04,020 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:04,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 21:44:04,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=4740, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 21:44:04,020 INFO L87 Difference]: Start difference. First operand 3304 states and 10809 transitions. Second operand has 45 states, 44 states have (on average 2.840909090909091) internal successors, (125), 44 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:18,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:18,791 INFO L93 Difference]: Finished difference Result 8886 states and 26342 transitions. [2022-03-15 21:44:18,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2022-03-15 21:44:18,792 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.840909090909091) internal successors, (125), 44 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 29 [2022-03-15 21:44:18,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:18,806 INFO L225 Difference]: With dead ends: 8886 [2022-03-15 21:44:18,806 INFO L226 Difference]: Without dead ends: 8855 [2022-03-15 21:44:18,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 67 SyntacticMatches, 15 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11917 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=2980, Invalid=32930, Unknown=0, NotChecked=0, Total=35910 [2022-03-15 21:44:18,807 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 321 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 4694 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 4947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 4694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:18,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 45 Invalid, 4947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 4694 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 21:44:18,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8855 states. [2022-03-15 21:44:18,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8855 to 3322. [2022-03-15 21:44:18,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3322 states, 3321 states have (on average 3.2667871123155674) internal successors, (10849), 3321 states have internal predecessors, (10849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:18,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3322 states to 3322 states and 10849 transitions. [2022-03-15 21:44:18,875 INFO L78 Accepts]: Start accepts. Automaton has 3322 states and 10849 transitions. Word has length 29 [2022-03-15 21:44:18,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:18,875 INFO L470 AbstractCegarLoop]: Abstraction has 3322 states and 10849 transitions. [2022-03-15 21:44:18,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.840909090909091) internal successors, (125), 44 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:18,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3322 states and 10849 transitions. [2022-03-15 21:44:18,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 21:44:18,879 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:18,879 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:18,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-03-15 21:44:19,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:19,079 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:19,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:19,080 INFO L85 PathProgramCache]: Analyzing trace with hash 812104669, now seen corresponding path program 49 times [2022-03-15 21:44:19,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:19,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586562008] [2022-03-15 21:44:19,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:19,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:19,576 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:19,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586562008] [2022-03-15 21:44:19,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586562008] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:19,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287126390] [2022-03-15 21:44:19,577 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:44:19,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:19,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:19,578 INFO L229 MonitoredProcess]: Starting monitored process 53 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:44:19,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-03-15 21:44:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:19,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-15 21:44:19,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:20,053 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-15 21:44:20,054 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 49 treesize of output 25 [2022-03-15 21:44:20,250 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-15 21:44:20,251 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 20 [2022-03-15 21:44:20,354 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:20,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:20,733 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:44:20,733 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 64 treesize of output 118 [2022-03-15 21:44:21,500 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:44:21,501 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 65 treesize of output 119 [2022-03-15 21:44:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:21,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287126390] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:21,643 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:21,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 47 [2022-03-15 21:44:21,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [360458747] [2022-03-15 21:44:21,643 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:21,645 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:21,661 INFO L252 McrAutomatonBuilder]: Finished intersection with 106 states and 202 transitions. [2022-03-15 21:44:21,661 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:26,127 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [377767#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 377755#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (= j 1) (<= N 3)), 377754#(and (<= q2_back (+ q2_front 2)) (<= N (+ 2 (select q2 (+ q2_front 1)))) (= (select q1 q1_front) 1) (<= (+ q2_front 2) q2_back) (= (select q2 q2_front) 1) (<= (+ 2 (select q2 (+ q2_front 1))) N)), 377750#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ 3 t)) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ 3 t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 377756#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (= (select q1 (+ q1_front 1)) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N 3)), 377759#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)) (<= N 3)) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= 3 N) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0)))), 377764#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (<= 3 N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0)) (<= N 3))), 377748#(and (or (<= N (+ t 1)) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))) (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= (+ t 1) N)) (or (= (select q2 q2_front) 1) (not f) (<= q1_back q1_front))), 377768#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 377753#(and (<= q2_back (+ q2_front 2)) (<= N (+ 2 (select q2 (+ q2_front 1)))) (<= (+ q2_front 2) q2_back) (= (select q2 q2_front) 1) (= j 1) (<= (+ 2 (select q2 (+ q2_front 1))) N)), 377763#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= N (+ 3 t)) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 3 t) N) (not (= (select q1 (+ q1_back 2)) 0)))), 377749#(and (or (not f) (= 1 (select q2 (+ q2_front 1))) (<= q1_back q1_front)) (or (not f) (<= N (+ (select q2 q2_front) t 1)) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))) (or (<= (+ (select q2 q2_front) t 1) N) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 377746#(and (or (<= N t) f) (or f (<= t N))), 377758#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ 3 t) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ 3 t)) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)))), 377766#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 377769#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1)))), 377751#(and (or (<= (+ 2 (select q2 (+ q2_front 1))) N) (not (= j 0))) (or (<= N (+ 2 (select q2 (+ q2_front 1)))) (not (= j 0))) (or (= (select q2 q2_front) 1) (not (= j 0))) (= (select q2 (+ q2_front 2)) 1)), 377752#(and (<= N (+ 2 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 1) (<= (+ 2 (select q2 (+ q2_front 1))) N) (= (select q2 (+ q2_front 2)) 1)), 377760#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) 1) (= j 1) (<= N 3) (= q2_back q2_front)), 377765#(and (<= i 1) (<= q1_back q1_front) (<= q1_front q1_back) (= j 1) (<= 1 i) (= q2_back q2_front)), 377762#(and (<= 2 i) (= (select q1 q1_front) 1) (<= i 2) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (= j 1) (= q2_back q2_front)), 377747#(and (or (< t (+ N 1)) f g) (or (<= N t) f g)), 377757#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= N 3)) (or (<= 3 N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 377761#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) 1) (= j 1) (= q2_back q2_front) (<= i 3))] [2022-03-15 21:44:26,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 21:44:26,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:26,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 21:44:26,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=4890, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 21:44:26,128 INFO L87 Difference]: Start difference. First operand 3322 states and 10849 transitions. Second operand has 46 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 45 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:42,930 INFO L93 Difference]: Finished difference Result 6261 states and 18542 transitions. [2022-03-15 21:44:42,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-03-15 21:44:42,930 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 45 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 21:44:42,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:42,940 INFO L225 Difference]: With dead ends: 6261 [2022-03-15 21:44:42,940 INFO L226 Difference]: Without dead ends: 6208 [2022-03-15 21:44:42,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 69 SyntacticMatches, 13 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10430 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=2670, Invalid=30272, Unknown=0, NotChecked=0, Total=32942 [2022-03-15 21:44:42,941 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 347 mSDsluCounter, 2698 mSDsCounter, 0 mSdLazyCounter, 5911 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 6090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 5911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:42,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 66 Invalid, 6090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 5911 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 21:44:42,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6208 states. [2022-03-15 21:44:42,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6208 to 3318. [2022-03-15 21:44:42,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3318 states, 3317 states have (on average 3.267711787760024) internal successors, (10839), 3317 states have internal predecessors, (10839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3318 states to 3318 states and 10839 transitions. [2022-03-15 21:44:42,992 INFO L78 Accepts]: Start accepts. Automaton has 3318 states and 10839 transitions. Word has length 29 [2022-03-15 21:44:42,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:42,992 INFO L470 AbstractCegarLoop]: Abstraction has 3318 states and 10839 transitions. [2022-03-15 21:44:42,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 45 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:42,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3318 states and 10839 transitions. [2022-03-15 21:44:42,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 21:44:42,996 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:42,996 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:43,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-03-15 21:44:43,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-03-15 21:44:43,197 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:43,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:43,197 INFO L85 PathProgramCache]: Analyzing trace with hash -990678769, now seen corresponding path program 50 times [2022-03-15 21:44:43,198 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:43,198 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664475999] [2022-03-15 21:44:43,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:43,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:43,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:43,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664475999] [2022-03-15 21:44:43,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664475999] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:43,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615167337] [2022-03-15 21:44:43,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:44:43,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:43,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:43,742 INFO L229 MonitoredProcess]: Starting monitored process 54 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:44:43,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-03-15 21:44:43,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:44:43,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:44:43,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-15 21:44:43,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:44,221 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-15 21:44:44,221 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 49 treesize of output 25 [2022-03-15 21:44:44,422 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-15 21:44:44,423 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 20 [2022-03-15 21:44:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:44,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:44,919 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:44:44,920 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 64 treesize of output 118 [2022-03-15 21:44:45,525 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:44:45,525 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 65 treesize of output 119 [2022-03-15 21:44:45,684 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:45,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615167337] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:45,684 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:45,684 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 47 [2022-03-15 21:44:45,685 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1873365208] [2022-03-15 21:44:45,685 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:45,689 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:45,709 INFO L252 McrAutomatonBuilder]: Finished intersection with 107 states and 204 transitions. [2022-03-15 21:44:45,709 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:50,293 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [391115#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (= (select q1 (+ q1_front 1)) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= N 3)), 391124#(and (<= i 1) (<= q1_back q1_front) (<= q1_front q1_back) (= j 1) (<= 1 i) (= q2_back q2_front)), 391110#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ 3 t)) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ 3 t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 391105#(and (or (<= (+ 2 (select q2 (+ q2_front 1))) N) (not (= j 0))) (or (<= N (+ 2 (select q2 (+ q2_front 1)))) (not (= j 0))) (or (= (select q2 q2_front) 1) (not (= j 0))) (= (select q2 (+ q2_front 2)) 1)), 391107#(and (or (<= N t) f) (or f (<= t N))), 391119#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) 1) (= j 1) (<= N 3) (= q2_back q2_front)), 391106#(and (or (not f) (= 1 (select q2 (+ q2_front 1))) (<= q1_back q1_front)) (or (not f) (<= N (+ (select q2 q2_front) t 1)) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))) (or (<= (+ (select q2 q2_front) t 1) N) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 391117#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ 3 t) N) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (<= N (+ 3 t)) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)))), 391104#(and (or (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 2)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0))) (or (<= q2_back (+ q2_front 2)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 2)) (select q2 (+ q2_front 1))) (+ N 1)) (not g) (= (select q2 q2_front) 0) (= 0 (select q2 (+ q2_front 1))) (not (= (select q2 (+ q2_front 2)) 0)))), 391102#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 391112#(and (<= q2_back (+ q2_front 2)) (<= N (+ 2 (select q2 (+ q2_front 1)))) (<= (+ q2_front 2) q2_back) (= (select q2 q2_front) 1) (= j 1) (<= (+ 2 (select q2 (+ q2_front 1))) N)), 391103#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1)))), 391125#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 391114#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (= j 1) (<= N 3)), 391123#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (<= 3 N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0)) (<= N 3))), 391122#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= N (+ 3 t)) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 3 t) N) (not (= (select q1 (+ q1_back 2)) 0)))), 391111#(and (<= N (+ 2 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 1) (<= (+ 2 (select q2 (+ q2_front 1))) N) (= (select q2 (+ q2_front 2)) 1)), 391113#(and (<= q2_back (+ q2_front 2)) (<= N (+ 2 (select q2 (+ q2_front 1)))) (= (select q1 q1_front) 1) (<= (+ q2_front 2) q2_back) (= (select q2 q2_front) 1) (<= (+ 2 (select q2 (+ q2_front 1))) N)), 391121#(and (<= 2 i) (= (select q1 q1_front) 1) (<= i 2) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (= j 1) (= q2_back q2_front)), 391108#(and (or (< t (+ N 1)) f g) (or (<= N t) f g)), 391118#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back (+ q2_front 1)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0)) (<= N 3)) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (<= 3 N) (< (+ i 1) N) (not (< i N)) (not (= (select q1 (+ q1_back 1)) 0))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= (+ q2_front 1) q2_back) (not (= (select q1 (+ q1_back 1)) 0)))), 391126#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 391109#(and (or f (<= (+ t 1) N)) (or (<= N (+ t 1)) f) (or (= (select q2 q2_front) 1) f)), 391120#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) 1) (= j 1) (= q2_back q2_front) (<= i 3)), 391116#(and (or (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q2 q2_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (<= N 3)) (or (<= 3 N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N)))] [2022-03-15 21:44:50,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 21:44:50,293 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:50,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 21:44:50,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=5013, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 21:44:50,294 INFO L87 Difference]: Start difference. First operand 3318 states and 10839 transitions. Second operand has 47 states, 46 states have (on average 2.8043478260869565) internal successors, (129), 46 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 21:45:03,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:03,134 INFO L93 Difference]: Finished difference Result 5747 states and 17134 transitions. [2022-03-15 21:45:03,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-03-15 21:45:03,134 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.8043478260869565) internal successors, (129), 46 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 29 [2022-03-15 21:45:03,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:03,143 INFO L225 Difference]: With dead ends: 5747 [2022-03-15 21:45:03,143 INFO L226 Difference]: Without dead ends: 5702 [2022-03-15 21:45:03,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 70 SyntacticMatches, 12 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6108 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=1707, Invalid=19463, Unknown=0, NotChecked=0, Total=21170 [2022-03-15 21:45:03,144 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 354 mSDsluCounter, 2858 mSDsCounter, 0 mSdLazyCounter, 5854 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 6007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 5854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:03,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 73 Invalid, 6007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 5854 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 21:45:03,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5702 states. [2022-03-15 21:45:03,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5702 to 3326. [2022-03-15 21:45:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3326 states, 3325 states have (on average 3.2637593984962407) internal successors, (10852), 3325 states have internal predecessors, (10852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:03,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3326 states to 3326 states and 10852 transitions. [2022-03-15 21:45:03,208 INFO L78 Accepts]: Start accepts. Automaton has 3326 states and 10852 transitions. Word has length 29 [2022-03-15 21:45:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:03,208 INFO L470 AbstractCegarLoop]: Abstraction has 3326 states and 10852 transitions. [2022-03-15 21:45:03,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.8043478260869565) internal successors, (129), 46 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 21:45:03,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 10852 transitions. [2022-03-15 21:45:03,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 21:45:03,212 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:03,212 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:03,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-03-15 21:45:03,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-03-15 21:45:03,412 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:45:03,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:03,413 INFO L85 PathProgramCache]: Analyzing trace with hash 778863039, now seen corresponding path program 51 times [2022-03-15 21:45:03,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:03,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942133232] [2022-03-15 21:45:03,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:03,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:03,873 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:03,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942133232] [2022-03-15 21:45:03,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942133232] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:03,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928450697] [2022-03-15 21:45:03,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:45:03,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:03,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:03,874 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:45:03,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-03-15 21:45:03,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:45:03,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:45:03,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 21:45:03,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:04,409 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:45:04,409 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 47 treesize of output 27 [2022-03-15 21:45:04,548 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-15 21:45:04,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 16 [2022-03-15 21:45:04,660 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:04,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:45:05,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:45:05,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:45:05,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:45:05,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:45:05,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:45:05,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:45:05,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:45:05,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:45:05,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:45:05,086 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:45:05,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 98 [2022-03-15 21:45:05,415 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:45:05,416 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 65 treesize of output 119 [2022-03-15 21:45:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:05,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928450697] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:45:05,709 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:45:05,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 50 [2022-03-15 21:45:05,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1117753475] [2022-03-15 21:45:05,709 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:05,712 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:05,725 INFO L252 McrAutomatonBuilder]: Finished intersection with 90 states and 161 transitions. [2022-03-15 21:45:05,725 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:09,777 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [403893#(and (or (= (select q1 q1_front) 1) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (< i N) (<= (+ t 1) N)) (or (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (< i N) (= q2_back q2_front)) (or (<= N (+ t 1)) (<= (+ q1_back 1) q1_front) (not f) (not (= (select q1 q1_back) 0)) (< i N))), 403894#(and (or (<= (+ (select q2 q2_front) t 1) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ (select q2 q2_front) t 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 403909#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= 3 N) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)))), 403897#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< i N)) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not f) (<= (+ 2 t) N) (not (= (select q1 (+ q1_back 1)) 0)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= N (+ 2 t)) (< (+ i 1) N) (not (< i N)) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back q2_front) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not f) (<= q2_front q2_back) (not (= (select q1 (+ q1_back 1)) 0)) (not (< q1_front (+ q1_back 1))))), 403891#(and (or f g (<= t N)) (or (<= N t) f g)), 403898#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= i (+ 2 t))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 3 t) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) 1)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q2 q2_front) 1)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1)))), 403896#(and (or (<= q2_back q2_front) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front q1_back))) (or (not f) (not (= (select q1 q1_back) 0)) (< i N) (<= q2_front q2_back) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) 1) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front q1_back))) (or (<= N (+ 2 t)) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front q1_back))) (or (not f) (<= (+ 2 t) N) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front q1_back)))), 403890#(and (or (<= N (+ t 1)) (not f) (<= q1_back q1_front)) (or (not f) (<= q1_back q1_front) (= q2_back q2_front)) (or (not f) (<= q1_back q1_front) (<= (+ t 1) N)) (or (= (select q1 q1_front) 1) (not f) (<= q1_back q1_front))), 403913#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 403905#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) 1)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= i 2)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q2 q2_front) 1)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= 3 N) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1)))), 403906#(and (<= 2 i) (= (select q1 q1_front) 1) (<= i 2) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (= j 1) (= q2_back q2_front)), 403903#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (= (select q1 (+ q1_front 1)) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= i 3)), 403904#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) 1) (= j 1) (= q2_back q2_front) (<= i 3)), 403911#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 403895#(and (or (not (= (select q1 q1_back) 0)) (< i N) (<= q2_front q2_back)) (or (<= (+ 2 t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back q2_front) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (= j 1)) (or (<= N (+ 2 t)) (not (= (select q1 q1_back) 0)) (< i N))), 403910#(and (<= i 1) (<= q1_back q1_front) (<= q1_front q1_back) (= j 1) (<= 1 i) (= q2_back q2_front)), 403902#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (= j 1) (<= i 3)), 403900#(and (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) 2) N)) (or (= (select q1 q1_front) 1) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) 2))) (<= q2_back (+ q2_front 1)) (or (not (< q2_front q2_back)) (= j 1))), 403901#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (= j 1) (<= N 3)), 403907#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< q1_front (+ q1_back 2))) (<= q2_back q2_front) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (<= q2_front q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (<= N (+ 2 t)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< q1_front (+ q1_back 2))) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (<= (+ 2 t) N) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (= (select q1 (+ q1_back 2)) 0)))), 403892#(and (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= t N)) (or (<= N t) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)))), 403899#(and (or (= (select q1 q1_front) 1) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (= j 1)) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) 2 t) N)) (or (not g) (<= q2_back (+ q2_front 1))) (or (not g) (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) 2 t)))), 403908#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 3 t) N)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i (+ t 1)) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)))), 403912#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front))] [2022-03-15 21:45:09,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 21:45:09,777 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:09,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 21:45:09,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=5207, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 21:45:09,778 INFO L87 Difference]: Start difference. First operand 3326 states and 10852 transitions. Second operand has 46 states, 45 states have (on average 2.4444444444444446) internal successors, (110), 45 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:53,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:53,581 INFO L93 Difference]: Finished difference Result 12212 states and 35013 transitions. [2022-03-15 21:45:53,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2022-03-15 21:45:53,581 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.4444444444444446) internal successors, (110), 45 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 21:45:53,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:53,601 INFO L225 Difference]: With dead ends: 12212 [2022-03-15 21:45:53,601 INFO L226 Difference]: Without dead ends: 12119 [2022-03-15 21:45:53,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 50 SyntacticMatches, 13 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35594 ImplicationChecksByTransitivity, 43.1s TimeCoverageRelationStatistics Valid=7154, Invalid=88018, Unknown=0, NotChecked=0, Total=95172 [2022-03-15 21:45:53,604 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 657 mSDsluCounter, 2185 mSDsCounter, 0 mSdLazyCounter, 6010 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 6698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 6010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:53,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [657 Valid, 31 Invalid, 6698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 6010 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-03-15 21:45:53,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12119 states. [2022-03-15 21:45:53,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12119 to 3341. [2022-03-15 21:45:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3341 states, 3340 states have (on average 3.2592814371257486) internal successors, (10886), 3340 states have internal predecessors, (10886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3341 states to 3341 states and 10886 transitions. [2022-03-15 21:45:53,693 INFO L78 Accepts]: Start accepts. Automaton has 3341 states and 10886 transitions. Word has length 29 [2022-03-15 21:45:53,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:53,693 INFO L470 AbstractCegarLoop]: Abstraction has 3341 states and 10886 transitions. [2022-03-15 21:45:53,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.4444444444444446) internal successors, (110), 45 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:53,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3341 states and 10886 transitions. [2022-03-15 21:45:53,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 21:45:53,698 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:53,698 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:53,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-03-15 21:45:53,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:53,898 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:45:53,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:53,899 INFO L85 PathProgramCache]: Analyzing trace with hash 786740367, now seen corresponding path program 52 times [2022-03-15 21:45:53,899 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:53,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886222235] [2022-03-15 21:45:53,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:53,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:54,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:54,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886222235] [2022-03-15 21:45:54,325 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886222235] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:54,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383501507] [2022-03-15 21:45:54,325 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:45:54,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:54,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:54,328 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:45:54,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-03-15 21:45:54,366 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:45:54,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:45:54,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-15 21:45:54,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:54,869 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-15 21:45:54,870 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 51 treesize of output 27 [2022-03-15 21:45:55,009 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-03-15 21:45:55,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 16 [2022-03-15 21:45:55,122 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:55,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:45:55,602 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:45:55,603 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 64 treesize of output 118 [2022-03-15 21:45:56,103 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:45:56,103 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 65 treesize of output 119 [2022-03-15 21:45:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:56,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383501507] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:45:56,274 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:45:56,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 47 [2022-03-15 21:45:56,274 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [252848585] [2022-03-15 21:45:56,274 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:56,277 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:56,290 INFO L252 McrAutomatonBuilder]: Finished intersection with 89 states and 159 transitions. [2022-03-15 21:45:56,290 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:00,209 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [423499#(and (or (= (select q1 q1_front) 1) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (= j 1)) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) 2 t) N)) (or (not g) (<= q2_back (+ q2_front 1))) (or (not g) (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) 2 t)))), 423495#(and (or (not (= (select q1 q1_back) 0)) (< i N) (<= q2_front q2_back)) (or (<= (+ 2 t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back q2_front) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (= j 1)) (or (<= N (+ 2 t)) (not (= (select q1 q1_back) 0)) (< i N))), 423504#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) 1)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= i 2)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q2 q2_front) 1)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= 3 N) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1)))), 423513#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 423509#(and (<= 2 i) (= (select q1 q1_front) 1) (<= i 2) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (= j 1) (= q2_back q2_front)), 423508#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) 1) (= j 1) (= q2_back q2_front) (<= i 3)), 423502#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (= j 1) (<= i 3)), 423501#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (= j 1) (<= N 3)), 423507#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= 3 N) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)))), 423506#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 3 t) N)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i (+ t 1)) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)))), 423494#(and (or (<= (+ (select q2 q2_front) t 1) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ (select q2 q2_front) t 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 423505#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< q1_front (+ q1_back 2))) (<= q2_back q2_front) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (<= q2_front q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (<= N (+ 2 t)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< q1_front (+ q1_back 2))) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (<= (+ 2 t) N) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (= (select q1 (+ q1_back 2)) 0)))), 423498#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= i (+ 2 t))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 3 t) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) 1)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q2 q2_front) 1)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1)))), 423496#(and (or (<= q2_back q2_front) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front q1_back))) (or (not f) (not (= (select q1 q1_back) 0)) (< i N) (<= q2_front q2_back) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) 1) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front q1_back))) (or (<= N (+ 2 t)) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front q1_back))) (or (not f) (<= (+ 2 t) N) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front q1_back)))), 423500#(and (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) 2) N)) (or (= (select q1 q1_front) 1) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) 2))) (<= q2_back (+ q2_front 1)) (or (not (< q2_front q2_back)) (= j 1))), 423512#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 423511#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front)), 423497#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< i N)) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not f) (<= (+ 2 t) N) (not (= (select q1 (+ q1_back 1)) 0)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= N (+ 2 t)) (< (+ i 1) N) (not (< i N)) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back q2_front) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not f) (<= q2_front q2_back) (not (= (select q1 (+ q1_back 1)) 0)) (not (< q1_front (+ q1_back 1))))), 423493#(and (or (<= N (+ t 1)) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))) (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= (+ t 1) N)) (or (= (select q2 q2_front) 1) (not f) (<= q1_back q1_front))), 423510#(and (<= i 1) (<= q1_back q1_front) (<= q1_front q1_back) (= j 1) (<= 1 i) (= q2_back q2_front)), 423503#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (= (select q1 (+ q1_front 1)) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= i 3)), 423491#(and (or f g (<= t N)) (or (<= N t) f g)), 423492#(and (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= t N)) (or (<= N t) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))))] [2022-03-15 21:46:00,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 21:46:00,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:00,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 21:46:00,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=4717, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 21:46:00,210 INFO L87 Difference]: Start difference. First operand 3341 states and 10886 transitions. Second operand has 45 states, 44 states have (on average 2.4545454545454546) internal successors, (108), 44 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:46:45,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:45,102 INFO L93 Difference]: Finished difference Result 13314 states and 38222 transitions. [2022-03-15 21:46:45,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2022-03-15 21:46:45,103 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.4545454545454546) internal successors, (108), 44 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 21:46:45,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:45,123 INFO L225 Difference]: With dead ends: 13314 [2022-03-15 21:46:45,123 INFO L226 Difference]: Without dead ends: 13277 [2022-03-15 21:46:45,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 52 SyntacticMatches, 14 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34164 ImplicationChecksByTransitivity, 44.2s TimeCoverageRelationStatistics Valid=7067, Invalid=84439, Unknown=0, NotChecked=0, Total=91506 [2022-03-15 21:46:45,126 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 542 mSDsluCounter, 2106 mSDsCounter, 0 mSdLazyCounter, 5703 mSolverCounterSat, 537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 6240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 537 IncrementalHoareTripleChecker+Valid, 5703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:45,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [542 Valid, 34 Invalid, 6240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [537 Valid, 5703 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-03-15 21:46:45,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13277 states. [2022-03-15 21:46:45,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13277 to 3349. [2022-03-15 21:46:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3349 states, 3348 states have (on average 3.2562724014336917) internal successors, (10902), 3348 states have internal predecessors, (10902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:46:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3349 states to 3349 states and 10902 transitions. [2022-03-15 21:46:45,213 INFO L78 Accepts]: Start accepts. Automaton has 3349 states and 10902 transitions. Word has length 29 [2022-03-15 21:46:45,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:45,213 INFO L470 AbstractCegarLoop]: Abstraction has 3349 states and 10902 transitions. [2022-03-15 21:46:45,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.4545454545454546) internal successors, (108), 44 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:46:45,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3349 states and 10902 transitions. [2022-03-15 21:46:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 21:46:45,216 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:45,216 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:45,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-03-15 21:46:45,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:45,417 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:46:45,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:45,417 INFO L85 PathProgramCache]: Analyzing trace with hash -933981923, now seen corresponding path program 53 times [2022-03-15 21:46:45,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:45,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245798669] [2022-03-15 21:46:45,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:45,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:45,878 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:45,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245798669] [2022-03-15 21:46:45,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245798669] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:45,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190324100] [2022-03-15 21:46:45,878 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:46:45,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:45,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:45,879 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:46:45,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-03-15 21:46:45,922 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:46:45,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:45,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-15 21:46:45,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:46,435 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:46:46,435 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 47 treesize of output 27 [2022-03-15 21:46:46,669 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-15 21:46:46,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 20 [2022-03-15 21:46:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:46,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:47,281 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:46:47,282 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 64 treesize of output 118 [2022-03-15 21:46:47,900 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:46:47,900 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 72 treesize of output 122 [2022-03-15 21:46:48,133 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:48,133 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190324100] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:48,133 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:48,133 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 49 [2022-03-15 21:46:48,133 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [752129411] [2022-03-15 21:46:48,133 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:48,136 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:48,153 INFO L252 McrAutomatonBuilder]: Finished intersection with 90 states and 161 transitions. [2022-03-15 21:46:48,153 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:52,207 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [444218#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (= j 1) (<= i 3)), 444230#(and (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= N (+ (select q2 q2_front) t (select q2 (+ q2_front 1)))) (<= q2_back (+ q2_front 1))) (or (not g) (not (= 0 (select q2 (+ q2_front 1)))) (= (select q2 q2_front) 0) (<= q2_back (+ q2_front 1)) (< (+ (select q2 q2_front) t (select q2 (+ q2_front 1))) (+ N 1)))), 444215#(and (or (= (select q1 q1_front) 1) (not g) (not (< q2_front q2_back))) (or (not g) (not (< q2_front q2_back)) (= j 1)) (or (not g) (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) 2 t) N)) (or (not g) (<= q2_back (+ q2_front 1))) (or (not g) (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) 2 t)))), 444229#(and (or (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)) (<= N (+ (select q2 q2_front) t))) (or (< (+ (select q2 q2_front) t) (+ N 1)) (not g) (<= q2_back q2_front) (not (= (select q2 q2_front) 0)))), 444223#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= 3 N) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)))), 444219#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (= (select q1 (+ q1_front 1)) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (<= i 3)), 444221#(and (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< q1_front (+ q1_back 2))) (<= q2_back q2_front) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (<= q2_front q2_back) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (<= N (+ 2 t)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< q1_front (+ q1_back 2))) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (<= (+ 2 t) N) (not (= (select q1 (+ q1_back 2)) 0))) (or (not (= (select q1 q1_back) 1)) (not (< (+ i 1) N)) (= (select q1 q1_front) 1) (< (+ 2 i) N) (not (< q1_front (+ q1_back 2))) (not (= (select q1 (+ q1_back 1)) 1)) (not f) (not (= (select q1 (+ q1_back 2)) 0)))), 444211#(and (or (not (= (select q1 q1_back) 0)) (< i N) (<= q2_front q2_back)) (or (<= (+ 2 t) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back q2_front) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (not (= (select q1 q1_back) 0)) (< i N) (= j 1)) (or (<= N (+ 2 t)) (not (= (select q1 q1_back) 0)) (< i N))), 444210#(and (or (<= (+ (select q2 q2_front) t 1) N) (not (= (select q1 q1_back) 0)) (< i N)) (or (= (select q1 q1_front) 1) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= N (+ (select q2 q2_front) t 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= q2_back (+ q2_front 1)) (not (= (select q1 q1_back) 0)) (< i N)) (or (<= (+ q2_front 1) q2_back) (not (= (select q1 q1_back) 0)) (< i N))), 444213#(and (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (= (select q1 (+ q1_front 1)) 1) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (< (+ i 1) N) (not (< i N)) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not f) (<= (+ 2 t) N) (not (= (select q1 (+ q1_back 1)) 0)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (<= N (+ 2 t)) (< (+ i 1) N) (not (< i N)) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (<= q2_back q2_front) (not f) (not (= (select q1 (+ q1_back 1)) 0)) (not (< q1_front (+ q1_back 1)))) (or (not (= (select q1 q1_back) 1)) (< (+ i 1) N) (not (< i N)) (not f) (<= q2_front q2_back) (not (= (select q1 (+ q1_back 1)) 0)) (not (< q1_front (+ q1_back 1))))), 444222#(and (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ q2_front 1) q2_back)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= (+ 3 t) N)) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (not (= (select q1 (+ q1_back 1)) 1)) (<= q2_back (+ q2_front 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (<= i (+ t 1)) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q2 q2_front) 1) (not (= (select q1 (+ q1_back 1)) 1))) (or (<= N (+ i 1)) (not (= (select q1 q1_back) 1)) (= (select q1 (+ q1_front 1)) 1) (not (= (select q1 (+ q1_back 1)) 1)))), 444207#(and (or (<= N t) f) (or f (<= t N))), 444216#(and (or (not (< q2_front q2_back)) (<= (+ (select q2 q2_front) 2) N)) (or (= (select q1 q1_front) 1) (not (< q2_front q2_back))) (or (not (< q2_front q2_back)) (<= N (+ (select q2 q2_front) 2))) (<= q2_back (+ q2_front 1)) (or (not (< q2_front q2_back)) (= j 1))), 444220#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) 1)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= i 2)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q2 q2_front) 1)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= 3 N) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1)))), 444209#(and (or (<= N (+ t 1)) (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0))) (or (not f) (<= q1_back q1_front) (not (= (select q1 q1_front) 0)) (<= (+ t 1) N)) (or (= (select q2 q2_front) 1) (not f) (<= q1_back q1_front))), 444208#(and (or (< t (+ N 1)) f g) (or (<= N t) f g)), 444226#(and (<= i 1) (<= q1_back q1_front) (<= q1_front q1_back) (= j 1) (<= 1 i) (= q2_back q2_front)), 444228#(and (<= t 0) (= q1_front q1_back) (<= 0 t) (= q2_back q2_front)), 444224#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q1 (+ q1_front 1)) 1) (= j 1) (= q2_back q2_front) (<= i 3)), 444212#(and (or (<= q2_back q2_front) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front q1_back))) (or (= (select q1 q1_front) 1) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front q1_back))) (or (not f) (not (= (select q1 q1_back) 0)) (< i N) (<= q2_front q2_back) (not (< q1_front q1_back))) (or (= (select q1 (+ q1_front 1)) 1) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front q1_back))) (or (<= N (+ 2 t)) (not f) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front q1_back))) (or (not f) (<= (+ 2 t) N) (not (= (select q1 q1_back) 0)) (< i N) (not (< q1_front q1_back)))), 444214#(and (or (not (= (select q1 q1_back) 1)) (<= N i) (<= i (+ 2 t))) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ q2_front 1) q2_back)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= (+ 3 t) N)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q1 (+ q1_front 1)) 1)) (or (not (= (select q1 q1_back) 1)) (<= N i) (= (select q2 q2_front) 1)) (or (not (= (select q1 q1_back) 1)) (= (select q1 q1_front) 1) (<= N i)) (or (not (= (select q1 q1_back) 1)) (<= N i) (<= q2_back (+ q2_front 1)))), 444225#(and (<= 2 i) (= (select q1 q1_front) 1) (<= i 2) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (= j 1) (= q2_back q2_front)), 444217#(and (<= 3 N) (= (select q1 q1_front) 1) (= (select q2 q2_front) 1) (<= (+ q2_front 1) q2_back) (<= q2_back (+ q2_front 1)) (= j 1) (<= N 3)), 444227#(and (= (select q1 q1_front) 1) (<= i 1) (<= (+ q1_front 1) q1_back) (<= q1_back (+ q1_front 1)) (<= 1 i) (= q2_back q2_front))] [2022-03-15 21:46:52,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 21:46:52,208 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:52,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 21:46:52,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=5139, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 21:46:52,208 INFO L87 Difference]: Start difference. First operand 3349 states and 10902 transitions. Second operand has 46 states, 45 states have (on average 2.4444444444444446) internal successors, (110), 45 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 21:47:15,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-03-15 21:47:15,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 53 SyntacticMatches, 11 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13881 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=3881, Invalid=37939, Unknown=0, NotChecked=0, Total=41820 [2022-03-15 21:47:15,338 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 333 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 3535 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 3783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 3535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:15,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 37 Invalid, 3783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 3535 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 21:47:15,339 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 21:47:15,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-03-15 21:47:15,358 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 21:47:15,358 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 21:47:15,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-03-15 21:47:15,540 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (3349states) and FLOYD_HOARE automaton (currently 138 states, 46 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 205 known predicates. [2022-03-15 21:47:15,541 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 21:47:15,541 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 21:47:15,541 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 21:47:15,543 INFO L732 BasicCegarLoop]: Path program histogram: [53, 5, 1, 1] [2022-03-15 21:47:15,544 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 21:47:15,545 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 21:47:15,546 INFO L202 PluginConnector]: Adding new model queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 09:47:15 BasicIcfg [2022-03-15 21:47:15,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 21:47:15,546 INFO L158 Benchmark]: Toolchain (without parser) took 701271.16ms. Allocated memory was 178.3MB in the beginning and 506.5MB in the end (delta: 328.2MB). Free memory was 132.9MB in the beginning and 313.3MB in the end (delta: -180.4MB). Peak memory consumption was 148.0MB. Max. memory is 8.0GB. [2022-03-15 21:47:15,546 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 178.3MB. Free memory is still 134.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 21:47:15,546 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.36ms. Allocated memory is still 178.3MB. Free memory was 132.9MB in the beginning and 131.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:47:15,546 INFO L158 Benchmark]: Boogie Preprocessor took 12.40ms. Allocated memory is still 178.3MB. Free memory was 131.4MB in the beginning and 130.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:47:15,546 INFO L158 Benchmark]: RCFGBuilder took 214.82ms. Allocated memory is still 178.3MB. Free memory was 130.4MB in the beginning and 120.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-15 21:47:15,547 INFO L158 Benchmark]: TraceAbstraction took 701008.61ms. Allocated memory was 178.3MB in the beginning and 506.5MB in the end (delta: 328.2MB). Free memory was 119.8MB in the beginning and 313.3MB in the end (delta: -193.6MB). Peak memory consumption was 135.4MB. Max. memory is 8.0GB. [2022-03-15 21:47:15,547 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 178.3MB. Free memory is still 134.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.36ms. Allocated memory is still 178.3MB. Free memory was 132.9MB in the beginning and 131.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 12.40ms. Allocated memory is still 178.3MB. Free memory was 131.4MB in the beginning and 130.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 214.82ms. Allocated memory is still 178.3MB. Free memory was 130.4MB in the beginning and 120.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 701008.61ms. Allocated memory was 178.3MB in the beginning and 506.5MB in the end (delta: 328.2MB). Free memory was 119.8MB in the beginning and 313.3MB in the end (delta: -193.6MB). Peak memory consumption was 135.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 45 PlacesBefore, 29 PlacesAfterwards, 38 TransitionsBefore, 22 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 14 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 17 TotalNumberOfCompositions, 390 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 330, positive: 320, positive conditional: 0, positive unconditional: 320, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 230, positive: 223, positive conditional: 0, positive unconditional: 223, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 330, positive: 97, positive conditional: 0, positive unconditional: 97, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 230, unknown conditional: 0, unknown unconditional: 230] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - 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: 88]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (3349states) and FLOYD_HOARE automaton (currently 138 states, 46 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 205 known predicates. - TimeoutResultAtElement [Line: 81]: 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 (3349states) and FLOYD_HOARE automaton (currently 138 states, 46 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 205 known predicates. - TimeoutResultAtElement [Line: 81]: 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 (3349states) and FLOYD_HOARE automaton (currently 138 states, 46 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 205 known predicates. - TimeoutResultAtElement [Line: 82]: 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 (3349states) and FLOYD_HOARE automaton (currently 138 states, 46 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 205 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 63 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 700.9s, OverallIterations: 60, TraceHistogramMax: 4, PathProgramHistogramMax: 53, EmptinessCheckTime: 0.2s, AutomataDifference: 518.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.6s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14231 SdHoareTripleChecker+Valid, 62.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14231 mSDsluCounter, 1672 SdHoareTripleChecker+Invalid, 53.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57359 mSDsCounter, 10274 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 131243 IncrementalHoareTripleChecker+Invalid, 141517 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10274 mSolverCounterUnsat, 233 mSDtfsCounter, 131243 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11157 GetRequests, 4097 SyntacticMatches, 760 SemanticMatches, 6299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404690 ImplicationChecksByTransitivity, 507.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3349occurred in iteration=59, InterpolantAutomatonStates: 4651, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 59 MinimizatonAttempts, 127234 StatesRemovedByMinimization, 55 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 59.3s InterpolantComputationTime, 2885 NumberOfCodeBlocks, 2885 NumberOfCodeBlocksAsserted, 197 NumberOfCheckSat, 4105 ConstructedInterpolants, 8 QuantifiedInterpolants, 56468 SizeOfPredicates, 526 NumberOfNonLiveVariables, 7172 ConjunctsInSsa, 2060 ConjunctsInUnsatCore, 171 InterpolantComputations, 5 PerfectInterpolantSequences, 702/3337 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