/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/mult-dist.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:42:26,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:42:26,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:42:26,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:42:26,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:42:26,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:42:26,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:42:26,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:42:26,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:42:26,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:42:26,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:42:26,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:42:26,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:42:26,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:42:26,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:42:26,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:42:26,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:42:26,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:42:26,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:42:26,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:42:26,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:42:26,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:42:26,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:42:26,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:42:26,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:42:26,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:42:26,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:42:26,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:42:26,899 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:42:26,900 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:42:26,900 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:42:26,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:42:26,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:42:26,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:42:26,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:42:26,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:42:26,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:42:26,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:42:26,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:42:26,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:42:26,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:42:26,904 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 20:42:26,917 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:42:26,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:42:26,918 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:42:26,918 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:42:26,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:42:26,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:42:26,919 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:42:26,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:42:26,923 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:42:26,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:42:26,924 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:42:26,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:42:26,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:42:26,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:42:26,924 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:42:26,924 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:42:26,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:42:26,924 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:42:26,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:42:26,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:42:26,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:42:26,925 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:42:26,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:42:26,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:42:26,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:42:26,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:42:26,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:42:26,926 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:42:26,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:42:26,926 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:42:26,926 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:42:26,926 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:42:26,926 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 20:42:27,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:42:27,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:42:27,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:42:27,109 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 20:42:27,110 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 20:42:27,111 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/mult-dist.wvr.bpl [2022-03-15 20:42:27,111 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/mult-dist.wvr.bpl' [2022-03-15 20:42:27,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:42:27,133 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 20:42:27,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:42:27,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:42:27,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:42:27,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:27" (1/1) ... [2022-03-15 20:42:27,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:27" (1/1) ... [2022-03-15 20:42:27,150 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 20:42:27,151 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:42:27,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:42:27,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:42:27,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:42:27,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:27" (1/1) ... [2022-03-15 20:42:27,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:27" (1/1) ... [2022-03-15 20:42:27,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:27" (1/1) ... [2022-03-15 20:42:27,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:27" (1/1) ... [2022-03-15 20:42:27,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:27" (1/1) ... [2022-03-15 20:42:27,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:27" (1/1) ... [2022-03-15 20:42:27,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:27" (1/1) ... [2022-03-15 20:42:27,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:42:27,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:42:27,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:42:27,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:42:27,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:27" (1/1) ... [2022-03-15 20:42:27,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:42:27,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:27,200 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 20:42:27,221 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 20:42:27,230 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 20:42:27,231 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 20:42:27,231 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 20:42:27,231 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 20:42:27,231 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 20:42:27,231 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 20:42:27,231 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 20:42:27,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:42:27,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:42:27,231 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 20:42:27,231 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 20:42:27,231 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 20:42:27,232 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 20:42:27,275 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:42:27,276 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:42:27,337 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:42:27,346 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:42:27,346 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 20:42:27,347 INFO L202 PluginConnector]: Adding new model mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:42:27 BoogieIcfgContainer [2022-03-15 20:42:27,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:42:27,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:42:27,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:42:27,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:42:27,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:27" (1/2) ... [2022-03-15 20:42:27,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58cc1630 and model type mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:42:27, skipping insertion in model container [2022-03-15 20:42:27,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "mult-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:42:27" (2/2) ... [2022-03-15 20:42:27,355 INFO L111 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.bpl [2022-03-15 20:42:27,358 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:42:27,358 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:42:27,358 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 20:42:27,358 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:42:27,379 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 20:42:27,405 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:42:27,409 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 20:42:27,409 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 20:42:27,416 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:42:27,422 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 76 flow [2022-03-15 20:42:27,424 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 76 flow [2022-03-15 20:42:27,425 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 76 flow [2022-03-15 20:42:27,441 INFO L129 PetriNetUnfolder]: 3/23 cut-off events. [2022-03-15 20:42:27,441 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 20:42:27,449 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 3/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2022-03-15 20:42:27,451 INFO L116 LiptonReduction]: Number of co-enabled transitions 144 [2022-03-15 20:42:27,626 INFO L131 LiptonReduction]: Checked pairs total: 96 [2022-03-15 20:42:27,626 INFO L133 LiptonReduction]: Total number of compositions: 9 [2022-03-15 20:42:27,633 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 60 flow [2022-03-15 20:42:27,643 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:27,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:27,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:42:27,657 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:27,657 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:27,657 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:27,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:27,661 INFO L85 PathProgramCache]: Analyzing trace with hash -366006867, now seen corresponding path program 1 times [2022-03-15 20:42:27,683 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:27,683 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025292567] [2022-03-15 20:42:27,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:27,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:27,818 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 20:42:27,819 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:27,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025292567] [2022-03-15 20:42:27,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025292567] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:42:27,819 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:42:27,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 20:42:27,820 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1197353792] [2022-03-15 20:42:27,821 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:27,823 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:27,842 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 20:42:27,842 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:28,302 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:42:28,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:42:28,303 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:28,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:42:28,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:42:28,323 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:28,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:28,367 INFO L93 Difference]: Finished difference Result 45 states and 117 transitions. [2022-03-15 20:42:28,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:42:28,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 20:42:28,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:28,374 INFO L225 Difference]: With dead ends: 45 [2022-03-15 20:42:28,374 INFO L226 Difference]: Without dead ends: 41 [2022-03-15 20:42:28,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 20:42:28,377 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:28,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:42:28,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-15 20:42:28,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-15 20:42:28,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.7) internal successors, (108), 40 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 20:42:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 108 transitions. [2022-03-15 20:42:28,409 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 108 transitions. Word has length 11 [2022-03-15 20:42:28,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:28,410 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 108 transitions. [2022-03-15 20:42:28,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:28,410 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 108 transitions. [2022-03-15 20:42:28,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:42:28,411 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:28,411 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:28,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:42:28,412 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:28,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:28,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1639390560, now seen corresponding path program 1 times [2022-03-15 20:42:28,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:28,414 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509691653] [2022-03-15 20:42:28,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:28,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:28,480 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:28,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509691653] [2022-03-15 20:42:28,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509691653] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:28,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382617405] [2022-03-15 20:42:28,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:28,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:28,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:28,488 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 20:42:28,517 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 20:42:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:28,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 20:42:28,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:28,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:28,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:28,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382617405] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:28,620 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:28,620 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-03-15 20:42:28,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1251966806] [2022-03-15 20:42:28,621 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:28,622 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:28,629 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 20:42:28,629 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:28,860 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [289#(or (< (+ i_1 1) a) (<= a i_1)), 288#(or (< i_1 a) (< i_3 (+ b a))), 290#(or (< (+ i_1 1) a) (<= a i_1) (< i_3 (+ b a))), 287#(< i_1 a)] [2022-03-15 20:42:28,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:42:28,861 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:28,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:42:28,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:42:28,862 INFO L87 Difference]: Start difference. First operand 41 states and 108 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 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 20:42:28,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:28,969 INFO L93 Difference]: Finished difference Result 79 states and 201 transitions. [2022-03-15 20:42:28,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 20:42:28,970 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 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 12 [2022-03-15 20:42:28,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:28,973 INFO L225 Difference]: With dead ends: 79 [2022-03-15 20:42:28,973 INFO L226 Difference]: Without dead ends: 79 [2022-03-15 20:42:28,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:42:28,976 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 46 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:28,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 1 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:28,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-03-15 20:42:28,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 54. [2022-03-15 20:42:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 2.9056603773584904) internal successors, (154), 53 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:28,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 154 transitions. [2022-03-15 20:42:28,992 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 154 transitions. Word has length 12 [2022-03-15 20:42:28,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:28,992 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 154 transitions. [2022-03-15 20:42:28,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 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 20:42:28,992 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 154 transitions. [2022-03-15 20:42:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:42:28,992 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:28,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:29,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 20:42:29,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:29,196 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:29,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:29,197 INFO L85 PathProgramCache]: Analyzing trace with hash 589570993, now seen corresponding path program 1 times [2022-03-15 20:42:29,198 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:29,198 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795680666] [2022-03-15 20:42:29,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:29,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:29,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:29,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795680666] [2022-03-15 20:42:29,233 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795680666] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:29,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578054767] [2022-03-15 20:42:29,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:29,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:29,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:29,234 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 20:42:29,235 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 20:42:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:29,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 20:42:29,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:29,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:29,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:29,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578054767] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:29,341 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:29,341 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-03-15 20:42:29,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [679183658] [2022-03-15 20:42:29,341 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:29,342 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:29,344 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 56 transitions. [2022-03-15 20:42:29,345 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:29,562 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [560#(or (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 558#(or (<= b i_2) (< (+ i_2 1) b)), 557#(< i_2 b), 559#(or (< i_2 b) (< i_3 (+ b a)))] [2022-03-15 20:42:29,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:42:29,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:29,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:42:29,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:42:29,563 INFO L87 Difference]: Start difference. First operand 54 states and 154 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:29,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:29,675 INFO L93 Difference]: Finished difference Result 95 states and 241 transitions. [2022-03-15 20:42:29,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 20:42:29,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 20:42:29,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:29,676 INFO L225 Difference]: With dead ends: 95 [2022-03-15 20:42:29,676 INFO L226 Difference]: Without dead ends: 95 [2022-03-15 20:42:29,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:42:29,677 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 43 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:29,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 1 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:29,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-03-15 20:42:29,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 57. [2022-03-15 20:42:29,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 2.767857142857143) internal successors, (155), 56 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:29,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 155 transitions. [2022-03-15 20:42:29,682 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 155 transitions. Word has length 12 [2022-03-15 20:42:29,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:29,682 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 155 transitions. [2022-03-15 20:42:29,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 155 transitions. [2022-03-15 20:42:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:42:29,682 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:29,683 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:29,706 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 20:42:29,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-03-15 20:42:29,899 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:29,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:29,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1516493596, now seen corresponding path program 1 times [2022-03-15 20:42:29,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:29,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172724948] [2022-03-15 20:42:29,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:29,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:29,947 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:29,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172724948] [2022-03-15 20:42:29,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172724948] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:42:29,947 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:42:29,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 20:42:29,947 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [397769003] [2022-03-15 20:42:29,947 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:29,948 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:29,950 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 20:42:29,950 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:30,135 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [789#(or (< i_1 a) (<= (+ b a) i_3)), 791#(and (or (< i_1 a) (<= a 0)) (or (< i_1 a) (= (+ (* (- 1) i_3) i_2) 0))), 784#(< i_1 a), 781#(< i_3 (+ b a)), 788#(or (< i_2 b) (<= (+ b a) i_3)), 790#(or (< i_1 a) (< i_2 b) (<= (+ b a) i_3)), 786#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3)), 787#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 783#(or (< i_2 b) (< i_3 (+ b a))), 782#(< i_2 b), 785#(or (< i_1 a) (< i_2 b))] [2022-03-15 20:42:30,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:42:30,136 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:30,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:42:30,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:42:30,136 INFO L87 Difference]: Start difference. First operand 57 states and 155 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 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 20:42:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:30,345 INFO L93 Difference]: Finished difference Result 69 states and 182 transitions. [2022-03-15 20:42:30,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 20:42:30,345 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 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 12 [2022-03-15 20:42:30,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:30,346 INFO L225 Difference]: With dead ends: 69 [2022-03-15 20:42:30,346 INFO L226 Difference]: Without dead ends: 65 [2022-03-15 20:42:30,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:42:30,347 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 62 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:30,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 1 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-03-15 20:42:30,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2022-03-15 20:42:30,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 2.7868852459016393) internal successors, (170), 61 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:30,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 170 transitions. [2022-03-15 20:42:30,351 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 170 transitions. Word has length 12 [2022-03-15 20:42:30,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:30,351 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 170 transitions. [2022-03-15 20:42:30,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 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 20:42:30,351 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 170 transitions. [2022-03-15 20:42:30,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:42:30,352 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:30,352 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:30,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 20:42:30,352 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:30,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:30,352 INFO L85 PathProgramCache]: Analyzing trace with hash -740695607, now seen corresponding path program 1 times [2022-03-15 20:42:30,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:30,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295841898] [2022-03-15 20:42:30,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:30,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:30,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:30,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295841898] [2022-03-15 20:42:30,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295841898] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:30,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394291685] [2022-03-15 20:42:30,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:30,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:30,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:30,405 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 20:42:30,406 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 20:42:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:30,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:42:30,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:30,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:30,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394291685] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:30,574 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:30,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 2] total 6 [2022-03-15 20:42:30,575 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1472940882] [2022-03-15 20:42:30,575 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:30,575 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:30,578 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 73 transitions. [2022-03-15 20:42:30,579 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:30,972 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1079#(and (< x_3 (+ x_2 x_1 c 1)) (<= (+ x_2 x_1 c) x_3))] [2022-03-15 20:42:30,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:42:30,973 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:30,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:42:30,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:42:30,974 INFO L87 Difference]: Start difference. First operand 62 states and 170 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:31,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:31,026 INFO L93 Difference]: Finished difference Result 133 states and 359 transitions. [2022-03-15 20:42:31,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:42:31,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:42:31,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:31,027 INFO L225 Difference]: With dead ends: 133 [2022-03-15 20:42:31,027 INFO L226 Difference]: Without dead ends: 129 [2022-03-15 20:42:31,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:42:31,028 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 15 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:31,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 1 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:42:31,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-03-15 20:42:31,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 96. [2022-03-15 20:42:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 3.1052631578947367) internal successors, (295), 95 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 295 transitions. [2022-03-15 20:42:31,047 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 295 transitions. Word has length 13 [2022-03-15 20:42:31,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:31,047 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 295 transitions. [2022-03-15 20:42:31,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:31,047 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 295 transitions. [2022-03-15 20:42:31,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:42:31,048 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:31,048 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:31,081 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 20:42:31,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:31,256 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:31,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:31,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1436759901, now seen corresponding path program 2 times [2022-03-15 20:42:31,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:31,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146427079] [2022-03-15 20:42:31,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:31,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:31,282 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:31,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146427079] [2022-03-15 20:42:31,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146427079] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:42:31,282 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:42:31,282 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 20:42:31,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1753805169] [2022-03-15 20:42:31,283 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:31,283 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:31,286 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 74 transitions. [2022-03-15 20:42:31,286 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:31,481 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [1416#(or (< (+ 2 i_2) b) (<= b (+ i_2 1)) (< i_3 (+ b a))), 1414#(or (< (+ 2 i_2) b) (<= b (+ i_2 1))), 1411#(< i_2 b), 1410#(< i_3 (+ b a)), 1417#(or (<= (+ b 1) i_2) (< i_3 (+ b a))), 1415#(or (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 1413#(or (<= b i_2) (< (+ i_2 1) b)), 1412#(or (< i_2 b) (< i_3 (+ b a)))] [2022-03-15 20:42:31,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:42:31,482 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:31,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:42:31,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:42:31,482 INFO L87 Difference]: Start difference. First operand 96 states and 295 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:31,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:31,611 INFO L93 Difference]: Finished difference Result 175 states and 532 transitions. [2022-03-15 20:42:31,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 20:42:31,612 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:42:31,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:31,612 INFO L225 Difference]: With dead ends: 175 [2022-03-15 20:42:31,612 INFO L226 Difference]: Without dead ends: 173 [2022-03-15 20:42:31,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:42:31,613 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 104 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:31,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 1 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:31,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-03-15 20:42:31,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 138. [2022-03-15 20:42:31,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.408759124087591) internal successors, (467), 137 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 467 transitions. [2022-03-15 20:42:31,641 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 467 transitions. Word has length 13 [2022-03-15 20:42:31,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:31,641 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 467 transitions. [2022-03-15 20:42:31,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 467 transitions. [2022-03-15 20:42:31,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:42:31,642 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:31,642 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:31,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 20:42:31,642 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:31,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:31,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1679182599, now seen corresponding path program 2 times [2022-03-15 20:42:31,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:31,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582783247] [2022-03-15 20:42:31,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:31,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:31,678 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:31,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582783247] [2022-03-15 20:42:31,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582783247] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:42:31,679 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:42:31,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:42:31,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1340825083] [2022-03-15 20:42:31,679 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:31,680 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:31,682 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 68 transitions. [2022-03-15 20:42:31,682 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:31,828 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1877#(< i_3 (+ b a))] [2022-03-15 20:42:31,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 20:42:31,831 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:31,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 20:42:31,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-15 20:42:31,831 INFO L87 Difference]: Start difference. First operand 138 states and 467 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:31,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:31,895 INFO L93 Difference]: Finished difference Result 160 states and 518 transitions. [2022-03-15 20:42:31,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:42:31,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:42:31,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:31,896 INFO L225 Difference]: With dead ends: 160 [2022-03-15 20:42:31,896 INFO L226 Difference]: Without dead ends: 158 [2022-03-15 20:42:31,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-15 20:42:31,897 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 23 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:31,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 1 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:42:31,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-03-15 20:42:31,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 133. [2022-03-15 20:42:31,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 3.446969696969697) internal successors, (455), 132 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:31,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 455 transitions. [2022-03-15 20:42:31,901 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 455 transitions. Word has length 13 [2022-03-15 20:42:31,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:31,901 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 455 transitions. [2022-03-15 20:42:31,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 455 transitions. [2022-03-15 20:42:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:42:31,902 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:31,902 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:31,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 20:42:31,903 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:31,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:31,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1994084164, now seen corresponding path program 2 times [2022-03-15 20:42:31,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:31,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642737993] [2022-03-15 20:42:31,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:31,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:31,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:31,936 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:31,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642737993] [2022-03-15 20:42:31,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642737993] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:31,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101631644] [2022-03-15 20:42:31,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:42:31,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:31,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:31,937 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 20:42:31,938 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 20:42:31,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:42:31,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:31,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:42:31,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:32,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:32,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:32,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101631644] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:32,085 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:32,085 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-15 20:42:32,085 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [689151997] [2022-03-15 20:42:32,085 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:32,086 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:32,090 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 20:42:32,090 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:32,558 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [2404#(or (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 2405#(or (<= a (+ i_1 1)) (< i_3 (+ b a)) (< (+ 2 i_1) a)), 2400#(or (< (+ i_1 1) a) (<= a i_1)), 2397#(< i_1 a), 2402#(or (< (+ i_1 1) a) (<= (+ 2 i_3) (+ b a)) (<= a i_1)), 2398#(or (< i_1 a) (< i_3 (+ b a))), 2403#(or (<= (+ 2 i_3) (+ b a)) (<= (+ b a) i_3)), 2399#(or (< i_1 a) (<= (+ 2 i_3) (+ b a))), 2401#(or (< (+ i_1 1) a) (<= a i_1) (< i_3 (+ b a))), 2406#(or (<= (+ 2 i_3) (+ b a)) (<= a (+ i_1 1)) (< (+ 2 i_1) a))] [2022-03-15 20:42:32,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:42:32,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:32,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:42:32,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:42:32,559 INFO L87 Difference]: Start difference. First operand 133 states and 455 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:33,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:33,022 INFO L93 Difference]: Finished difference Result 307 states and 1064 transitions. [2022-03-15 20:42:33,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 20:42:33,022 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 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 20:42:33,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:33,024 INFO L225 Difference]: With dead ends: 307 [2022-03-15 20:42:33,024 INFO L226 Difference]: Without dead ends: 307 [2022-03-15 20:42:33,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=305, Invalid=1101, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 20:42:33,025 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 113 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:33,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 1 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:42:33,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-03-15 20:42:33,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 211. [2022-03-15 20:42:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 3.742857142857143) internal successors, (786), 210 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 786 transitions. [2022-03-15 20:42:33,031 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 786 transitions. Word has length 14 [2022-03-15 20:42:33,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:33,031 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 786 transitions. [2022-03-15 20:42:33,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:33,032 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 786 transitions. [2022-03-15 20:42:33,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:42:33,032 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:33,032 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:33,050 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 20:42:33,248 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 20:42:33,248 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:33,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:33,249 INFO L85 PathProgramCache]: Analyzing trace with hash -178752373, now seen corresponding path program 1 times [2022-03-15 20:42:33,250 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:33,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541016217] [2022-03-15 20:42:33,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:33,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:33,291 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:33,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541016217] [2022-03-15 20:42:33,291 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541016217] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:33,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654327880] [2022-03-15 20:42:33,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:33,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:33,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:33,292 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 20:42:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:33,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 20:42:33,323 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 20:42:33,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:33,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:33,465 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654327880] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:33,465 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:33,465 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-03-15 20:42:33,465 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [213881599] [2022-03-15 20:42:33,465 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:33,466 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:33,469 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 110 transitions. [2022-03-15 20:42:33,469 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:34,478 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [3260#(< i_2 b), 3284#(or (< (+ i_1 1) a) (<= a i_1) (<= b i_2) (< (+ i_2 1) b)), 3268#(or (< i_1 a) (< i_3 (+ b a))), 3265#(or (< (+ i_1 1) a) (<= a i_1)), 3281#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b i_2) (< (+ i_2 1) b)), 3275#(or (< i_1 a) (<= (+ 2 i_3) (+ b a))), 3286#(or (< (+ i_1 1) a) (<= (+ 2 i_3) (+ b a)) (<= a i_1) (<= b i_2) (< (+ i_2 1) b)), 3272#(or (< i_1 a) (<= b i_2) (< (+ i_2 1) b)), 3277#(or (< i_1 a) (<= (+ 2 i_3) (+ b a)) (< i_2 b)), 3285#(or (< (+ i_1 1) a) (<= a i_1) (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 3267#(or (< i_1 a) (< i_2 b)), 3278#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1)), 3263#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 3264#(< i_1 a), 3271#(or (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 3274#(or (< (+ i_1 1) a) (<= a i_1) (< i_3 (+ b a))), 3269#(or (< i_1 a) (< i_2 b) (< i_3 (+ b a))), 3288#(and (or (< (+ i_1 1) a) (= (+ (* (- 1) i_3) x_2) 0) (<= a i_1)) (or (< (+ i_1 1) a) (<= (+ x_2 1) (+ i_2 a)) (<= a i_1))), 3282#(or (<= (+ 2 i_3) (+ b a)) (<= b i_2) (< (+ i_2 1) b)), 3266#(or (<= (+ 2 i_3) (+ b a)) (< i_2 b)), 3270#(or (<= b i_2) (< (+ i_2 1) b)), 3279#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1) (< i_3 (+ b a))), 3262#(or (<= (+ 2 i_3) (+ b a)) (<= (+ b a) i_3)), 3283#(or (< i_1 a) (<= (+ 2 i_3) (+ b a)) (<= b i_2) (< (+ i_2 1) b)), 3280#(or (< (+ i_1 1) a) (<= (+ 2 i_3) (+ b a)) (< i_2 b) (<= a i_1)), 3287#(and (or (< i_1 a) (= (+ (* (- 1) i_3) x_2) 0)) (or (<= (+ x_2 1) (+ i_2 a)) (< i_1 a))), 3261#(or (< i_2 b) (< i_3 (+ b a))), 3273#(or (< i_1 a) (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 3276#(or (< (+ i_1 1) a) (<= (+ 2 i_3) (+ b a)) (<= a i_1))] [2022-03-15 20:42:34,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 20:42:34,478 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:34,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 20:42:34,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1384, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 20:42:34,479 INFO L87 Difference]: Start difference. First operand 211 states and 786 transitions. Second operand has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 34 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 20:42:35,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:35,991 INFO L93 Difference]: Finished difference Result 378 states and 1323 transitions. [2022-03-15 20:42:35,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-15 20:42:35,996 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 34 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 14 [2022-03-15 20:42:35,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:35,998 INFO L225 Difference]: With dead ends: 378 [2022-03-15 20:42:35,998 INFO L226 Difference]: Without dead ends: 378 [2022-03-15 20:42:36,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1931 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1291, Invalid=6719, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 20:42:36,001 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 436 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:36,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [436 Valid, 1 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:42:36,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-03-15 20:42:36,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 243. [2022-03-15 20:42:36,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 3.8264462809917354) internal successors, (926), 242 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 926 transitions. [2022-03-15 20:42:36,010 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 926 transitions. Word has length 14 [2022-03-15 20:42:36,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:36,010 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 926 transitions. [2022-03-15 20:42:36,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 34 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 20:42:36,010 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 926 transitions. [2022-03-15 20:42:36,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:42:36,010 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:36,011 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:36,026 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 20:42:36,223 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 20:42:36,224 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:36,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:36,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1508922752, now seen corresponding path program 3 times [2022-03-15 20:42:36,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:36,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121127710] [2022-03-15 20:42:36,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:36,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:36,268 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 20:42:36,268 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:36,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121127710] [2022-03-15 20:42:36,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121127710] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:36,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535479406] [2022-03-15 20:42:36,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:42:36,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:36,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:36,269 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 20:42:36,269 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 20:42:36,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 20:42:36,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:36,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:42:36,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:36,392 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 20:42:36,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:36,434 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 20:42:36,434 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535479406] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:36,434 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:36,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-03-15 20:42:36,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [713372537] [2022-03-15 20:42:36,435 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:36,435 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:36,439 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 20:42:36,439 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:36,997 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [4349#(or (< i_1 a) (<= (+ b a) (+ i_3 1))), 4344#(or (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 4360#(or (< i_1 a) (< i_2 b) (<= (+ b a) (+ i_3 1))), 4361#(or (< i_1 a) (<= (+ i_2 a) (+ i_3 1))), 4358#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 4364#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ i_2 a) (+ i_3 1))), 4359#(or (< i_2 b) (<= (+ b a) (+ i_3 1))), 4352#(or (< i_2 b) (< i_3 (+ b a))), 4355#(or (< i_2 b) (<= (+ b a) i_3)), 4342#(< i_3 (+ b a)), 4350#(or (< (+ i_1 1) a) (<= a i_1)), 4346#(< i_1 a), 4351#(or (< (+ i_1 1) a) (<= (+ b a) i_3) (<= a i_1)), 4356#(or (< i_1 a) (< i_2 b) (<= (+ b a) i_3)), 4354#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ b a) (+ i_3 1))), 4345#(< i_2 b), 4353#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 4347#(or (< i_1 a) (< i_2 b)), 4348#(or (< i_1 a) (<= (+ b a) i_3)), 4363#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1) (<= (+ b a) (+ i_3 1))), 4343#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3)), 4362#(or (< (+ i_1 1) a) (< i_2 b) (<= (+ b a) i_3) (<= a i_1)), 4357#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1))] [2022-03-15 20:42:36,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 20:42:36,998 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:36,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 20:42:36,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:42:36,998 INFO L87 Difference]: Start difference. First operand 243 states and 926 transitions. Second operand has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 29 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:38,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:38,097 INFO L93 Difference]: Finished difference Result 422 states and 1366 transitions. [2022-03-15 20:42:38,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 20:42:38,097 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 29 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:42:38,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:38,099 INFO L225 Difference]: With dead ends: 422 [2022-03-15 20:42:38,099 INFO L226 Difference]: Without dead ends: 409 [2022-03-15 20:42:38,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1187, Invalid=4513, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 20:42:38,101 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 202 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:38,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 1 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:42:38,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-03-15 20:42:38,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 265. [2022-03-15 20:42:38,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 3.768939393939394) internal successors, (995), 264 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:38,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 995 transitions. [2022-03-15 20:42:38,107 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 995 transitions. Word has length 14 [2022-03-15 20:42:38,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:38,108 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 995 transitions. [2022-03-15 20:42:38,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 29 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:38,108 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 995 transitions. [2022-03-15 20:42:38,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:42:38,108 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:38,108 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:38,131 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 20:42:38,322 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 20:42:38,323 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:38,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:38,323 INFO L85 PathProgramCache]: Analyzing trace with hash 261958300, now seen corresponding path program 1 times [2022-03-15 20:42:38,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:38,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554100358] [2022-03-15 20:42:38,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:38,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:38,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:38,362 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:38,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554100358] [2022-03-15 20:42:38,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554100358] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:38,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520898969] [2022-03-15 20:42:38,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:38,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:38,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:38,363 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 20:42:38,364 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 20:42:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:38,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:42:38,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:38,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:38,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:38,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520898969] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:38,485 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:38,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-15 20:42:38,486 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [659516522] [2022-03-15 20:42:38,486 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:38,486 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:38,490 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 105 transitions. [2022-03-15 20:42:38,490 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:39,118 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [5492#(or (<= (+ 2 i_3) (+ b a)) (< i_2 b)), 5487#(or (<= b i_2) (< (+ i_2 1) b)), 5494#(or (< (+ 2 i_2) b) (<= b (+ i_2 1)) (< i_3 (+ b a))), 5488#(or (< i_2 b) (< i_3 (+ b a))), 5496#(or (< (+ 2 i_2) b) (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b (+ i_2 1))), 5491#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 5489#(or (<= (+ 2 i_3) (+ b a)) (<= (+ b a) i_3)), 5498#(or (< (+ 2 i_2) b) (<= (+ 2 i_3) (+ b a)) (<= b (+ i_2 1))), 5495#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b i_2) (< (+ i_2 1) b)), 5486#(< i_2 b), 5490#(or (< (+ 2 i_2) b) (<= b (+ i_2 1))), 5497#(or (<= (+ 2 i_3) (+ b a)) (<= b i_2) (< (+ i_2 1) b)), 5493#(or (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a)))] [2022-03-15 20:42:39,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 20:42:39,119 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:39,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 20:42:39,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:42:39,119 INFO L87 Difference]: Start difference. First operand 265 states and 995 transitions. Second operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:39,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:39,565 INFO L93 Difference]: Finished difference Result 597 states and 2234 transitions. [2022-03-15 20:42:39,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 20:42:39,566 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:42:39,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:39,568 INFO L225 Difference]: With dead ends: 597 [2022-03-15 20:42:39,569 INFO L226 Difference]: Without dead ends: 597 [2022-03-15 20:42:39,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=369, Invalid=1271, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 20:42:39,569 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 145 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:39,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 1 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:42:39,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-03-15 20:42:39,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 347. [2022-03-15 20:42:39,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 3.9826589595375723) internal successors, (1378), 346 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:39,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1378 transitions. [2022-03-15 20:42:39,582 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1378 transitions. Word has length 14 [2022-03-15 20:42:39,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:39,582 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 1378 transitions. [2022-03-15 20:42:39,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:39,582 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1378 transitions. [2022-03-15 20:42:39,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:42:39,583 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:39,583 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:39,603 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 20:42:39,795 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 20:42:39,795 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:39,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:39,796 INFO L85 PathProgramCache]: Analyzing trace with hash 354468045, now seen corresponding path program 2 times [2022-03-15 20:42:39,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:39,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991083145] [2022-03-15 20:42:39,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:39,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:39,845 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:39,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991083145] [2022-03-15 20:42:39,845 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991083145] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:39,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488656042] [2022-03-15 20:42:39,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:42:39,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:39,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:39,847 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 20:42:39,847 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 20:42:39,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:42:39,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:39,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:42:39,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:39,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:39,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:39,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488656042] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:39,995 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:39,995 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 12 [2022-03-15 20:42:39,996 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [653439595] [2022-03-15 20:42:39,996 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:39,996 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:39,999 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 102 transitions. [2022-03-15 20:42:40,000 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:40,619 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [6933#(or (<= (+ i_2 1) b) (< i_1 a)), 6917#(or (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 6918#(or (< i_2 b) (< i_3 (+ b a))), 6923#(or (<= (+ 2 i_2) b) (<= b i_2) (< i_3 (+ b a))), 6922#(or (<= (+ 2 i_2) b) (<= b i_2)), 6928#(< i_1 a), 6919#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 6915#(< i_3 (+ b a)), 6916#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3)), 6925#(or (<= b i_2) (<= (+ i_2 a 1) i_3)), 6929#(or (< i_1 a) (< i_3 (+ b a))), 6926#(or (<= (+ b a) (+ i_3 1)) (<= (+ 2 i_2) b) (<= b i_2) (< (+ 2 i_3) (+ b a))), 6927#(or (<= b i_2) (<= (+ i_2 a) i_3)), 6920#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 6930#(or (< (+ i_3 1) (+ b a)) (< i_1 a) (<= (+ b a) i_3)), 6932#(or (<= (+ b a) i_3) (<= (+ i_2 i_1) (+ i_3 1))), 6934#(or (< i_1 a) (<= (+ 2 i_2) b) (<= b i_2)), 6921#(or (<= (+ b a) i_3) (<= (+ i_2 a) (+ i_3 1))), 6924#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= (+ 2 i_2) b) (<= b i_2)), 6931#(or (< i_1 a) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a)))] [2022-03-15 20:42:40,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 20:42:40,619 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:40,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 20:42:40,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:42:40,620 INFO L87 Difference]: Start difference. First operand 347 states and 1378 transitions. Second operand has 27 states, 27 states have (on average 3.037037037037037) internal successors, (82), 26 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:43,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:43,519 INFO L93 Difference]: Finished difference Result 932 states and 3039 transitions. [2022-03-15 20:42:43,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-03-15 20:42:43,519 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.037037037037037) internal successors, (82), 26 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:42:43,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:43,528 INFO L225 Difference]: With dead ends: 932 [2022-03-15 20:42:43,528 INFO L226 Difference]: Without dead ends: 932 [2022-03-15 20:42:43,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4393 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2439, Invalid=12081, Unknown=0, NotChecked=0, Total=14520 [2022-03-15 20:42:43,531 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 489 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:43,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 1 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:42:43,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-03-15 20:42:43,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 423. [2022-03-15 20:42:43,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 4.021327014218009) internal successors, (1697), 422 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:43,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1697 transitions. [2022-03-15 20:42:43,548 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1697 transitions. Word has length 14 [2022-03-15 20:42:43,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:43,550 INFO L470 AbstractCegarLoop]: Abstraction has 423 states and 1697 transitions. [2022-03-15 20:42:43,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.037037037037037) internal successors, (82), 26 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:43,550 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1697 transitions. [2022-03-15 20:42:43,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:42:43,551 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:43,551 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:43,568 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 20:42:43,759 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 20:42:43,760 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:43,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:43,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1709262355, now seen corresponding path program 4 times [2022-03-15 20:42:43,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:43,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696151822] [2022-03-15 20:42:43,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:43,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:43,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:43,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696151822] [2022-03-15 20:42:43,811 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696151822] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:43,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060604342] [2022-03-15 20:42:43,812 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:42:43,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:43,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:43,813 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 20:42:43,814 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 20:42:43,837 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:42:43,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:43,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 20:42:43,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:43,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:44,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060604342] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:44,040 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:44,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 3] total 9 [2022-03-15 20:42:44,041 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [936335735] [2022-03-15 20:42:44,041 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:44,041 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:44,045 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 118 transitions. [2022-03-15 20:42:44,045 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:44,734 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [8985#(and (<= (+ x_2 x_1 (* 2 c)) x_3) (< x_3 (+ x_2 x_1 (* 2 c) 1))), 8984#(and (< x_3 (+ x_2 x_1 c 1)) (<= (+ x_2 x_1 c) x_3))] [2022-03-15 20:42:44,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:42:44,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:44,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:42:44,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:42:44,734 INFO L87 Difference]: Start difference. First operand 423 states and 1697 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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 20:42:44,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:44,879 INFO L93 Difference]: Finished difference Result 775 states and 2810 transitions. [2022-03-15 20:42:44,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 20:42:44,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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 15 [2022-03-15 20:42:44,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:44,883 INFO L225 Difference]: With dead ends: 775 [2022-03-15 20:42:44,883 INFO L226 Difference]: Without dead ends: 771 [2022-03-15 20:42:44,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:42:44,883 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 22 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:44,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 1 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:44,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2022-03-15 20:42:44,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 537. [2022-03-15 20:42:44,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 4.093283582089552) internal successors, (2194), 536 states have internal predecessors, (2194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:44,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 2194 transitions. [2022-03-15 20:42:44,896 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 2194 transitions. Word has length 15 [2022-03-15 20:42:44,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:44,897 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 2194 transitions. [2022-03-15 20:42:44,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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 20:42:44,897 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 2194 transitions. [2022-03-15 20:42:44,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:42:44,898 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:44,898 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:44,914 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 20:42:45,107 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 20:42:45,107 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:45,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:45,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1992438982, now seen corresponding path program 3 times [2022-03-15 20:42:45,108 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:45,108 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344364850] [2022-03-15 20:42:45,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:45,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:45,136 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:45,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344364850] [2022-03-15 20:42:45,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344364850] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:45,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213225582] [2022-03-15 20:42:45,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:42:45,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:45,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:45,140 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 20:42:45,142 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 20:42:45,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 20:42:45,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:45,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:42:45,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:45,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:45,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213225582] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:45,252 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:45,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2022-03-15 20:42:45,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1610704010] [2022-03-15 20:42:45,252 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:45,253 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:45,257 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 131 transitions. [2022-03-15 20:42:45,257 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:45,913 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [10942#(or (< (+ 3 i_2) b) (<= b (+ 2 i_2))), 10944#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (< (+ 3 i_2) b) (<= b (+ 2 i_2))), 10933#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 10938#(or (<= (+ 2 i_3) (+ i_2 a)) (<= (+ b a) i_3)), 10945#(or (<= (+ b a) i_3) (<= (+ i_3 1) (+ i_2 a))), 10940#(or (< (+ 2 i_2) b) (<= b (+ i_2 1)) (< i_3 (+ b a))), 10948#(<= b (+ 2 i_2)), 10934#(or (<= (+ b a) i_3) (<= (+ 3 i_3) (+ b a))), 10941#(or (< (+ 2 i_2) b) (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b (+ i_2 1))), 10931#(< i_2 b), 10905#(< i_3 (+ b a)), 10936#(or (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 10939#(or (< (+ 2 i_2) b) (<= b (+ i_2 1))), 10947#(<= b (+ i_2 1)), 10930#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3)), 10946#(<= b i_2), 10937#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b i_2) (< (+ i_2 1) b)), 10935#(or (<= b i_2) (< (+ i_2 1) b)), 10932#(or (< i_2 b) (< i_3 (+ b a))), 10943#(or (< (+ 3 i_2) b) (< i_3 (+ b a)) (<= b (+ 2 i_2)))] [2022-03-15 20:42:45,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 20:42:45,913 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:45,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 20:42:45,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:42:45,914 INFO L87 Difference]: Start difference. First operand 537 states and 2194 transitions. Second operand has 27 states, 27 states have (on average 3.111111111111111) internal successors, (84), 26 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 20:42:46,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:46,486 INFO L93 Difference]: Finished difference Result 1251 states and 4715 transitions. [2022-03-15 20:42:46,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 20:42:46,487 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.111111111111111) internal successors, (84), 26 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 15 [2022-03-15 20:42:46,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:46,492 INFO L225 Difference]: With dead ends: 1251 [2022-03-15 20:42:46,492 INFO L226 Difference]: Without dead ends: 1235 [2022-03-15 20:42:46,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=566, Invalid=1884, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 20:42:46,493 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 397 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:46,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 1 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:42:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2022-03-15 20:42:46,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 663. [2022-03-15 20:42:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 4.070996978851964) internal successors, (2695), 662 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 2695 transitions. [2022-03-15 20:42:46,512 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 2695 transitions. Word has length 15 [2022-03-15 20:42:46,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:46,512 INFO L470 AbstractCegarLoop]: Abstraction has 663 states and 2695 transitions. [2022-03-15 20:42:46,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.111111111111111) internal successors, (84), 26 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 20:42:46,513 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 2695 transitions. [2022-03-15 20:42:46,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:42:46,514 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:46,514 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:46,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:46,733 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 20:42:46,733 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:46,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:46,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1755594583, now seen corresponding path program 5 times [2022-03-15 20:42:46,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:46,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405647023] [2022-03-15 20:42:46,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:46,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:46,767 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:46,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:46,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405647023] [2022-03-15 20:42:46,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405647023] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:46,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317073560] [2022-03-15 20:42:46,767 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:42:46,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:46,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:46,768 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 20:42:46,769 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 20:42:46,790 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:42:46,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:46,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 20:42:46,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:46,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:46,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:46,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317073560] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:46,882 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:46,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-03-15 20:42:46,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [42869434] [2022-03-15 20:42:46,882 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:46,883 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:46,887 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 20:42:46,887 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:47,391 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [13664#(or (< (+ i_1 1) a) (<= a i_1)), 13665#(or (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 13663#(< i_1 a), 13668#(or (<= (+ b a) i_3) (<= (+ 3 i_3) (+ b a))), 13666#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1))), 13634#(< i_3 (+ b a)), 13670#(or (<= (+ i_3 1) (+ i_1 b)) (<= (+ b a) i_3)), 13667#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3)), 13669#(or (<= (+ b a) i_3) (<= (+ 2 i_3) (+ i_1 b)))] [2022-03-15 20:42:47,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:42:47,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:47,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:42:47,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:42:47,392 INFO L87 Difference]: Start difference. First operand 663 states and 2695 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:48,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:48,128 INFO L93 Difference]: Finished difference Result 2082 states and 7733 transitions. [2022-03-15 20:42:48,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 20:42:48,128 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:42:48,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:48,138 INFO L225 Difference]: With dead ends: 2082 [2022-03-15 20:42:48,138 INFO L226 Difference]: Without dead ends: 2082 [2022-03-15 20:42:48,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=468, Invalid=1694, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 20:42:48,140 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 236 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:48,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 1 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:42:48,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2022-03-15 20:42:48,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 761. [2022-03-15 20:42:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 760 states have (on average 4.05) internal successors, (3078), 760 states have internal predecessors, (3078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:48,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 3078 transitions. [2022-03-15 20:42:48,166 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 3078 transitions. Word has length 15 [2022-03-15 20:42:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:48,166 INFO L470 AbstractCegarLoop]: Abstraction has 761 states and 3078 transitions. [2022-03-15 20:42:48,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 3078 transitions. [2022-03-15 20:42:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:42:48,168 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:48,168 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:48,189 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 20:42:48,375 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 20:42:48,376 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:48,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:48,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1110855217, now seen corresponding path program 2 times [2022-03-15 20:42:48,377 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:48,377 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138021290] [2022-03-15 20:42:48,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:48,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:48,432 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:48,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138021290] [2022-03-15 20:42:48,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138021290] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:48,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409412599] [2022-03-15 20:42:48,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:42:48,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:48,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:48,433 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 20:42:48,434 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 20:42:48,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:42:48,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:48,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:42:48,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:48,602 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:48,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:48,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:48,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409412599] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:48,655 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:48,655 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-03-15 20:42:48,655 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [743257618] [2022-03-15 20:42:48,655 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:48,656 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:48,685 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 180 transitions. [2022-03-15 20:42:48,685 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:50,651 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 53 new interpolants: [17479#(or (<= (+ b a) (+ i_3 1)) (<= b i_2) (<= (+ 3 i_3) (+ b a)) (< (+ i_2 1) b)), 17461#(or (<= (+ 2 i_3) (+ b a)) (<= b i_2) (< (+ i_2 1) b)), 17450#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1) (< i_3 (+ b a))), 17434#(or (<= (+ 2 i_3) (+ b a)) (<= (+ b a) i_3)), 17438#(or (< i_1 a) (<= (+ 2 i_3) (+ b a))), 17462#(or (< i_1 a) (<= b i_2) (< (+ i_2 1) b)), 17483#(and (or (< i_1 a) (= (+ (* (- 1) i_3) x_2) 0)) (or (< i_1 a) (<= (+ 2 x_2) (+ i_2 a)))), 17484#(and (or (< (+ i_1 1) a) (= (+ (* (- 1) i_3) x_2) 0) (<= a i_1)) (or (< (+ i_1 1) a) (<= a i_1) (<= (+ 2 x_2) (+ i_2 a)))), 17474#(or (< i_1 a) (< i_2 b) (<= (+ 3 i_3) (+ b a))), 17442#(or (<= (+ 2 i_3) (+ b a)) (< i_2 b)), 17486#(and (or (<= a (+ i_1 1)) (<= (+ 2 x_2) (+ i_2 a)) (< (+ 2 i_1) a)) (or (= (+ (* (- 1) i_3) x_2) 0) (<= a (+ i_1 1)) (< (+ 2 i_1) a))), 17452#(or (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 17477#(or (<= a (+ i_1 1)) (<= (+ 3 i_3) (+ b a)) (< (+ 2 i_1) a)), 17465#(or (< (+ i_1 1) a) (<= a i_1) (<= b i_2) (< (+ i_2 1) b)), 17485#(or (<= b i_2) (<= a (+ i_1 1)) (<= (+ 3 i_3) (+ b a)) (< (+ i_2 1) b) (< (+ 2 i_1) a)), 17441#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 17443#(or (< i_1 a) (< i_2 b)), 17468#(or (<= b i_2) (<= a (+ i_1 1)) (< (+ i_2 1) b) (< (+ 2 i_1) a)), 17440#(or (< i_2 b) (< i_3 (+ b a))), 17444#(or (< i_1 a) (< i_2 b) (< i_3 (+ b a))), 17436#(< i_1 a), 17464#(or (< i_1 a) (<= (+ 2 i_3) (+ b a)) (<= b i_2) (< (+ i_2 1) b)), 17457#(or (<= (+ 2 i_3) (+ b a)) (< i_2 b) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 17473#(or (< i_1 a) (<= (+ 3 i_3) (+ b a))), 17481#(or (< i_1 a) (<= b i_2) (<= (+ 3 i_3) (+ b a)) (< (+ i_2 1) b)), 17449#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1)), 17466#(or (< (+ i_1 1) a) (<= a i_1) (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 17454#(or (<= (+ 2 i_3) (+ b a)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 17453#(or (<= a (+ i_1 1)) (< i_3 (+ b a)) (< (+ 2 i_1) a)), 17482#(or (< (+ i_1 1) a) (<= a i_1) (<= b i_2) (<= (+ 3 i_3) (+ b a)) (< (+ i_2 1) b)), 17448#(or (< (+ i_1 1) a) (<= (+ 2 i_3) (+ b a)) (<= a i_1)), 17475#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ 3 i_3) (+ b a))), 17459#(or (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 17480#(or (<= b i_2) (<= (+ 3 i_3) (+ b a)) (< (+ i_2 1) b)), 17469#(or (<= b i_2) (<= a (+ i_1 1)) (< (+ i_2 1) b) (< i_3 (+ b a)) (< (+ 2 i_1) a)), 17470#(or (<= (+ 2 i_3) (+ b a)) (<= b i_2) (<= a (+ i_1 1)) (< (+ i_2 1) b) (< (+ 2 i_1) a)), 17458#(or (<= b i_2) (< (+ i_2 1) b)), 17437#(or (< i_1 a) (< i_3 (+ b a))), 17476#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1) (<= (+ 3 i_3) (+ b a))), 17446#(or (< (+ i_1 1) a) (<= a i_1)), 17451#(or (< (+ i_1 1) a) (<= (+ 2 i_3) (+ b a)) (< i_2 b) (<= a i_1)), 17478#(or (< i_2 b) (<= a (+ i_1 1)) (<= (+ 3 i_3) (+ b a)) (< (+ 2 i_1) a)), 17447#(or (< (+ i_1 1) a) (<= a i_1) (< i_3 (+ b a))), 17471#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 17439#(< i_2 b), 17435#(or (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 17463#(or (< i_1 a) (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 17460#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b i_2) (< (+ i_2 1) b)), 17456#(or (< i_2 b) (<= a (+ i_1 1)) (< i_3 (+ b a)) (< (+ 2 i_1) a)), 17472#(or (< i_2 b) (<= (+ 3 i_3) (+ b a))), 17445#(or (< i_1 a) (<= (+ 2 i_3) (+ b a)) (< i_2 b)), 17455#(or (< i_2 b) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 17467#(or (< (+ i_1 1) a) (<= (+ 2 i_3) (+ b a)) (<= a i_1) (<= b i_2) (< (+ i_2 1) b))] [2022-03-15 20:42:50,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 20:42:50,652 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:50,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 20:42:50,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=4228, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 20:42:50,653 INFO L87 Difference]: Start difference. First operand 761 states and 3078 transitions. Second operand has 61 states, 61 states have (on average 2.6885245901639343) internal successors, (164), 60 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:57,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:57,339 INFO L93 Difference]: Finished difference Result 1660 states and 6422 transitions. [2022-03-15 20:42:57,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2022-03-15 20:42:57,340 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.6885245901639343) internal successors, (164), 60 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:42:57,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:57,347 INFO L225 Difference]: With dead ends: 1660 [2022-03-15 20:42:57,347 INFO L226 Difference]: Without dead ends: 1656 [2022-03-15 20:42:57,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20636 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9102, Invalid=49704, Unknown=0, NotChecked=0, Total=58806 [2022-03-15 20:42:57,353 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1115 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 3144 mSolverCounterSat, 1113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 4257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1113 IncrementalHoareTripleChecker+Valid, 3144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:57,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1115 Valid, 1 Invalid, 4257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1113 Valid, 3144 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 20:42:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2022-03-15 20:42:57,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 967. [2022-03-15 20:42:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 966 states have (on average 4.142857142857143) internal successors, (4002), 966 states have internal predecessors, (4002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:57,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 4002 transitions. [2022-03-15 20:42:57,380 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 4002 transitions. Word has length 16 [2022-03-15 20:42:57,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:57,381 INFO L470 AbstractCegarLoop]: Abstraction has 967 states and 4002 transitions. [2022-03-15 20:42:57,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.6885245901639343) internal successors, (164), 60 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:57,381 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 4002 transitions. [2022-03-15 20:42:57,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:42:57,384 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:57,385 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:57,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-15 20:42:57,599 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 20:42:57,599 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:57,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:57,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1469720868, now seen corresponding path program 6 times [2022-03-15 20:42:57,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:57,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603456809] [2022-03-15 20:42:57,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:57,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:57,645 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:57,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:57,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603456809] [2022-03-15 20:42:57,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603456809] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:57,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458007268] [2022-03-15 20:42:57,646 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:42:57,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:57,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:57,647 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 20:42:57,648 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 20:42:57,669 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 20:42:57,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:57,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:42:57,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:57,799 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:57,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:57,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458007268] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:57,839 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:57,839 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-03-15 20:42:57,839 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [967038545] [2022-03-15 20:42:57,839 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:57,840 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:57,845 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 20:42:57,845 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:58,951 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 39 new interpolants: [21541#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 21567#(or (<= (+ i_2 a) (+ 2 i_3)) (< (+ i_1 1) a) (<= a i_1)), 21535#(< i_1 a), 21556#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3))), 21572#(or (<= (+ i_2 a) (+ 2 i_3)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 21561#(or (< i_2 b) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 21534#(< i_3 (+ b a)), 21566#(or (<= (+ i_2 a) (+ 2 i_3)) (< i_1 a)), 21546#(or (< i_1 a) (< i_2 b)), 21569#(or (<= (+ b a) (+ 2 i_3)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 21547#(or (< i_1 a) (< i_2 b) (<= (+ b a) i_3)), 21570#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 21548#(or (< i_1 a) (< i_2 b) (<= (+ b a) (+ i_3 1))), 21553#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ b a) (+ i_3 1))), 21563#(or (< i_2 b) (<= (+ b a) i_3) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 21550#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1)), 21555#(or (< i_1 a) (<= (+ b a) (+ 2 i_3))), 21551#(or (< (+ i_1 1) a) (<= (+ b a) i_3) (<= a i_1)), 21542#(or (< i_2 b) (<= (+ b a) i_3)), 21544#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 21557#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 21545#(or (< i_2 b) (<= (+ b a) (+ i_3 1))), 21537#(or (< i_1 a) (<= (+ b a) (+ i_3 1))), 21536#(or (< i_1 a) (<= (+ b a) i_3)), 21564#(or (< (+ i_1 1) a) (<= (+ b a) (+ 2 i_3)) (<= a i_1)), 21559#(or (< i_1 a) (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 21554#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1) (<= (+ b a) (+ i_3 1))), 21560#(or (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 21552#(or (< (+ i_1 1) a) (< i_2 b) (<= (+ b a) i_3) (<= a i_1)), 21540#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3)), 21538#(< i_2 b), 21568#(or (<= (+ b a) (+ i_3 1)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 21562#(or (<= (+ b a) i_3) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 21571#(or (<= (+ b a) (+ 2 i_3)) (< i_2 b) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 21539#(or (< i_2 b) (< i_3 (+ b a))), 21543#(or (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 21565#(or (< (+ i_1 1) a) (<= (+ b a) (+ 2 i_3)) (< i_2 b) (<= a i_1)), 21549#(or (< (+ i_1 1) a) (<= a i_1)), 21558#(or (<= (+ b a) (+ 2 i_3)) (< i_2 b))] [2022-03-15 20:42:58,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-15 20:42:58,952 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:58,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-15 20:42:58,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=2656, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 20:42:58,953 INFO L87 Difference]: Start difference. First operand 967 states and 4002 transitions. Second operand has 48 states, 48 states have (on average 2.6041666666666665) internal successors, (125), 47 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 20:43:03,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:03,883 INFO L93 Difference]: Finished difference Result 3625 states and 13355 transitions. [2022-03-15 20:43:03,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2022-03-15 20:43:03,884 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.6041666666666665) internal successors, (125), 47 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 16 [2022-03-15 20:43:03,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:03,900 INFO L225 Difference]: With dead ends: 3625 [2022-03-15 20:43:03,900 INFO L226 Difference]: Without dead ends: 3571 [2022-03-15 20:43:03,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14297 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=8686, Invalid=34370, Unknown=0, NotChecked=0, Total=43056 [2022-03-15 20:43:03,903 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 574 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:03,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [574 Valid, 1 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:43:03,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2022-03-15 20:43:03,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 1647. [2022-03-15 20:43:03,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1646 states have (on average 4.365735115431349) internal successors, (7186), 1646 states have internal predecessors, (7186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 7186 transitions. [2022-03-15 20:43:03,972 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 7186 transitions. Word has length 16 [2022-03-15 20:43:03,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:03,972 INFO L470 AbstractCegarLoop]: Abstraction has 1647 states and 7186 transitions. [2022-03-15 20:43:03,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.6041666666666665) internal successors, (125), 47 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 20:43:03,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 7186 transitions. [2022-03-15 20:43:03,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:43:03,976 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:03,976 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:04,003 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 20:43:04,191 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 20:43:04,191 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:04,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:04,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1887984192, now seen corresponding path program 3 times [2022-03-15 20:43:04,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:04,192 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254488589] [2022-03-15 20:43:04,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:04,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:04,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:04,254 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:04,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254488589] [2022-03-15 20:43:04,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254488589] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:04,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133671533] [2022-03-15 20:43:04,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:43:04,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:04,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:04,256 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 20:43:04,256 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 20:43:04,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 20:43:04,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:04,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:43:04,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:04,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:04,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:04,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133671533] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:04,482 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:04,482 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-03-15 20:43:04,482 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2135401548] [2022-03-15 20:43:04,482 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:04,483 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:04,489 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 189 transitions. [2022-03-15 20:43:04,490 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:06,475 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 56 new interpolants: [28928#(or (<= (+ 2 i_3) (+ b a)) (<= b i_2) (< (+ i_2 1) b)), 28947#(or (< (+ 2 i_2) b) (< i_1 a) (<= b (+ i_2 1)) (< i_3 (+ b a))), 28934#(or (< i_1 a) (<= b i_2) (< (+ i_2 1) b)), 28912#(or (< i_1 a) (< i_2 b)), 28919#(or (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 28957#(and (or (< (+ i_1 1) a) (= (+ (* (- 1) i_3) x_2) 0) (<= a i_1)) (or (< (+ i_1 1) a) (<= (+ x_2 1) (+ i_2 a)) (<= a i_1))), 28923#(or (< (+ 2 i_2) b) (<= b (+ i_2 1)) (< i_3 (+ b a))), 28946#(or (< (+ 2 i_2) b) (< i_1 a) (<= b (+ i_2 1))), 28915#(or (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 28937#(or (< (+ i_1 1) a) (<= a i_1) (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 28951#(or (< (+ 2 i_2) b) (< (+ i_1 1) a) (<= a i_1) (<= b (+ i_2 1)) (< i_3 (+ b a))), 28911#(or (< i_2 b) (< i_3 (+ b a))), 28918#(or (<= b i_2) (< (+ i_2 1) b)), 28931#(or (< (+ 2 i_2) b) (<= b (+ i_2 1)) (<= (+ 3 i_3) (+ b a))), 28929#(or (<= b i_2) (<= (+ 3 i_3) (+ b a)) (< (+ i_2 1) b)), 28925#(or (< (+ 2 i_2) b) (<= (+ b a) (+ i_3 1)) (<= b (+ i_2 1)) (< (+ 2 i_3) (+ b a))), 28907#(or (< (+ i_1 1) a) (<= a i_1) (< i_3 (+ b a))), 28936#(or (< i_1 a) (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 28926#(or (<= (+ 2 i_3) (+ b a)) (< i_2 b)), 28932#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1)), 28920#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b i_2) (< (+ i_2 1) b)), 28954#(or (< (+ i_1 1) a) (<= a i_1) (<= b i_2) (<= (+ 3 i_3) (+ b a)) (< (+ i_2 1) b)), 28950#(or (< (+ 2 i_2) b) (< (+ i_1 1) a) (<= a i_1) (<= b (+ i_2 1))), 28943#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1) (<= (+ 3 i_3) (+ b a))), 28935#(or (< (+ i_1 1) a) (<= a i_1) (<= b i_2) (< (+ i_2 1) b)), 28903#(or (< i_1 a) (< i_3 (+ b a))), 28948#(or (< (+ 2 i_2) b) (< i_1 a) (<= (+ 2 i_3) (+ b a)) (<= b (+ i_2 1))), 28916#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 28945#(or (<= (+ 2 i_3) (+ i_2 a)) (< i_1 a)), 28949#(or (< (+ 2 i_2) b) (< i_1 a) (<= b (+ i_2 1)) (<= (+ 3 i_3) (+ b a))), 28944#(or (< i_1 a) (<= b i_2) (<= (+ 3 i_3) (+ b a)) (< (+ i_2 1) b)), 28955#(or (< (+ i_1 1) a) (<= (+ 2 i_3) (+ i_2 a)) (<= a i_1)), 28927#(or (< i_2 b) (<= (+ 3 i_3) (+ b a))), 28942#(or (< i_1 a) (< i_2 b) (<= (+ 3 i_3) (+ b a))), 28914#(or (<= (+ 2 i_3) (+ b a)) (<= (+ b a) i_3)), 28953#(and (or (< i_1 a) (= (+ (* (- 1) i_3) x_2) 0)) (or (<= (+ x_2 1) (+ i_2 a)) (< i_1 a))), 28917#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 28938#(or (< i_1 a) (<= (+ 2 i_3) (+ b a)) (< i_2 b)), 28910#(< i_2 b), 28952#(or (< (+ 2 i_2) b) (< (+ i_1 1) a) (<= (+ 2 i_3) (+ b a)) (<= a i_1) (<= b (+ i_2 1))), 28909#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ 3 i_3) (+ b a))), 28921#(or (<= (+ b a) (+ i_3 1)) (<= b i_2) (<= (+ 3 i_3) (+ b a)) (< (+ i_2 1) b)), 28906#(or (< (+ i_1 1) a) (<= a i_1)), 28956#(or (< (+ 2 i_2) b) (< (+ i_1 1) a) (<= a i_1) (<= b (+ i_2 1)) (<= (+ 3 i_3) (+ b a))), 28922#(or (< (+ 2 i_2) b) (<= b (+ i_2 1))), 28908#(or (< (+ i_1 1) a) (<= (+ 2 i_3) (+ b a)) (<= a i_1)), 28941#(or (< (+ i_1 1) a) (<= (+ 2 i_3) (+ b a)) (<= a i_1) (<= b i_2) (< (+ i_2 1) b)), 28939#(or (< i_1 a) (<= (+ 2 i_3) (+ b a)) (<= b i_2) (< (+ i_2 1) b)), 28940#(or (< (+ i_1 1) a) (<= (+ 2 i_3) (+ b a)) (< i_2 b) (<= a i_1)), 28924#(or (< (+ 2 i_2) b) (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b (+ i_2 1))), 28904#(or (< i_1 a) (<= (+ 2 i_3) (+ b a))), 28913#(or (< i_1 a) (< i_2 b) (< i_3 (+ b a))), 28933#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1) (< i_3 (+ b a))), 28902#(< i_1 a), 28905#(or (< i_1 a) (<= (+ 3 i_3) (+ b a))), 28930#(or (< (+ 2 i_2) b) (<= (+ 2 i_3) (+ b a)) (<= b (+ i_2 1)))] [2022-03-15 20:43:06,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-03-15 20:43:06,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:06,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-03-15 20:43:06,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=4442, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 20:43:06,476 INFO L87 Difference]: Start difference. First operand 1647 states and 7186 transitions. Second operand has 64 states, 64 states have (on average 2.6875) internal successors, (172), 63 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:13,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:13,196 INFO L93 Difference]: Finished difference Result 2951 states and 12030 transitions. [2022-03-15 20:43:13,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2022-03-15 20:43:13,196 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.6875) internal successors, (172), 63 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:43:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:13,212 INFO L225 Difference]: With dead ends: 2951 [2022-03-15 20:43:13,213 INFO L226 Difference]: Without dead ends: 2913 [2022-03-15 20:43:13,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22486 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9666, Invalid=54596, Unknown=0, NotChecked=0, Total=64262 [2022-03-15 20:43:13,215 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1206 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 3731 mSolverCounterSat, 1299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 5030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1299 IncrementalHoareTripleChecker+Valid, 3731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:13,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1206 Valid, 1 Invalid, 5030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1299 Valid, 3731 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 20:43:13,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2022-03-15 20:43:13,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2019. [2022-03-15 20:43:13,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 2018 states have (on average 4.3681863230921705) internal successors, (8815), 2018 states have internal predecessors, (8815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:13,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 8815 transitions. [2022-03-15 20:43:13,262 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 8815 transitions. Word has length 16 [2022-03-15 20:43:13,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:13,263 INFO L470 AbstractCegarLoop]: Abstraction has 2019 states and 8815 transitions. [2022-03-15 20:43:13,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.6875) internal successors, (172), 63 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:13,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 8815 transitions. [2022-03-15 20:43:13,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:43:13,268 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:13,268 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:13,286 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 20:43:13,473 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 20:43:13,473 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:13,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:13,474 INFO L85 PathProgramCache]: Analyzing trace with hash -692591893, now seen corresponding path program 4 times [2022-03-15 20:43:13,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:13,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195636105] [2022-03-15 20:43:13,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:13,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:13,534 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:13,535 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:13,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195636105] [2022-03-15 20:43:13,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195636105] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:13,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964462780] [2022-03-15 20:43:13,535 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:43:13,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:13,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:13,536 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 20:43:13,536 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 20:43:13,557 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:43:13,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:13,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:43:13,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:13,689 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:13,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:13,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964462780] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:13,737 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:13,737 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-03-15 20:43:13,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [625331593] [2022-03-15 20:43:13,738 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:13,738 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:13,744 INFO L252 McrAutomatonBuilder]: Finished intersection with 81 states and 172 transitions. [2022-03-15 20:43:13,744 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:15,351 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 48 new interpolants: [36452#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ b a) (+ i_3 1)) (<= b i_2) (< (+ i_2 1) b)), 36428#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1)), 36429#(< i_3 (+ b a)), 36447#(or (<= (+ b a) (+ i_3 1)) (<= b i_2) (< (+ i_2 1) b) (< (+ 2 i_3) (+ b a))), 36464#(or (<= (+ i_2 a) (+ 2 i_3)) (< i_1 a)), 36465#(or (<= (+ i_2 a) (+ 2 i_3)) (< (+ i_1 1) a) (<= a i_1)), 36467#(and (or (< (+ i_1 1) a) (<= (+ i_2 a) (+ x_2 1)) (<= a i_1)) (or (< (+ i_1 1) a) (= (+ (* (- 1) i_3) x_2) 0) (<= a i_1))), 36448#(or (<= (+ b a) (+ i_3 1)) (<= b i_2) (< (+ i_2 1) b)), 36463#(or (< (+ i_1 1) a) (<= (+ b a) (+ 2 i_3)) (<= a i_1) (<= b i_2) (< (+ i_2 1) b)), 36437#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 36461#(or (< (+ i_1 1) a) (<= (+ b a) (+ 2 i_3)) (<= a i_1)), 36449#(or (< i_1 a) (<= (+ b a) (+ i_3 1)) (<= b i_2) (< (+ i_2 1) b)), 36454#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3))), 36438#(or (< i_2 b) (<= (+ b a) (+ i_3 1))), 36434#(or (< i_1 a) (< i_2 b) (<= (+ b a) i_3)), 36446#(or (< i_1 a) (<= (+ b a) i_3) (<= b i_2) (< (+ i_2 1) b)), 36444#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b i_2) (< (+ i_2 1) b)), 36466#(and (or (< i_1 a) (= (+ (* (- 1) i_3) x_2) 0)) (or (< i_1 a) (<= (+ i_2 a) (+ x_2 1)))), 36426#(< i_2 b), 36436#(or (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 36457#(or (< i_1 a) (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 36440#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1) (<= (+ b a) (+ i_3 1))), 36456#(or (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 36420#(< i_1 a), 36421#(or (< i_1 a) (<= (+ b a) i_3)), 36422#(or (< i_1 a) (<= (+ b a) (+ i_3 1))), 36458#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= b i_2) (< (+ i_2 1) b)), 36435#(or (< (+ i_1 1) a) (< i_2 b) (<= (+ b a) i_3) (<= a i_1)), 36430#(or (< i_2 b) (< i_3 (+ b a))), 36427#(or (< i_1 a) (< i_2 b)), 36445#(or (<= (+ b a) i_3) (<= b i_2) (< (+ i_2 1) b)), 36441#(or (<= b i_2) (< (+ i_2 1) b)), 36442#(or (< i_1 a) (<= b i_2) (< (+ i_2 1) b)), 36462#(or (< (+ i_1 1) a) (<= (+ b a) (+ 2 i_3)) (< i_2 b) (<= a i_1)), 36455#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 36424#(or (< (+ i_1 1) a) (<= (+ b a) i_3) (<= a i_1)), 36425#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ b a) (+ i_3 1))), 36432#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 36450#(or (< (+ i_1 1) a) (<= a i_1) (<= b i_2) (< (+ i_2 1) b)), 36431#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3)), 36423#(or (< (+ i_1 1) a) (<= a i_1)), 36453#(or (< i_1 a) (<= (+ b a) (+ 2 i_3))), 36433#(or (< i_2 b) (<= (+ b a) i_3)), 36459#(or (<= (+ b a) (+ 2 i_3)) (<= b i_2) (< (+ i_2 1) b)), 36460#(or (< i_1 a) (<= (+ b a) (+ 2 i_3)) (<= b i_2) (< (+ i_2 1) b)), 36443#(or (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 36451#(or (< (+ i_1 1) a) (<= (+ b a) i_3) (<= a i_1) (<= b i_2) (< (+ i_2 1) b)), 36439#(or (< i_1 a) (< i_2 b) (<= (+ b a) (+ i_3 1)))] [2022-03-15 20:43:15,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-03-15 20:43:15,365 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:15,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-03-15 20:43:15,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=568, Invalid=3854, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 20:43:15,365 INFO L87 Difference]: Start difference. First operand 2019 states and 8815 transitions. Second operand has 57 states, 57 states have (on average 2.6666666666666665) internal successors, (152), 56 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:19,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:19,719 INFO L93 Difference]: Finished difference Result 2778 states and 11184 transitions. [2022-03-15 20:43:19,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-03-15 20:43:19,719 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.6666666666666665) internal successors, (152), 56 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:43:19,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:19,728 INFO L225 Difference]: With dead ends: 2778 [2022-03-15 20:43:19,728 INFO L226 Difference]: Without dead ends: 2729 [2022-03-15 20:43:19,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9331 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5381, Invalid=27561, Unknown=0, NotChecked=0, Total=32942 [2022-03-15 20:43:19,730 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 846 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 2195 mSolverCounterSat, 630 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 630 IncrementalHoareTripleChecker+Valid, 2195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:19,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [846 Valid, 1 Invalid, 2825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [630 Valid, 2195 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:43:19,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2022-03-15 20:43:19,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 1993. [2022-03-15 20:43:19,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1993 states, 1992 states have (on average 4.383032128514056) internal successors, (8731), 1992 states have internal predecessors, (8731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 8731 transitions. [2022-03-15 20:43:19,775 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 8731 transitions. Word has length 16 [2022-03-15 20:43:19,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:19,775 INFO L470 AbstractCegarLoop]: Abstraction has 1993 states and 8731 transitions. [2022-03-15 20:43:19,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.6666666666666665) internal successors, (152), 56 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:19,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 8731 transitions. [2022-03-15 20:43:19,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:43:19,780 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:19,780 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:19,796 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 20:43:19,996 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 20:43:19,997 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:19,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:19,997 INFO L85 PathProgramCache]: Analyzing trace with hash 79787518, now seen corresponding path program 7 times [2022-03-15 20:43:19,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:19,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152847008] [2022-03-15 20:43:19,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:19,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:20,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:20,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:20,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152847008] [2022-03-15 20:43:20,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152847008] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:20,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452185801] [2022-03-15 20:43:20,028 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:43:20,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:20,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:20,029 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 20:43:20,030 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 20:43:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:20,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:43:20,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:20,117 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:20,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:20,143 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452185801] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:20,143 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:20,143 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-03-15 20:43:20,143 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1312911611] [2022-03-15 20:43:20,143 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:20,144 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:20,149 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 20:43:20,149 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:20,764 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [43563#(or (<= (+ 2 i_3) (+ b a)) (<= (+ b a) i_3)), 43569#(or (<= (+ b a) i_3) (<= i_3 (+ i_1 b))), 43570#(or (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 43572#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1))), 43568#(or (<= (+ b a) (+ i_3 1)) (<= (+ 2 i_3) (+ i_1 b))), 43565#(or (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 43566#(< i_1 a), 43567#(or (< (+ i_1 1) a) (<= a i_1)), 43564#(or (<= (+ i_3 1) (+ i_1 b)) (<= (+ b a) i_3)), 43571#(or (<= (+ i_3 1) (+ i_1 b)) (<= (+ b a) (+ i_3 1)))] [2022-03-15 20:43:20,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 20:43:20,764 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:20,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 20:43:20,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:43:20,764 INFO L87 Difference]: Start difference. First operand 1993 states and 8731 transitions. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:21,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:21,927 INFO L93 Difference]: Finished difference Result 5068 states and 20141 transitions. [2022-03-15 20:43:21,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 20:43:21,927 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:43:21,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:21,941 INFO L225 Difference]: With dead ends: 5068 [2022-03-15 20:43:21,941 INFO L226 Difference]: Without dead ends: 5068 [2022-03-15 20:43:21,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 66 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=647, Invalid=2323, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 20:43:21,942 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 316 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:21,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 1 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:43:21,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5068 states. [2022-03-15 20:43:22,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5068 to 2297. [2022-03-15 20:43:22,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2297 states, 2296 states have (on average 4.444686411149826) internal successors, (10205), 2296 states have internal predecessors, (10205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:22,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2297 states to 2297 states and 10205 transitions. [2022-03-15 20:43:22,024 INFO L78 Accepts]: Start accepts. Automaton has 2297 states and 10205 transitions. Word has length 16 [2022-03-15 20:43:22,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:22,024 INFO L470 AbstractCegarLoop]: Abstraction has 2297 states and 10205 transitions. [2022-03-15 20:43:22,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 10205 transitions. [2022-03-15 20:43:22,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:43:22,029 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:22,029 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:22,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 20:43:22,247 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 20:43:22,247 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:22,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:22,248 INFO L85 PathProgramCache]: Analyzing trace with hash -147202180, now seen corresponding path program 8 times [2022-03-15 20:43:22,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:22,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84941212] [2022-03-15 20:43:22,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:22,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:22,297 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:22,297 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:22,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84941212] [2022-03-15 20:43:22,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84941212] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:22,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332752964] [2022-03-15 20:43:22,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:43:22,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:22,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:22,298 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 20:43:22,326 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 20:43:22,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:43:22,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:22,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:43:22,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:22,374 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:43:22,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:22,400 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:43:22,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332752964] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:22,400 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:22,400 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-03-15 20:43:22,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1684068455] [2022-03-15 20:43:22,400 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:22,401 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:22,406 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 133 transitions. [2022-03-15 20:43:22,406 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:22,936 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [53411#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= a i_1)), 53407#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= (+ 2 a) i_1)), 53408#(or (<= (+ a 1) i_1) (< i_3 (+ b a))), 53409#(or (< (+ i_3 1) (+ b a)) (<= (+ a 1) i_1) (<= (+ b a) i_3)), 53406#(or (<= (+ 2 a) i_1) (< i_3 (+ b a))), 53410#(or (<= a i_1) (< i_3 (+ b a))), 53404#(< i_3 (+ b a)), 53405#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3))] [2022-03-15 20:43:22,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:43:22,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:22,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:43:22,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-03-15 20:43:22,937 INFO L87 Difference]: Start difference. First operand 2297 states and 10205 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:23,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:23,159 INFO L93 Difference]: Finished difference Result 2881 states and 12227 transitions. [2022-03-15 20:43:23,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 20:43:23,160 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:43:23,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:23,168 INFO L225 Difference]: With dead ends: 2881 [2022-03-15 20:43:23,168 INFO L226 Difference]: Without dead ends: 2870 [2022-03-15 20:43:23,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:43:23,169 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 150 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:23,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 1 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:43:23,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2022-03-15 20:43:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 2301. [2022-03-15 20:43:23,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2301 states, 2300 states have (on average 4.43608695652174) internal successors, (10203), 2300 states have internal predecessors, (10203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:23,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 10203 transitions. [2022-03-15 20:43:23,242 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 10203 transitions. Word has length 16 [2022-03-15 20:43:23,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:23,243 INFO L470 AbstractCegarLoop]: Abstraction has 2301 states and 10203 transitions. [2022-03-15 20:43:23,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:23,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 10203 transitions. [2022-03-15 20:43:23,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:43:23,248 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:23,248 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:23,269 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 20:43:23,455 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 20:43:23,455 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:23,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:23,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1513399786, now seen corresponding path program 4 times [2022-03-15 20:43:23,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:23,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352752185] [2022-03-15 20:43:23,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:23,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:23,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:23,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352752185] [2022-03-15 20:43:23,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352752185] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:23,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860464889] [2022-03-15 20:43:23,516 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:43:23,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:23,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:23,517 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 20:43:23,518 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 20:43:23,541 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:43:23,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:23,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:43:23,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:23,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:43:23,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860464889] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:23,704 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:23,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 5] total 14 [2022-03-15 20:43:23,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1163410206] [2022-03-15 20:43:23,704 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:23,705 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:23,711 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 167 transitions. [2022-03-15 20:43:23,711 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:24,945 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [61051#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= (+ 3 i_2) b) (<= b (+ i_2 1))), 61043#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= (+ 2 i_2) b) (<= b i_2)), 61054#(or (<= (+ 2 i_2 i_1) i_3) (<= b i_2)), 61025#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 61049#(or (<= (+ 3 i_2) b) (<= b (+ i_2 1))), 61046#(or (<= (+ i_2 a) (+ i_3 1)) (<= b i_2)), 61027#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 61022#(< i_3 (+ b a)), 61040#(or (<= (+ 2 i_2) b) (<= b i_2) (< i_3 (+ b a))), 61032#(or (< i_1 a) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 61048#(or (< i_1 a) (<= (+ 2 i_2) b) (<= b i_2)), 61033#(or (<= (+ b a) i_3) (<= (+ i_2 i_1) (+ i_3 1))), 61038#(or (<= (+ b a) (+ i_3 1)) (<= (+ i_2 i_1) (+ 2 i_3))), 61052#(or (<= (+ 2 i_2 a) i_3) (<= b (+ i_2 1))), 61035#(or (< (+ 3 i_3) (+ b a)) (< i_1 a) (<= (+ b a) (+ 2 i_3))), 61026#(or (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 61042#(or (<= (+ b a) (+ i_3 1)) (<= (+ 2 i_2) b) (<= b i_2) (< (+ 2 i_3) (+ b a))), 61037#(or (<= (+ i_2 a) (+ 2 i_3)) (<= (+ b a) (+ i_3 1))), 61034#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3))), 61057#(or (<= b (+ i_2 1)) (<= (+ i_2 a 1) i_3)), 61030#(or (< i_1 a) (< i_3 (+ b a))), 61047#(or (<= (+ i_2 1) b) (< i_1 a)), 61050#(or (<= (+ 3 i_2) b) (<= b (+ i_2 1)) (< i_3 (+ b a))), 61045#(or (<= b i_2) (<= (+ i_2 a) i_3)), 61055#(or (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_2) b) (<= b (+ i_2 1)) (< (+ 2 i_3) (+ b a))), 61029#(< i_1 a), 61023#(or (< i_2 b) (< i_3 (+ b a))), 61044#(or (<= b i_2) (<= (+ i_2 a 1) i_3)), 61024#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3)), 61031#(or (< (+ i_3 1) (+ b a)) (< i_1 a) (<= (+ b a) i_3)), 61036#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 61053#(or (< i_1 a) (<= (+ 3 i_2) b) (<= b (+ i_2 1))), 61039#(or (<= (+ 2 i_2) b) (<= b i_2)), 61041#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= (+ 2 i_2) b) (<= b i_2)), 61058#(or (<= b (+ i_2 1)) (<= (+ i_2 a) i_3)), 61028#(or (<= (+ b a) i_3) (<= (+ i_2 a) (+ i_3 1))), 61056#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= (+ 3 i_2) b) (<= b (+ i_2 1)))] [2022-03-15 20:43:24,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 20:43:24,946 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:24,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 20:43:24,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=2419, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 20:43:24,946 INFO L87 Difference]: Start difference. First operand 2301 states and 10203 transitions. Second operand has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:33,312 INFO L93 Difference]: Finished difference Result 4568 states and 17296 transitions. [2022-03-15 20:43:33,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2022-03-15 20:43:33,313 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:43:33,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:33,323 INFO L225 Difference]: With dead ends: 4568 [2022-03-15 20:43:33,323 INFO L226 Difference]: Without dead ends: 4545 [2022-03-15 20:43:33,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17065 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=7843, Invalid=41663, Unknown=0, NotChecked=0, Total=49506 [2022-03-15 20:43:33,326 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1302 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 2896 mSolverCounterSat, 1045 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1302 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 3941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1045 IncrementalHoareTripleChecker+Valid, 2896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:33,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1302 Valid, 1 Invalid, 3941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1045 Valid, 2896 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 20:43:33,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4545 states. [2022-03-15 20:43:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4545 to 1914. [2022-03-15 20:43:33,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 4.303711447987454) internal successors, (8233), 1913 states have internal predecessors, (8233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 8233 transitions. [2022-03-15 20:43:33,380 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 8233 transitions. Word has length 16 [2022-03-15 20:43:33,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:33,380 INFO L470 AbstractCegarLoop]: Abstraction has 1914 states and 8233 transitions. [2022-03-15 20:43:33,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:33,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 8233 transitions. [2022-03-15 20:43:33,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:43:33,384 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:33,384 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:33,400 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 20:43:33,600 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 20:43:33,600 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:33,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:33,601 INFO L85 PathProgramCache]: Analyzing trace with hash -722551031, now seen corresponding path program 9 times [2022-03-15 20:43:33,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:33,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685570004] [2022-03-15 20:43:33,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:33,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:33,661 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:33,661 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685570004] [2022-03-15 20:43:33,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685570004] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:33,661 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963749183] [2022-03-15 20:43:33,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:43:33,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:33,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:33,662 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 20:43:33,665 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 20:43:33,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 20:43:33,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:33,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 20:43:33,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:33,822 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:33,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:33,895 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:33,896 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963749183] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:33,896 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:33,896 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 4] total 12 [2022-03-15 20:43:33,896 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [971594521] [2022-03-15 20:43:33,896 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:33,897 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:33,903 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 173 transitions. [2022-03-15 20:43:33,903 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:34,961 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [69907#(and (< x_3 (+ x_2 x_1 c 1)) (<= (+ x_2 x_1 c) x_3)), 69908#(and (<= (+ x_2 x_1 (* 2 c)) x_3) (< x_3 (+ x_2 x_1 (* 2 c) 1))), 69909#(and (< x_3 (+ (* 3 c) x_2 x_1 1)) (<= (+ (* 3 c) x_2 x_1) x_3))] [2022-03-15 20:43:34,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:43:34,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:34,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:43:34,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:43:34,962 INFO L87 Difference]: Start difference. First operand 1914 states and 8233 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:35,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:35,211 INFO L93 Difference]: Finished difference Result 3047 states and 12082 transitions. [2022-03-15 20:43:35,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 20:43:35,211 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:43:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:35,217 INFO L225 Difference]: With dead ends: 3047 [2022-03-15 20:43:35,217 INFO L226 Difference]: Without dead ends: 3043 [2022-03-15 20:43:35,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 80 SyntacticMatches, 10 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:43:35,217 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:35,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:43:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2022-03-15 20:43:35,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 2311. [2022-03-15 20:43:35,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2311 states, 2310 states have (on average 4.35021645021645) internal successors, (10049), 2310 states have internal predecessors, (10049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:35,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 2311 states and 10049 transitions. [2022-03-15 20:43:35,262 INFO L78 Accepts]: Start accepts. Automaton has 2311 states and 10049 transitions. Word has length 17 [2022-03-15 20:43:35,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:35,262 INFO L470 AbstractCegarLoop]: Abstraction has 2311 states and 10049 transitions. [2022-03-15 20:43:35,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:35,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 10049 transitions. [2022-03-15 20:43:35,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:43:35,267 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:35,267 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:35,285 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 20:43:35,483 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 20:43:35,483 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:35,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:35,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1408610749, now seen corresponding path program 5 times [2022-03-15 20:43:35,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:35,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73473979] [2022-03-15 20:43:35,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:35,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:35,532 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:35,532 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:35,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73473979] [2022-03-15 20:43:35,532 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73473979] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:35,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765347494] [2022-03-15 20:43:35,532 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:43:35,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:35,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:35,534 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 20:43:35,534 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 20:43:35,555 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:43:35,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:35,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:43:35,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:35,620 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:35,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:35,649 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:35,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765347494] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:35,650 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:35,650 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-03-15 20:43:35,650 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [359981888] [2022-03-15 20:43:35,650 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:35,651 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:35,658 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 204 transitions. [2022-03-15 20:43:35,658 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:36,849 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [77711#(or (<= (+ b a) i_3) (<= (+ i_3 1) (+ i_2 a))), 77700#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3)), 77699#(or (< (+ 3 i_2) b) (< i_3 (+ b a)) (<= b (+ 2 i_2))), 77706#(<= b (+ 2 i_2)), 77692#(<= b i_2), 77703#(or (< (+ 2 i_2) b) (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b (+ i_2 1))), 77698#(or (< (+ 3 i_2) b) (<= b (+ 2 i_2))), 77714#(or (<= (+ b a) (+ i_3 1)) (<= b i_2) (< (+ i_2 1) b) (< (+ 2 i_3) (+ b a))), 77705#(or (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 77702#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b i_2) (< (+ i_2 1) b)), 77710#(or (<= (+ 2 i_3) (+ i_2 a)) (<= (+ b a) i_3)), 77723#(or (<= (+ b a) (+ i_3 1)) (<= b (+ 3 i_2)) (< (+ i_2 4) b) (< (+ 2 i_3) (+ b a))), 77697#(or (< (+ 2 i_2) b) (<= b (+ i_2 1)) (< i_3 (+ b a))), 77708#(<= b (+ 3 i_2)), 77718#(or (<= i_3 (+ i_2 a)) (<= (+ b a) i_3)), 77719#(or (< (+ 3 i_2) b) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a)) (<= b (+ 2 i_2))), 77707#(or (<= b (+ 3 i_2)) (< (+ i_2 4) b)), 77712#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 77690#(< i_2 b), 77658#(< i_3 (+ b a)), 77691#(or (<= b i_2) (< (+ i_2 1) b)), 77722#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b (+ 3 i_2)) (< (+ i_2 4) b)), 77717#(or (<= (+ 2 i_3) (+ i_2 a)) (<= (+ b a) (+ i_3 1))), 77720#(or (<= (+ i_3 1) (+ i_2 a)) (<= (+ b a) (+ i_3 1))), 77709#(or (<= (+ b a) i_3) (<= (+ 3 i_3) (+ b a))), 77694#(<= b (+ i_2 1)), 77715#(or (<= (+ 3 i_3) (+ i_2 a)) (<= (+ b a) (+ i_3 1))), 77701#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 77704#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (< (+ 3 i_2) b) (<= b (+ 2 i_2))), 77721#(or (<= b (+ 3 i_2)) (< (+ i_2 4) b) (< i_3 (+ b a))), 77713#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ i_3 1))), 77693#(or (< (+ 2 i_2) b) (<= b (+ i_2 1))), 77716#(or (< (+ 2 i_2) b) (<= (+ b a) (+ i_3 1)) (<= b (+ i_2 1)) (< (+ 2 i_3) (+ b a))), 77695#(or (< i_2 b) (< i_3 (+ b a))), 77696#(or (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a)))] [2022-03-15 20:43:36,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 20:43:36,849 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:36,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 20:43:36,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=1978, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 20:43:36,850 INFO L87 Difference]: Start difference. First operand 2311 states and 10049 transitions. Second operand has 43 states, 43 states have (on average 3.116279069767442) internal successors, (134), 42 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:37,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:37,826 INFO L93 Difference]: Finished difference Result 4765 states and 19488 transitions. [2022-03-15 20:43:37,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 20:43:37,827 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.116279069767442) internal successors, (134), 42 states have internal predecessors, (134), 0 states have call successors, (0), 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 20:43:37,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:37,838 INFO L225 Difference]: With dead ends: 4765 [2022-03-15 20:43:37,838 INFO L226 Difference]: Without dead ends: 4734 [2022-03-15 20:43:37,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1320, Invalid=4380, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 20:43:37,839 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 522 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:37,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [522 Valid, 1 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:43:37,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4734 states. [2022-03-15 20:43:37,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4734 to 2726. [2022-03-15 20:43:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2726 states, 2725 states have (on average 4.434862385321101) internal successors, (12085), 2725 states have internal predecessors, (12085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:37,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 12085 transitions. [2022-03-15 20:43:37,921 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 12085 transitions. Word has length 17 [2022-03-15 20:43:37,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:37,921 INFO L470 AbstractCegarLoop]: Abstraction has 2726 states and 12085 transitions. [2022-03-15 20:43:37,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.116279069767442) internal successors, (134), 42 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:37,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 12085 transitions. [2022-03-15 20:43:37,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:43:37,927 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:37,927 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:37,949 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 20:43:38,130 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 20:43:38,131 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:38,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:38,131 INFO L85 PathProgramCache]: Analyzing trace with hash 915068103, now seen corresponding path program 10 times [2022-03-15 20:43:38,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:38,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721359360] [2022-03-15 20:43:38,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:38,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:38,169 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:38,169 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:38,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721359360] [2022-03-15 20:43:38,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721359360] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:38,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691864870] [2022-03-15 20:43:38,169 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:43:38,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:38,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:38,170 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 20:43:38,171 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 20:43:38,191 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:43:38,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:38,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:43:38,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:43:38,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:43:38,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691864870] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:38,277 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:38,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-03-15 20:43:38,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [381099839] [2022-03-15 20:43:38,277 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:38,278 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:38,284 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 20:43:38,284 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:38,973 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [88105#(or (<= (+ a 1) i_1) (< i_3 (+ b a))), 88110#(or (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 88109#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= a i_1)), 88108#(or (<= a i_1) (< i_3 (+ b a))), 88113#(or (<= a (+ i_1 1)) (< i_3 (+ b a))), 88106#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3)), 88115#(or (<= (+ b a) (+ i_3 1)) (<= a (+ i_1 1)) (< (+ 2 i_3) (+ b a))), 88114#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= a (+ i_1 1))), 88112#(or (<= a i_1) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 88107#(or (< (+ i_3 1) (+ b a)) (<= (+ a 1) i_1) (<= (+ b a) i_3)), 88104#(< i_3 (+ b a)), 88111#(or (<= (+ a 1) i_1) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a)))] [2022-03-15 20:43:38,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 20:43:38,973 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:38,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 20:43:38,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:43:38,974 INFO L87 Difference]: Start difference. First operand 2726 states and 12085 transitions. Second operand has 21 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 20 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:39,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:39,628 INFO L93 Difference]: Finished difference Result 5844 states and 24696 transitions. [2022-03-15 20:43:39,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 20:43:39,629 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 20 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:43:39,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:39,643 INFO L225 Difference]: With dead ends: 5844 [2022-03-15 20:43:39,643 INFO L226 Difference]: Without dead ends: 5790 [2022-03-15 20:43:39,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=677, Invalid=2185, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 20:43:39,644 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 284 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:39,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 1 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:43:39,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5790 states. [2022-03-15 20:43:39,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5790 to 3419. [2022-03-15 20:43:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 3418 states have (on average 4.4806904622586305) internal successors, (15315), 3418 states have internal predecessors, (15315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:39,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 15315 transitions. [2022-03-15 20:43:39,746 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 15315 transitions. Word has length 17 [2022-03-15 20:43:39,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:39,746 INFO L470 AbstractCegarLoop]: Abstraction has 3419 states and 15315 transitions. [2022-03-15 20:43:39,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 20 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:39,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 15315 transitions. [2022-03-15 20:43:39,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:43:39,754 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:39,754 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:39,769 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 20:43:39,954 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 20:43:39,954 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:39,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:39,954 INFO L85 PathProgramCache]: Analyzing trace with hash -274005061, now seen corresponding path program 5 times [2022-03-15 20:43:39,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:39,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453327511] [2022-03-15 20:43:39,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:39,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:40,014 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:40,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453327511] [2022-03-15 20:43:40,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453327511] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:40,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700291049] [2022-03-15 20:43:40,014 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:43:40,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:40,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:40,015 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 20:43:40,016 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 20:43:40,037 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 20:43:40,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:40,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:43:40,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:40,176 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:40,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:40,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700291049] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:40,230 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:40,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2022-03-15 20:43:40,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [634729612] [2022-03-15 20:43:40,231 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:40,231 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:40,240 INFO L252 McrAutomatonBuilder]: Finished intersection with 108 states and 242 transitions. [2022-03-15 20:43:40,240 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:42,384 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 58 new interpolants: [101004#(or (<= b i_2) (<= (+ 3 i_3) (+ b a))), 100975#(or (< (+ i_3 1) (+ b a)) (< i_1 a) (<= (+ b a) i_3)), 101017#(or (< (+ i_1 1) a) (<= a i_1) (<= b (+ i_2 1))), 101007#(or (< (+ 2 i_2) b) (<= b (+ i_2 1))), 101008#(or (< (+ 2 i_2) b) (<= b (+ i_2 1)) (< i_3 (+ b a))), 100985#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 101022#(or (<= (+ 3 i_3) (+ i_1 b)) (<= (+ b a) i_3) (<= b (+ i_2 1))), 101027#(or (<= (+ b a) i_3) (<= (+ 2 i_3) (+ i_1 b))), 100938#(< i_3 (+ b a)), 100991#(or (< (+ i_1 1) a) (<= a i_1) (<= b i_2)), 100990#(or (< i_1 a) (<= b i_2)), 101028#(or (<= (+ b a) i_3) (<= (+ i_3 1) (+ i_2 i_1))), 100980#(or (< (+ i_1 1) a) (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= a i_1)), 101019#(or (<= b i_2) (<= (+ 2 i_3) (+ i_1 b))), 101021#(or (<= (+ 3 i_3) (+ i_1 b)) (<= (+ b a) i_3) (<= b i_2)), 101000#(or (< i_1 a) (<= (+ 2 i_3) (+ b a)) (<= b i_2)), 100981#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 100987#(or (<= (+ 3 i_3) (+ i_1 b)) (<= (+ b a) i_3)), 100995#(or (< (+ i_1 1) a) (<= (+ 2 i_3) (+ b a)) (<= a i_1)), 101006#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) i_3) (<= b i_2)), 101025#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 101011#(or (< i_1 a) (<= b (+ i_2 1))), 101020#(or (<= b (+ i_2 1)) (<= (+ 2 i_3) (+ i_1 b))), 101003#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b i_2) (< (+ i_2 1) b)), 101005#(or (<= (+ b a) (+ i_3 1)) (<= b i_2) (< (+ i_2 1) b) (< (+ 2 i_3) (+ b a))), 100994#(or (< i_1 a) (<= (+ 2 i_3) (+ b a))), 101009#(<= b (+ i_2 1)), 101014#(or (<= b (+ i_2 1)) (<= (+ 3 i_3) (+ b a))), 101016#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) i_3) (<= b (+ i_2 1))), 101002#(or (<= (+ 2 i_3) (+ b a)) (<= b i_2) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 100974#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3)), 100989#(<= b i_2), 100973#(or (< i_1 a) (< i_3 (+ b a))), 101015#(or (< (+ 2 i_2) b) (<= (+ b a) (+ i_3 1)) (<= b (+ i_2 1)) (< (+ 2 i_3) (+ b a))), 100988#(or (<= b i_2) (< (+ i_2 1) b)), 101018#(or (< (+ i_1 1) a) (<= (+ 2 i_3) (+ b a)) (<= a i_1) (<= b (+ i_2 1))), 100977#(or (< i_1 a) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 100986#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) i_3)), 101012#(or (< i_1 a) (<= (+ 2 i_3) (+ b a)) (<= b (+ i_2 1))), 100997#(or (<= (+ 2 i_3) (+ b a)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 101001#(or (< (+ i_1 1) a) (<= (+ 2 i_3) (+ b a)) (<= a i_1) (<= b i_2)), 100972#(< i_1 a), 100976#(or (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 100982#(< i_2 b), 100983#(or (< i_2 b) (< i_3 (+ b a))), 100993#(or (<= b i_2) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 100996#(or (<= a (+ i_1 1)) (< i_3 (+ b a)) (< (+ 2 i_1) a)), 100992#(or (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 101026#(or (<= (+ b a) (+ i_3 1)) (<= a (+ i_1 1)) (< (+ 2 i_3) (+ b a)) (< (+ 2 i_1) a)), 101024#(or (<= (+ 2 i_3) (+ b a)) (<= b (+ i_2 1)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 100978#(or (< (+ i_1 1) a) (<= a i_1)), 100999#(or (<= (+ 2 i_3) (+ b a)) (<= b i_2)), 101010#(or (<= (+ 2 i_3) (+ b a)) (<= b (+ i_2 1))), 100979#(or (< (+ i_1 1) a) (<= a i_1) (< i_3 (+ b a))), 100984#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 100998#(or (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 101013#(or (< (+ 2 i_2) b) (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b (+ i_2 1))), 101023#(or (<= b (+ i_2 1)) (<= a (+ i_1 1)) (< (+ 2 i_1) a))] [2022-03-15 20:43:42,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-03-15 20:43:42,384 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:42,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-03-15 20:43:42,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=5255, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 20:43:42,385 INFO L87 Difference]: Start difference. First operand 3419 states and 15315 transitions. Second operand has 67 states, 67 states have (on average 2.91044776119403) internal successors, (195), 66 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:00,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:00,948 INFO L93 Difference]: Finished difference Result 23863 states and 103671 transitions. [2022-03-15 20:44:00,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 455 states. [2022-03-15 20:44:00,956 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.91044776119403) internal successors, (195), 66 states have internal predecessors, (195), 0 states have call successors, (0), 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 20:44:00,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:01,041 INFO L225 Difference]: With dead ends: 23863 [2022-03-15 20:44:01,041 INFO L226 Difference]: Without dead ends: 23601 [2022-03-15 20:44:01,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 508 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107655 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=42809, Invalid=216781, Unknown=0, NotChecked=0, Total=259590 [2022-03-15 20:44:01,051 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1497 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 5746 mSolverCounterSat, 1300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 7046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1300 IncrementalHoareTripleChecker+Valid, 5746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:01,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1497 Valid, 1 Invalid, 7046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1300 Valid, 5746 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 20:44:01,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23601 states. [2022-03-15 20:44:01,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23601 to 10835. [2022-03-15 20:44:01,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10835 states, 10834 states have (on average 4.948033967140484) internal successors, (53607), 10834 states have internal predecessors, (53607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10835 states to 10835 states and 53607 transitions. [2022-03-15 20:44:01,510 INFO L78 Accepts]: Start accepts. Automaton has 10835 states and 53607 transitions. Word has length 17 [2022-03-15 20:44:01,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:01,510 INFO L470 AbstractCegarLoop]: Abstraction has 10835 states and 53607 transitions. [2022-03-15 20:44:01,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.91044776119403) internal successors, (195), 66 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 10835 states and 53607 transitions. [2022-03-15 20:44:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:44:01,531 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:01,531 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:01,548 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 20:44:01,746 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 20:44:01,747 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:44:01,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:01,747 INFO L85 PathProgramCache]: Analyzing trace with hash 964877436, now seen corresponding path program 11 times [2022-03-15 20:44:01,747 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:01,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117884458] [2022-03-15 20:44:01,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:01,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:01,796 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:01,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117884458] [2022-03-15 20:44:01,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117884458] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:01,797 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334386645] [2022-03-15 20:44:01,797 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:44:01,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:01,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:01,798 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 20:44:01,799 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 20:44:01,823 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 20:44:01,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:01,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:44:01,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:01,925 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:01,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:01,966 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:01,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334386645] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:01,967 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:01,967 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-15 20:44:01,967 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [814124082] [2022-03-15 20:44:01,967 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:01,968 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:01,977 INFO L252 McrAutomatonBuilder]: Finished intersection with 97 states and 203 transitions. [2022-03-15 20:44:01,977 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:03,341 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [147556#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (< i_3 (+ b a))), 147569#(or (<= (+ i_3 4) (+ b a)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 147557#(or (< i_1 a) (<= (+ 2 i_3) (+ b a))), 147573#(or (< (+ i_1 4) a) (<= a (+ 3 i_1)) (< i_3 (+ b a))), 147574#(or (< (+ i_1 4) a) (<= (+ 2 i_3) (+ b a)) (<= a (+ 3 i_1))), 147552#(or (< (+ i_1 1) a) (<= a i_1) (< i_3 (+ b a))), 147576#(or (< (+ i_1 4) a) (<= (+ i_3 4) (+ b a)) (<= a (+ 3 i_1))), 147563#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ 3 i_3) (+ b a))), 147561#(or (<= (+ 2 i_3) (+ b a)) (<= (+ b a) i_3)), 147567#(or (< (+ i_1 1) a) (<= (+ i_3 4) (+ b a)) (<= a i_1)), 147551#(or (< (+ i_1 1) a) (<= a i_1)), 147553#(or (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 147568#(or (<= a (+ i_1 1)) (<= (+ 3 i_3) (+ b a)) (< (+ 2 i_1) a)), 147566#(or (<= (+ i_3 4) (+ b a)) (< i_1 a)), 147570#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ 3 i_3) (+ b a))), 147564#(or (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 147558#(or (< (+ i_1 1) a) (<= (+ 2 i_3) (+ b a)) (<= a i_1)), 147555#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1))), 147559#(or (<= (+ 2 i_3) (+ b a)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 147560#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ 2 i_3) (+ b a))), 147550#(or (< i_1 a) (< i_3 (+ b a))), 147572#(or (< (+ i_1 4) a) (<= a (+ 3 i_1))), 147575#(or (< (+ i_1 4) a) (<= (+ 3 i_3) (+ b a)) (<= a (+ 3 i_1))), 147549#(< i_1 a), 147565#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3))), 147562#(or (< i_1 a) (<= (+ 3 i_3) (+ b a))), 147554#(or (<= a (+ i_1 1)) (< i_3 (+ b a)) (< (+ 2 i_1) a)), 147571#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ i_3 4) (+ b a)))] [2022-03-15 20:44:03,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 20:44:03,342 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:03,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 20:44:03,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=417, Invalid=1745, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 20:44:03,342 INFO L87 Difference]: Start difference. First operand 10835 states and 53607 transitions. Second operand has 38 states, 38 states have (on average 3.0526315789473686) internal successors, (116), 37 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:05,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:05,062 INFO L93 Difference]: Finished difference Result 27891 states and 134160 transitions. [2022-03-15 20:44:05,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-15 20:44:05,062 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.0526315789473686) internal successors, (116), 37 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 20:44:05,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:05,172 INFO L225 Difference]: With dead ends: 27891 [2022-03-15 20:44:05,173 INFO L226 Difference]: Without dead ends: 27891 [2022-03-15 20:44:05,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2904 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1737, Invalid=7005, Unknown=0, NotChecked=0, Total=8742 [2022-03-15 20:44:05,173 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 432 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:05,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [432 Valid, 1 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:44:05,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27891 states. [2022-03-15 20:44:05,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27891 to 15432. [2022-03-15 20:44:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15432 states, 15431 states have (on average 5.030458168621606) internal successors, (77625), 15431 states have internal predecessors, (77625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:05,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15432 states to 15432 states and 77625 transitions. [2022-03-15 20:44:05,750 INFO L78 Accepts]: Start accepts. Automaton has 15432 states and 77625 transitions. Word has length 18 [2022-03-15 20:44:05,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:05,750 INFO L470 AbstractCegarLoop]: Abstraction has 15432 states and 77625 transitions. [2022-03-15 20:44:05,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.0526315789473686) internal successors, (116), 37 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:05,750 INFO L276 IsEmpty]: Start isEmpty. Operand 15432 states and 77625 transitions. [2022-03-15 20:44:05,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:44:05,784 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:05,784 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:05,800 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 20:44:05,990 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 20:44:05,991 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:44:05,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:05,991 INFO L85 PathProgramCache]: Analyzing trace with hash -946440896, now seen corresponding path program 12 times [2022-03-15 20:44:05,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:05,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632390700] [2022-03-15 20:44:05,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:05,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:06,043 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:06,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:06,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632390700] [2022-03-15 20:44:06,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632390700] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:06,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142333722] [2022-03-15 20:44:06,043 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:44:06,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:06,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:06,045 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 20:44:06,045 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 20:44:06,067 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 20:44:06,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:06,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:44:06,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:06,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:06,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142333722] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:06,358 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:06,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2022-03-15 20:44:06,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1377456420] [2022-03-15 20:44:06,358 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:06,359 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:06,368 INFO L252 McrAutomatonBuilder]: Finished intersection with 97 states and 203 transitions. [2022-03-15 20:44:06,368 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:08,429 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 59 new interpolants: [206554#(or (< i_1 a) (<= (+ b a) i_3)), 206595#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (< i_2 b) (<= (+ b a) (+ i_3 1))), 206559#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ b a) i_3)), 206601#(or (< (+ i_1 1) a) (<= (+ i_2 a) (+ 3 i_3)) (<= a i_1)), 206600#(or (< (+ i_1 1) a) (<= (+ b a) (+ 3 i_3)) (< i_2 b) (<= a i_1)), 206549#(< i_3 (+ b a)), 206578#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 206551#(or (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 206575#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1) (<= (+ b a) (+ i_3 1))), 206564#(< i_2 b), 206585#(or (< i_1 a) (<= (+ b a) (+ 2 i_3))), 206593#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ b a) (+ 3 i_3))), 206603#(or (<= (+ b a) (+ 3 i_3)) (< i_2 b) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 206582#(or (< (+ i_3 4) (+ b a)) (<= (+ b a) (+ 3 i_3))), 206607#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ i_2 a) (+ 3 i_3))), 206565#(or (< i_2 b) (< i_3 (+ b a))), 206555#(or (< (+ i_1 1) a) (<= (+ b a) i_3) (<= a i_1)), 206556#(or (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 206596#(or (< i_1 a) (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 206552#(< i_1 a), 206580#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 206567#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 206599#(or (< i_1 a) (<= (+ i_2 a) (+ 3 i_3))), 206606#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ b a) (+ 3 i_3)) (< i_2 b)), 206571#(or (< i_1 a) (< i_2 b) (<= (+ b a) i_3)), 206576#(or (< i_2 b) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 206560#(or (< i_1 a) (<= (+ b a) (+ i_3 1))), 206572#(or (< i_1 a) (< i_2 b) (<= (+ b a) (+ i_3 1))), 206605#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 206577#(or (< i_2 b) (<= (+ b a) i_3) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 206588#(or (< (+ i_1 1) a) (<= (+ b a) (+ 3 i_3)) (<= a i_1)), 206583#(or (< (+ i_3 4) (+ b a)) (<= (+ b a) (+ 3 i_3)) (< i_2 b)), 206587#(or (< (+ i_1 1) a) (<= (+ b a) (+ 2 i_3)) (<= a i_1)), 206602#(or (<= (+ b a) (+ 2 i_3)) (< i_2 b) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 206570#(or (< i_1 a) (< i_2 b)), 206553#(or (< (+ i_1 1) a) (<= a i_1)), 206598#(or (< i_1 a) (<= (+ b a) (+ 3 i_3)) (< i_2 b)), 206561#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ b a) (+ i_3 1))), 206569#(or (< i_2 b) (<= (+ b a) (+ i_3 1))), 206563#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ b a) (+ i_3 1))), 206594#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (< i_2 b) (<= (+ b a) i_3)), 206557#(or (<= (+ b a) i_3) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 206573#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1)), 206589#(or (<= (+ b a) (+ 2 i_3)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 206566#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 206558#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1))), 206604#(or (<= (+ i_2 a) (+ 3 i_3)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 206574#(or (< (+ i_1 1) a) (< i_2 b) (<= (+ b a) i_3) (<= a i_1)), 206562#(or (<= (+ b a) (+ i_3 1)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 206568#(or (< i_2 b) (<= (+ b a) i_3)), 206591#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (< i_2 b)), 206579#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3))), 206597#(or (< (+ i_1 1) a) (<= (+ b a) (+ 2 i_3)) (< i_2 b) (<= a i_1)), 206584#(or (<= (+ b a) (+ 3 i_3)) (< i_2 b)), 206586#(or (< i_1 a) (<= (+ b a) (+ 3 i_3))), 206550#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3)), 206581#(or (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 206590#(or (<= (+ b a) (+ 3 i_3)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 206592#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ b a) (+ 2 i_3)))] [2022-03-15 20:44:08,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-03-15 20:44:08,430 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:08,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-03-15 20:44:08,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=5562, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 20:44:08,431 INFO L87 Difference]: Start difference. First operand 15432 states and 77625 transitions. Second operand has 70 states, 70 states have (on average 2.5714285714285716) internal successors, (180), 69 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:26,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:26,607 INFO L93 Difference]: Finished difference Result 32340 states and 145916 transitions. [2022-03-15 20:44:26,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 397 states. [2022-03-15 20:44:26,607 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.5714285714285716) internal successors, (180), 69 states have internal predecessors, (180), 0 states have call successors, (0), 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 20:44:26,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:26,788 INFO L225 Difference]: With dead ends: 32340 [2022-03-15 20:44:26,789 INFO L226 Difference]: Without dead ends: 32205 [2022-03-15 20:44:26,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 466 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89317 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=46376, Invalid=172180, Unknown=0, NotChecked=0, Total=218556 [2022-03-15 20:44:26,796 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1043 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 427 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:26,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1043 Valid, 1 Invalid, 2764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:44:26,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32205 states. [2022-03-15 20:44:27,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32205 to 21137. [2022-03-15 20:44:27,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21137 states, 21136 states have (on average 5.033355412566237) internal successors, (106385), 21136 states have internal predecessors, (106385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:27,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21137 states to 21137 states and 106385 transitions. [2022-03-15 20:44:27,669 INFO L78 Accepts]: Start accepts. Automaton has 21137 states and 106385 transitions. Word has length 18 [2022-03-15 20:44:27,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:27,670 INFO L470 AbstractCegarLoop]: Abstraction has 21137 states and 106385 transitions. [2022-03-15 20:44:27,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 2.5714285714285716) internal successors, (180), 69 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:27,670 INFO L276 IsEmpty]: Start isEmpty. Operand 21137 states and 106385 transitions. [2022-03-15 20:44:27,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:44:27,719 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:27,719 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:27,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-03-15 20:44:27,920 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 20:44:27,920 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:44:27,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:27,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1669720849, now seen corresponding path program 6 times [2022-03-15 20:44:28,006 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:28,007 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154378034] [2022-03-15 20:44:28,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:28,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:28,079 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:28,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154378034] [2022-03-15 20:44:28,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154378034] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:28,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717959686] [2022-03-15 20:44:28,079 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:44:28,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:28,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:28,080 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 20:44:28,081 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 20:44:28,104 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 20:44:28,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:28,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:44:28,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:28,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:28,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717959686] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:28,378 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:28,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2022-03-15 20:44:28,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [643222483] [2022-03-15 20:44:28,379 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:28,380 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:28,390 INFO L252 McrAutomatonBuilder]: Finished intersection with 116 states and 258 transitions. [2022-03-15 20:44:28,391 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:31,381 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 76 new interpolants: [282181#(or (<= (+ b a) (+ i_3 1)) (<= b i_2) (<= a (+ i_1 1)) (< (+ i_2 1) b) (< (+ 2 i_1) a)), 282184#(or (< (+ i_1 1) a) (<= (+ b a) (+ 2 i_3)) (<= a i_1)), 282152#(or (< i_1 a) (<= (+ b a) (+ i_3 1)) (<= b i_2) (< (+ i_2 1) b)), 282164#(or (< (+ i_1 1) a) (<= a i_1)), 282124#(< i_3 (+ b a)), 282127#(< i_2 b), 282159#(or (< (+ i_3 4) (+ b a)) (<= (+ b a) (+ 3 i_3)) (<= b i_2) (< (+ i_2 1) b)), 282151#(or (< i_1 a) (< i_2 b) (<= (+ b a) (+ i_3 1))), 282142#(or (<= (+ b a) (+ i_3 1)) (<= b i_2) (< (+ i_2 1) b)), 282192#(or (<= (+ b a) (+ 2 i_3)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 282134#(or (< i_2 b) (<= (+ b a) (+ i_3 1))), 282137#(or (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 282154#(or (< i_1 a) (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 282144#(< i_1 a), 282140#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= b i_2) (< (+ i_2 1) b)), 282175#(or (<= b i_2) (<= a (+ i_1 1)) (< (+ i_2 1) b) (< (+ 2 i_1) a)), 282156#(or (< (+ i_3 4) (+ b a)) (<= (+ b a) (+ 3 i_3))), 282172#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ b a) (+ i_3 1)) (<= b i_2) (< (+ i_2 1) b)), 282186#(or (< (+ i_1 1) a) (<= (+ b a) (+ 3 i_3)) (<= a i_1)), 282158#(or (<= (+ b a) (+ 3 i_3)) (< i_2 b)), 282145#(or (< i_1 a) (< i_2 b)), 282162#(or (< i_1 a) (<= (+ b a) (+ 3 i_3)) (< i_2 b)), 282126#(or (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 282185#(or (< (+ i_1 1) a) (<= (+ b a) (+ 2 i_3)) (< i_2 b) (<= a i_1)), 282148#(or (< i_1 a) (< i_2 b) (<= (+ b a) i_3)), 282128#(or (< i_2 b) (< i_3 (+ b a))), 282129#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 282163#(or (< i_1 a) (<= (+ b a) (+ 3 i_3)) (<= b i_2) (< (+ i_2 1) b)), 282187#(or (< (+ i_1 1) a) (<= (+ b a) (+ 3 i_3)) (< i_2 b) (<= a i_1)), 282189#(or (< (+ i_1 1) a) (<= (+ b a) (+ 3 i_3)) (<= a i_1) (<= b i_2) (< (+ i_2 1) b)), 282133#(or (< i_2 b) (<= (+ b a) i_3)), 282150#(or (< i_1 a) (<= (+ b a) (+ i_3 1))), 282165#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1)), 282160#(or (<= (+ b a) (+ 3 i_3)) (<= b i_2) (< (+ i_2 1) b)), 282166#(or (< (+ i_1 1) a) (<= (+ b a) i_3) (<= a i_1)), 282178#(or (<= (+ b a) (+ i_3 1)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 282199#(and (or (<= (+ i_2 a) (+ 2 x_2)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)) (or (= (+ (* (- 1) i_3) x_2) 0) (<= a (+ i_1 1)) (< (+ 2 i_1) a))), 282194#(or (<= (+ b a) (+ 2 i_3)) (<= b i_2) (<= a (+ i_1 1)) (< (+ i_2 1) b) (< (+ 2 i_1) a)), 282191#(and (or (< (+ i_1 1) a) (<= (+ i_2 a) (+ 2 x_2)) (<= a i_1)) (or (< (+ i_1 1) a) (= (+ (* (- 1) i_3) x_2) 0) (<= a i_1))), 282161#(or (< i_1 a) (<= (+ b a) (+ 3 i_3))), 282177#(or (< i_2 b) (<= (+ b a) i_3) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 282188#(or (< (+ i_1 1) a) (<= (+ b a) (+ 2 i_3)) (<= a i_1) (<= b i_2) (< (+ i_2 1) b)), 282176#(or (<= (+ b a) i_3) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 282180#(or (<= (+ b a) i_3) (<= b i_2) (<= a (+ i_1 1)) (< (+ i_2 1) b) (< (+ 2 i_1) a)), 282143#(or (<= (+ b a) (+ 2 i_3)) (<= b i_2) (< (+ i_2 1) b)), 282171#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1) (<= (+ b a) (+ i_3 1))), 282136#(or (<= b i_2) (< (+ i_2 1) b)), 282125#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3)), 282132#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 282182#(or (< i_1 a) (<= (+ i_2 a) (+ 3 i_3))), 282155#(or (< i_1 a) (<= (+ b a) (+ 2 i_3)) (<= b i_2) (< (+ i_2 1) b)), 282193#(or (<= (+ b a) (+ 2 i_3)) (< i_2 b) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 282198#(or (<= (+ i_2 a) (+ 3 i_3)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 282135#(or (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 282149#(or (< i_1 a) (<= (+ b a) i_3) (<= b i_2) (< (+ i_2 1) b)), 282173#(or (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 282195#(or (<= (+ b a) (+ 3 i_3)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 282190#(or (< (+ i_1 1) a) (<= (+ i_2 a) (+ 3 i_3)) (<= a i_1)), 282167#(or (< (+ i_1 1) a) (< i_2 b) (<= (+ b a) i_3) (<= a i_1)), 282139#(or (<= (+ b a) (+ i_3 1)) (<= b i_2) (< (+ i_2 1) b) (< (+ 2 i_3) (+ b a))), 282168#(or (< (+ i_1 1) a) (<= a i_1) (<= b i_2) (< (+ i_2 1) b)), 282157#(or (< (+ i_3 4) (+ b a)) (<= (+ b a) (+ 3 i_3)) (< i_2 b)), 282138#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b i_2) (< (+ i_2 1) b)), 282169#(or (< (+ i_1 1) a) (<= (+ b a) i_3) (<= a i_1) (<= b i_2) (< (+ i_2 1) b)), 282197#(or (<= (+ b a) (+ 3 i_3)) (<= b i_2) (<= a (+ i_1 1)) (< (+ i_2 1) b) (< (+ 2 i_1) a)), 282146#(or (< i_1 a) (<= b i_2) (< (+ i_2 1) b)), 282141#(or (<= (+ b a) i_3) (<= b i_2) (< (+ i_2 1) b)), 282174#(or (< i_2 b) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 282131#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3))), 282153#(or (< i_1 a) (<= (+ b a) (+ 2 i_3))), 282196#(or (<= (+ b a) (+ 3 i_3)) (< i_2 b) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 282147#(or (< i_1 a) (<= (+ b a) i_3)), 282130#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 282179#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 282183#(and (or (<= (+ i_2 a) (+ 2 x_2)) (< i_1 a)) (or (< i_1 a) (= (+ (* (- 1) i_3) x_2) 0))), 282170#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ b a) (+ i_3 1)))] [2022-03-15 20:44:31,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-03-15 20:44:31,381 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:31,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-03-15 20:44:31,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1065, Invalid=8835, Unknown=0, NotChecked=0, Total=9900 [2022-03-15 20:44:31,383 INFO L87 Difference]: Start difference. First operand 21137 states and 106385 transitions. Second operand has 87 states, 87 states have (on average 2.6551724137931036) internal successors, (231), 86 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:43,536 INFO L93 Difference]: Finished difference Result 24711 states and 118928 transitions. [2022-03-15 20:44:43,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2022-03-15 20:44:43,537 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 2.6551724137931036) internal successors, (231), 86 states have internal predecessors, (231), 0 states have call successors, (0), 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 20:44:43,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:43,627 INFO L225 Difference]: With dead ends: 24711 [2022-03-15 20:44:43,627 INFO L226 Difference]: Without dead ends: 24634 [2022-03-15 20:44:43,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32759 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=17272, Invalid=88028, Unknown=0, NotChecked=0, Total=105300 [2022-03-15 20:44:43,631 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1285 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 4008 mSolverCounterSat, 928 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 4936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 928 IncrementalHoareTripleChecker+Valid, 4008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:43,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1285 Valid, 1 Invalid, 4936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [928 Valid, 4008 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 20:44:43,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24634 states. [2022-03-15 20:44:44,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24634 to 21448. [2022-03-15 20:44:44,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21448 states, 21447 states have (on average 5.030540401921015) internal successors, (107890), 21447 states have internal predecessors, (107890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:44,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21448 states to 21448 states and 107890 transitions. [2022-03-15 20:44:44,249 INFO L78 Accepts]: Start accepts. Automaton has 21448 states and 107890 transitions. Word has length 18 [2022-03-15 20:44:44,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:44,249 INFO L470 AbstractCegarLoop]: Abstraction has 21448 states and 107890 transitions. [2022-03-15 20:44:44,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 2.6551724137931036) internal successors, (231), 86 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:44,249 INFO L276 IsEmpty]: Start isEmpty. Operand 21448 states and 107890 transitions. [2022-03-15 20:44:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:44:44,292 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:44,292 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:44,308 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 20:44:44,492 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 20:44:44,493 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:44:44,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:44,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2039585171, now seen corresponding path program 7 times [2022-03-15 20:44:44,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:44,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695371237] [2022-03-15 20:44:44,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:44,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:44,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:44,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695371237] [2022-03-15 20:44:44,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695371237] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:44,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622927136] [2022-03-15 20:44:44,538 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:44:44,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:44,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:44,539 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 20:44:44,540 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 20:44:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:44,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 20:44:44,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:44,722 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:44,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:44,750 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:44:44,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622927136] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:44,751 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:44,751 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 16 [2022-03-15 20:44:44,751 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [664634065] [2022-03-15 20:44:44,751 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:44,752 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:44,762 INFO L252 McrAutomatonBuilder]: Finished intersection with 119 states and 266 transitions. [2022-03-15 20:44:44,762 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:47,333 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 65 new interpolants: [350403#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 350436#(or (<= a (+ 2 i_1)) (<= i_3 (+ i_2 a))), 350409#(or (<= (+ i_3 4) (+ b a)) (< i_1 a) (<= (+ b a) (+ 2 i_3))), 350393#(or (< (+ i_3 1) (+ b a)) (< i_1 a) (<= (+ b a) i_3)), 350385#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (< i_3 (+ b a))), 350390#(or (< i_1 a) (<= b i_2)), 350404#(or (<= a i_1) (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 350429#(or (< (+ i_1 1) a) (<= a i_1) (<= b i_2)), 350389#(<= b i_2), 350423#(or (< (+ 3 i_1) a) (< (+ i_3 1) (+ b a)) (<= a (+ 2 i_1)) (<= (+ b a) i_3)), 350410#(or (< (+ i_1 1) a) (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= a i_1)), 350426#(or (<= a (+ 2 i_1)) (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 350376#(< i_1 a), 350394#(or (< i_1 a) (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 350401#(or (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 350391#(or (<= (+ 2 i_3) (+ b a)) (<= (+ b a) i_3)), 350415#(or (<= b i_2) (< i_3 (+ b a))), 350437#(or (<= a (+ i_1 1)) (<= i_3 (+ 2 i_2 i_1))), 350381#(or (<= a (+ i_1 1)) (< i_3 (+ b a)) (< (+ 2 i_1) a)), 350386#(or (<= a (+ 2 i_1)) (<= (+ i_3 1) (+ b a))), 350408#(or (<= (+ b a) (+ i_3 1)) (<= a (+ i_1 1)) (<= (+ 3 i_3) (+ b a))), 350435#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= b i_2)), 350379#(or (< (+ i_1 1) a) (<= a i_1) (< i_3 (+ b a))), 350421#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= b i_2)), 350387#(< i_2 b), 350395#(or (< i_2 b) (< i_3 (+ b a))), 350407#(or (<= (+ b a) (+ i_3 1)) (<= a (+ i_1 1)) (<= (+ 3 i_3) (+ b a)) (< (+ 2 i_1) a)), 350424#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 350382#(or (<= a i_1) (<= (+ i_3 1) (+ b a))), 350433#(or (<= i_3 (+ i_2 i_1 1)) (<= a i_1)), 350428#(or (<= a (+ 2 i_1)) (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3))), 350438#(or (<= i_3 (+ i_2 i_1 1)) (<= a (+ i_1 1))), 350396#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 350406#(or (<= (+ 2 i_3) (+ b a)) (<= (+ b a) i_3) (<= a (+ i_1 1))), 350417#(or (<= (+ b a) (+ i_3 1)) (<= b i_2) (<= (+ 3 i_3) (+ b a)) (< (+ i_2 1) b)), 350425#(or (<= a (+ 2 i_1)) (<= (+ 2 i_3) (+ b a)) (<= (+ b a) i_3)), 350418#(or (<= (+ b a) (+ i_3 1)) (<= b i_2) (<= (+ 3 i_3) (+ b a))), 350432#(or (<= i_3 (+ i_2 a)) (<= a (+ i_1 1))), 350434#(or (<= a i_1) (<= i_3 (+ i_2 i_1))), 350392#(or (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 350419#(or (<= (+ 2 i_3) (+ i_2 a)) (<= (+ b a) i_3)), 350402#(or (<= (+ 2 i_3) (+ b a)) (<= (+ b a) i_3) (<= a i_1)), 350431#(or (<= b i_2) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 350412#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 350380#(or (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 350398#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3))), 350388#(or (<= b i_2) (< (+ i_2 1) b)), 350411#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= a i_1)), 350397#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 350413#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= a (+ i_1 1))), 350430#(or (<= i_3 (+ i_2 a)) (<= a i_1)), 350427#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3))), 350377#(or (< i_1 a) (< i_3 (+ b a))), 350400#(or (< (+ i_1 1) a) (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= a i_1)), 350405#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 350383#(or (<= a (+ i_1 1)) (<= (+ i_3 1) (+ b a))), 350399#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 350420#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= b i_2) (< (+ i_2 1) b)), 350378#(or (< (+ i_1 1) a) (<= a i_1)), 350416#(or (<= (+ 2 i_3) (+ b a)) (<= (+ b a) i_3) (<= b i_2)), 350439#(or (<= a i_1) (<= (+ i_3 1) (+ i_2 i_1))), 350414#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b i_2) (< (+ i_2 1) b)), 350384#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1))), 350440#(or (<= a (+ i_1 1)) (<= i_3 (+ i_2 i_1))), 350422#(or (<= (+ 3 i_3) (+ i_2 a)) (<= (+ b a) (+ i_3 1)))] [2022-03-15 20:44:47,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-03-15 20:44:47,334 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:47,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-03-15 20:44:47,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=6184, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 20:44:47,334 INFO L87 Difference]: Start difference. First operand 21448 states and 107890 transitions. Second operand has 74 states, 74 states have (on average 2.9864864864864864) internal successors, (221), 73 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:10,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:10,892 INFO L93 Difference]: Finished difference Result 68728 states and 300404 transitions. [2022-03-15 20:45:10,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 430 states. [2022-03-15 20:45:10,893 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 2.9864864864864864) internal successors, (221), 73 states have internal predecessors, (221), 0 states have call successors, (0), 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 20:45:10,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:11,196 INFO L225 Difference]: With dead ends: 68728 [2022-03-15 20:45:11,196 INFO L226 Difference]: Without dead ends: 68582 [2022-03-15 20:45:11,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 501 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101359 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=39137, Invalid=213369, Unknown=0, NotChecked=0, Total=252506 [2022-03-15 20:45:11,206 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1929 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 5162 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1929 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 6082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 5162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:11,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1929 Valid, 1 Invalid, 6082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 5162 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 20:45:11,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68582 states. [2022-03-15 20:45:12,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68582 to 22399. [2022-03-15 20:45:12,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22399 states, 22398 states have (on average 4.742700241092955) internal successors, (106227), 22398 states have internal predecessors, (106227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:12,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22399 states to 22399 states and 106227 transitions. [2022-03-15 20:45:12,794 INFO L78 Accepts]: Start accepts. Automaton has 22399 states and 106227 transitions. Word has length 18 [2022-03-15 20:45:12,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:12,795 INFO L470 AbstractCegarLoop]: Abstraction has 22399 states and 106227 transitions. [2022-03-15 20:45:12,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 2.9864864864864864) internal successors, (221), 73 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:12,795 INFO L276 IsEmpty]: Start isEmpty. Operand 22399 states and 106227 transitions. [2022-03-15 20:45:12,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:45:12,840 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:12,840 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:12,855 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 20:45:13,040 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 20:45:13,041 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:45:13,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:13,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1166356320, now seen corresponding path program 8 times [2022-03-15 20:45:13,042 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:13,042 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079060752] [2022-03-15 20:45:13,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:13,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:13,111 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:13,111 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079060752] [2022-03-15 20:45:13,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079060752] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:13,111 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374832959] [2022-03-15 20:45:13,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:45:13,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:13,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:13,112 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 20:45:13,113 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 20:45:13,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:45:13,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:45:13,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:45:13,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:13,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:13,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374832959] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:13,362 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:45:13,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-03-15 20:45:13,362 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2056921892] [2022-03-15 20:45:13,362 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:13,363 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:13,374 INFO L252 McrAutomatonBuilder]: Finished intersection with 121 states and 273 transitions. [2022-03-15 20:45:13,374 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:16,736 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 81 new interpolants: [464936#(< i_2 b), 464970#(or (<= (+ b a) i_3) (<= b i_2) (< (+ i_2 1) b)), 465006#(or (< (+ 2 i_2) b) (< i_1 a) (<= (+ b a) (+ 3 i_3)) (<= b (+ i_2 1))), 464974#(or (<= (+ b a) (+ 3 i_3)) (<= b i_2) (< (+ i_2 1) b)), 464978#(or (< i_1 a) (<= (+ b a) (+ 3 i_3)) (<= b i_2) (< (+ i_2 1) b)), 465013#(or (< (+ 2 i_2) b) (< (+ i_1 1) a) (<= (+ b a) (+ 3 i_3)) (<= a i_1) (<= b (+ i_2 1))), 464941#(or (< i_1 a) (<= b i_2) (< (+ i_2 1) b)), 464975#(or (< i_1 a) (<= (+ b a) i_3) (<= b i_2) (< (+ i_2 1) b)), 464944#(or (< i_2 b) (< i_3 (+ b a))), 464986#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ b a) (+ i_3 1))), 465005#(or (< (+ 2 i_2) b) (<= (+ b a) (+ 3 i_3)) (<= b (+ i_2 1))), 464999#(or (< (+ 2 i_2) b) (< (+ i_1 1) a) (<= a i_1) (<= (+ b a) (+ i_3 1)) (<= b (+ i_2 1))), 464951#(or (< i_1 a) (<= (+ b a) (+ 2 i_3))), 464995#(or (< (+ 2 i_2) b) (<= (+ b a) (+ i_3 1)) (<= b (+ i_2 1))), 465007#(and (or (< i_1 a) (= (+ (* (- 1) i_3) x_2) 0)) (or (< i_1 a) (<= (+ i_2 a) (+ x_2 1)))), 464993#(or (< (+ i_1 1) a) (<= (+ b a) (+ 2 i_3)) (<= a i_1) (<= b i_2) (< (+ i_2 1) b)), 465014#(and (or (< (+ i_1 1) a) (<= (+ i_2 a) (+ x_2 1)) (<= a i_1)) (or (< (+ i_1 1) a) (= (+ (* (- 1) i_3) x_2) 0) (<= a i_1))), 464997#(or (< (+ 2 i_2) b) (< (+ i_1 1) a) (<= a i_1) (<= b (+ i_2 1))), 464949#(or (< (+ 2 i_2) b) (<= b (+ i_2 1))), 464950#(or (< i_1 a) (<= (+ b a) (+ i_3 1))), 464977#(or (< i_1 a) (<= (+ b a) (+ 2 i_3)) (<= b i_2) (< (+ i_2 1) b)), 464939#(or (< (+ i_1 1) a) (<= a i_1)), 464940#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1)), 464984#(or (< (+ 2 i_2) b) (< i_1 a) (<= (+ b a) i_3) (<= b (+ i_2 1))), 464966#(or (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 464985#(or (< (+ i_1 1) a) (<= (+ b a) i_3) (<= a i_1)), 464963#(or (< i_1 a) (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 465012#(or (<= (+ i_2 a) (+ 2 i_3)) (< (+ i_1 1) a) (<= a i_1)), 464946#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 465003#(or (< (+ 2 i_2) b) (< (+ i_1 1) a) (<= (+ b a) (+ 2 i_3)) (<= a i_1) (<= b (+ i_2 1))), 464961#(or (<= (+ b a) (+ 3 i_3)) (< i_2 b)), 464962#(or (< i_1 a) (< i_2 b) (<= (+ b a) (+ i_3 1))), 464947#(or (< i_2 b) (<= (+ b a) i_3)), 464996#(or (< (+ 2 i_2) b) (< i_1 a) (<= (+ b a) (+ i_3 1)) (<= b (+ i_2 1))), 464979#(or (<= (+ i_2 a) (+ 2 i_3)) (< i_1 a)), 464973#(or (< (+ i_3 4) (+ b a)) (<= (+ b a) (+ 3 i_3)) (<= b i_2) (< (+ i_2 1) b)), 464968#(or (<= (+ b a) (+ i_3 1)) (<= b i_2) (< (+ i_2 1) b) (< (+ 2 i_3) (+ b a))), 464990#(or (< (+ i_1 1) a) (<= (+ b a) (+ 2 i_3)) (< i_2 b) (<= a i_1)), 464998#(or (< (+ 2 i_2) b) (< (+ i_1 1) a) (<= (+ b a) i_3) (<= a i_1) (<= b (+ i_2 1))), 464992#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ b a) (+ i_3 1)) (<= b i_2) (< (+ i_2 1) b)), 464943#(< i_3 (+ b a)), 464952#(or (< i_1 a) (<= (+ b a) (+ 3 i_3))), 464954#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3))), 465008#(or (< (+ i_1 1) a) (<= (+ b a) (+ 3 i_3)) (<= a i_1)), 464945#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3)), 464957#(or (< i_2 b) (<= (+ b a) (+ i_3 1))), 464934#(< i_1 a), 464994#(or (< (+ 2 i_2) b) (<= (+ b a) (+ i_3 1)) (<= b (+ i_2 1)) (< (+ 2 i_3) (+ b a))), 464989#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1) (<= (+ b a) (+ i_3 1))), 464964#(or (< i_1 a) (<= (+ b a) (+ 3 i_3)) (< i_2 b)), 464987#(or (< (+ i_1 1) a) (<= (+ b a) (+ 2 i_3)) (<= a i_1)), 465010#(or (< (+ i_1 1) a) (<= (+ b a) (+ 3 i_3)) (<= a i_1) (<= b i_2) (< (+ i_2 1) b)), 464956#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 464980#(or (< (+ 2 i_2) b) (<= b (+ i_2 1)) (< i_3 (+ b a))), 464953#(or (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 464967#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b i_2) (< (+ i_2 1) b)), 464972#(or (<= (+ b a) (+ 2 i_3)) (<= b i_2) (< (+ i_2 1) b)), 464976#(or (< i_1 a) (<= (+ b a) (+ i_3 1)) (<= b i_2) (< (+ i_2 1) b)), 465009#(or (< (+ i_1 1) a) (<= (+ b a) (+ 3 i_3)) (< i_2 b) (<= a i_1)), 465004#(or (< (+ i_3 4) (+ b a)) (< (+ 2 i_2) b) (<= (+ b a) (+ 3 i_3)) (<= b (+ i_2 1))), 464981#(or (< (+ 2 i_2) b) (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b (+ i_2 1))), 464935#(or (< i_1 a) (<= (+ b a) i_3)), 464959#(or (< (+ i_3 4) (+ b a)) (<= (+ b a) (+ 3 i_3))), 464942#(or (< (+ i_1 1) a) (<= a i_1) (<= b i_2) (< (+ i_2 1) b)), 464982#(or (< (+ 2 i_2) b) (<= (+ b a) i_3) (<= b (+ i_2 1))), 464948#(or (< i_1 a) (< i_2 b) (<= (+ b a) i_3)), 464937#(or (<= b i_2) (< (+ i_2 1) b)), 465002#(or (< (+ 2 i_2) b) (< i_1 a) (<= (+ b a) (+ 2 i_3)) (<= b (+ i_2 1))), 465001#(or (< (+ 2 i_2) b) (<= (+ b a) (+ 2 i_3)) (<= b (+ i_2 1))), 464965#(or (< i_1 a) (<= (+ i_2 a) (+ 3 i_3))), 464969#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= b i_2) (< (+ i_2 1) b)), 465000#(or (< (+ 3 i_3) (+ b a)) (< (+ 2 i_2) b) (<= (+ b a) (+ 2 i_3)) (<= b (+ i_2 1))), 464983#(or (< (+ 2 i_2) b) (< i_1 a) (<= b (+ i_2 1))), 464955#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 464971#(or (<= (+ b a) (+ i_3 1)) (<= b i_2) (< (+ i_2 1) b)), 464991#(or (< (+ i_1 1) a) (<= (+ b a) i_3) (<= a i_1) (<= b i_2) (< (+ i_2 1) b)), 464988#(or (< (+ i_1 1) a) (< i_2 b) (<= (+ b a) i_3) (<= a i_1)), 464960#(or (< (+ i_3 4) (+ b a)) (<= (+ b a) (+ 3 i_3)) (< i_2 b)), 465011#(or (< (+ i_1 1) a) (<= (+ i_2 a) (+ 3 i_3)) (<= a i_1)), 464938#(or (< i_1 a) (< i_2 b)), 464958#(or (<= (+ b a) (+ 2 i_3)) (< i_2 b))] [2022-03-15 20:45:16,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-03-15 20:45:16,737 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:16,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-03-15 20:45:16,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1162, Invalid=9550, Unknown=0, NotChecked=0, Total=10712 [2022-03-15 20:45:16,738 INFO L87 Difference]: Start difference. First operand 22399 states and 106227 transitions. Second operand has 92 states, 92 states have (on average 2.6739130434782608) internal successors, (246), 91 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 20:45:42,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:42,882 INFO L93 Difference]: Finished difference Result 34638 states and 154664 transitions. [2022-03-15 20:45:42,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 437 states. [2022-03-15 20:45:42,882 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 2.6739130434782608) internal successors, (246), 91 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) Word has length 18 [2022-03-15 20:45:42,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:43,000 INFO L225 Difference]: With dead ends: 34638 [2022-03-15 20:45:43,000 INFO L226 Difference]: Without dead ends: 34451 [2022-03-15 20:45:43,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 525 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108559 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=39389, Invalid=237813, Unknown=0, NotChecked=0, Total=277202 [2022-03-15 20:45:43,010 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 2017 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 4357 mSolverCounterSat, 1517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2017 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 5874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1517 IncrementalHoareTripleChecker+Valid, 4357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:43,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2017 Valid, 1 Invalid, 5874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1517 Valid, 4357 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 20:45:43,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34451 states. [2022-03-15 20:45:43,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34451 to 25123. [2022-03-15 20:45:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25123 states, 25122 states have (on average 4.756030570814426) internal successors, (119481), 25122 states have internal predecessors, (119481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25123 states to 25123 states and 119481 transitions. [2022-03-15 20:45:44,015 INFO L78 Accepts]: Start accepts. Automaton has 25123 states and 119481 transitions. Word has length 18 [2022-03-15 20:45:44,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:44,015 INFO L470 AbstractCegarLoop]: Abstraction has 25123 states and 119481 transitions. [2022-03-15 20:45:44,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 2.6739130434782608) internal successors, (246), 91 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 20:45:44,015 INFO L276 IsEmpty]: Start isEmpty. Operand 25123 states and 119481 transitions. [2022-03-15 20:45:44,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:45:44,088 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:44,089 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:44,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 20:45:44,303 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 20:45:44,303 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:45:44,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:44,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1819977907, now seen corresponding path program 9 times [2022-03-15 20:45:44,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:44,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937171610] [2022-03-15 20:45:44,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:44,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:44,488 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:45:44,488 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:44,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937171610] [2022-03-15 20:45:44,489 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937171610] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:44,489 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562043020] [2022-03-15 20:45:44,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:45:44,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:44,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:44,490 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 20:45:44,491 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 20:45:44,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 20:45:44,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:45:44,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 20:45:44,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:44,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:45:44,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562043020] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:44,697 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:45:44,697 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 15 [2022-03-15 20:45:44,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1788647385] [2022-03-15 20:45:44,697 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:44,698 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:44,709 INFO L252 McrAutomatonBuilder]: Finished intersection with 127 states and 290 transitions. [2022-03-15 20:45:44,709 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:47,388 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 66 new interpolants: [550869#(or (< (+ 2 i_2) b) (<= b (+ i_2 1))), 550895#(or (< i_1 a) (<= b i_2)), 550875#(or (<= (+ 2 i_3) (+ b a)) (<= (+ b a) i_3)), 550909#(or (<= (+ i_3 4) (+ b a)) (< i_1 a) (<= (+ b a) (+ 2 i_3))), 550896#(or (<= i_3 (+ i_2 a)) (< i_1 a)), 550879#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (< (+ 3 i_2) b) (<= b (+ 2 i_2))), 550924#(or (< (+ i_1 1) a) (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= a i_1)), 550881#(<= b (+ i_2 1)), 550897#(or (< (+ i_3 1) (+ b a)) (< i_1 a) (<= (+ b a) i_3)), 550873#(or (< (+ 2 i_2) b) (<= b (+ i_2 1)) (< i_3 (+ b a))), 550920#(or (< (+ i_1 1) a) (<= i_3 (+ i_2 a 1)) (<= a i_1) (<= b i_2)), 550889#(or (<= (+ b a) (+ i_3 1)) (<= b i_2) (<= (+ 3 i_3) (+ b a)) (< (+ i_2 1) b)), 550898#(or (< i_1 a) (<= (+ b a) i_3) (<= (+ i_3 1) (+ i_2 a))), 550872#(or (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 550867#(< i_2 b), 550917#(or (< (+ i_1 1) a) (<= a i_1) (<= b i_2) (<= i_3 (+ 2 i_2 a))), 550868#(or (<= b i_2) (< (+ i_2 1) b)), 550911#(or (<= (+ 2 i_3) (+ i_2 a)) (< i_1 a) (<= (+ b a) i_3)), 550901#(or (< i_1 a) (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 550905#(or (< i_1 a) (<= b i_2) (<= i_3 (+ 2 i_2 a))), 550903#(or (< i_1 a) (<= (+ i_3 1) (+ i_2 a))), 550885#(or (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 550886#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3))), 550928#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (< (+ 3 i_2) b) (<= b (+ 2 i_2))), 550922#(or (< (+ i_1 1) a) (<= (+ 2 i_3) (+ i_2 a)) (<= a i_1) (<= (+ b a) (+ i_3 1))), 550870#(or (< (+ 3 i_2) b) (<= b (+ 2 i_2))), 550912#(or (< (+ i_1 1) a) (<= a i_1) (<= b i_2)), 550864#(or (< (+ i_1 1) a) (<= a i_1)), 550877#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b i_2) (< (+ i_2 1) b)), 550892#(or (<= (+ 2 i_3) (+ i_2 a)) (<= (+ b a) (+ i_3 1))), 550921#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 550866#(or (< (+ i_1 1) a) (<= a i_1) (< i_3 (+ b a))), 550914#(or (< (+ i_1 1) a) (<= a i_1) (<= b (+ 2 i_2))), 550883#(or (<= b i_2) (<= i_3 (+ 2 i_2 a))), 550893#(or (<= (+ b a) (+ 2 i_3)) (<= (+ 3 i_3) (+ i_2 a))), 550927#(or (< (+ 3 i_2) b) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a)) (<= b (+ 2 i_2))), 550863#(< i_1 a), 550915#(or (< (+ i_1 1) a) (<= i_3 (+ i_2 a)) (<= a i_1)), 550925#(or (< (+ i_1 1) a) (<= (+ b a) (+ 2 i_3)) (<= (+ 3 i_3) (+ i_2 a)) (<= a i_1)), 550899#(or (< i_1 a) (<= b (+ i_2 1))), 550894#(or (< (+ 2 i_2) b) (<= (+ b a) (+ i_3 1)) (<= b (+ i_2 1)) (< (+ 2 i_3) (+ b a))), 550874#(or (< (+ 3 i_2) b) (< i_3 (+ b a)) (<= b (+ 2 i_2))), 550878#(or (< (+ 2 i_2) b) (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b (+ i_2 1))), 550904#(or (< i_1 a) (<= b (+ 2 i_2))), 550913#(or (< (+ i_1 1) a) (<= a i_1) (<= b (+ i_2 1))), 550910#(or (< i_1 a) (<= (+ b a) (+ 2 i_3)) (<= (+ 3 i_3) (+ i_2 a))), 550865#(or (< i_1 a) (< i_3 (+ b a))), 550908#(or (<= (+ 2 i_3) (+ i_2 a)) (<= (+ b a) i_3)), 550888#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 550891#(or (<= (+ b a) i_3) (<= (+ i_3 1) (+ i_2 a))), 550887#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 550890#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= b i_2) (< (+ i_2 1) b)), 550884#(or (<= i_3 (+ i_2 a 1)) (<= b i_2)), 550907#(or (< (+ 3 i_3) (+ b a)) (< (+ 2 i_2) b) (<= (+ b a) (+ 2 i_3)) (<= b (+ i_2 1))), 550926#(or (< (+ i_1 1) a) (<= (+ 2 i_3) (+ i_2 a)) (<= (+ b a) i_3) (<= a i_1)), 550900#(or (< i_1 a) (<= i_3 (+ i_2 a 1))), 550906#(or (< i_1 a) (<= i_3 (+ i_2 a 1)) (<= b i_2)), 550876#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 550871#(or (< i_2 b) (< i_3 (+ b a))), 550916#(or (< (+ i_1 1) a) (<= i_3 (+ i_2 a 1)) (<= a i_1)), 550918#(or (< (+ i_1 1) a) (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= a i_1)), 550902#(or (<= (+ 2 i_3) (+ i_2 a)) (< i_1 a) (<= (+ b a) (+ i_3 1))), 550923#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ i_3 1) (+ i_2 a))), 550880#(<= b i_2), 550882#(<= b (+ 2 i_2)), 550919#(or (< (+ i_1 1) a) (<= (+ b a) i_3) (<= a i_1) (<= (+ i_3 1) (+ i_2 a)))] [2022-03-15 20:45:47,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-03-15 20:45:47,388 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:47,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-03-15 20:45:47,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=589, Invalid=6053, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 20:45:47,389 INFO L87 Difference]: Start difference. First operand 25123 states and 119481 transitions. Second operand has 73 states, 73 states have (on average 3.095890410958904) internal successors, (226), 72 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:56,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:56,280 INFO L93 Difference]: Finished difference Result 47679 states and 217706 transitions. [2022-03-15 20:45:56,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2022-03-15 20:45:56,281 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 3.095890410958904) internal successors, (226), 72 states have internal predecessors, (226), 0 states have call successors, (0), 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 20:45:56,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:56,470 INFO L225 Difference]: With dead ends: 47679 [2022-03-15 20:45:56,470 INFO L226 Difference]: Without dead ends: 47639 [2022-03-15 20:45:56,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22147 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=12960, Invalid=57000, Unknown=0, NotChecked=0, Total=69960 [2022-03-15 20:45:56,473 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1034 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 4298 mSolverCounterSat, 693 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 4991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 693 IncrementalHoareTripleChecker+Valid, 4298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:56,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1034 Valid, 1 Invalid, 4991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [693 Valid, 4298 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 20:45:56,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47639 states. [2022-03-15 20:45:57,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47639 to 37836. [2022-03-15 20:45:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37836 states, 37835 states have (on average 4.859891634729747) internal successors, (183874), 37835 states have internal predecessors, (183874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37836 states to 37836 states and 183874 transitions. [2022-03-15 20:45:57,635 INFO L78 Accepts]: Start accepts. Automaton has 37836 states and 183874 transitions. Word has length 18 [2022-03-15 20:45:57,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:57,635 INFO L470 AbstractCegarLoop]: Abstraction has 37836 states and 183874 transitions. [2022-03-15 20:45:57,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 3.095890410958904) internal successors, (226), 72 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 37836 states and 183874 transitions. [2022-03-15 20:45:57,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:45:57,709 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:57,709 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:57,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-03-15 20:45:57,910 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 20:45:57,910 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:45:57,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:57,910 INFO L85 PathProgramCache]: Analyzing trace with hash 681761802, now seen corresponding path program 10 times [2022-03-15 20:45:57,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:57,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967436243] [2022-03-15 20:45:57,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:57,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:58,187 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:58,187 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:58,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967436243] [2022-03-15 20:45:58,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967436243] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:58,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846144367] [2022-03-15 20:45:58,187 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:45:58,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:58,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:58,188 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 20:45:58,189 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 20:45:58,211 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:45:58,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:45:58,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 20:45:58,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:58,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:58,381 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:45:58,382 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846144367] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:58,382 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:45:58,382 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 16 [2022-03-15 20:45:58,382 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [83192540] [2022-03-15 20:45:58,382 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:58,383 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:58,394 INFO L252 McrAutomatonBuilder]: Finished intersection with 129 states and 295 transitions. [2022-03-15 20:45:58,394 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:46:01,521 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 72 new interpolants: [674767#(< i_2 b), 674782#(or (< (+ i_3 1) (+ b a)) (< i_1 a) (<= (+ b a) i_3)), 674768#(or (<= b i_2) (< (+ i_2 1) b)), 674770#(or (< i_1 a) (<= b i_2)), 674773#(or (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 674830#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= a (+ i_1 1))), 674805#(or (<= (+ b a) (+ i_3 1)) (<= b i_2) (<= (+ 3 i_3) (+ b a)) (< (+ i_2 1) b)), 674815#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 674783#(or (< i_1 a) (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 674817#(or (<= a i_1) (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 674812#(or (<= (+ b a) (+ i_3 1)) (<= b (+ i_2 1)) (<= (+ 3 i_3) (+ b a))), 674793#(or (<= (+ 2 i_3) (+ b a)) (<= (+ b a) i_3) (<= a i_1)), 674806#(or (<= (+ b a) (+ i_3 1)) (<= b i_2) (<= (+ 3 i_3) (+ b a))), 674779#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 674833#(or (<= a i_1) (<= i_3 (+ 2 i_2 i_1))), 674775#(or (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 674807#(or (< (+ 2 i_2) b) (<= b (+ i_2 1)) (< i_3 (+ b a))), 674797#(or (<= i_3 (+ i_2 a)) (<= a i_1)), 674804#(or (<= (+ b a) i_3) (<= (+ i_3 1) (+ i_2 a)) (<= a (+ i_1 1))), 674784#(or (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 674816#(or (< (+ i_1 1) a) (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= a i_1)), 674772#(or (< (+ i_1 1) a) (<= a i_1) (<= b i_2)), 674798#(or (<= (+ b a) i_3) (<= a i_1) (<= (+ i_3 1) (+ i_2 a))), 674794#(or (<= b i_2) (< i_3 (+ b a))), 674831#(or (<= i_3 (+ i_2 a 1)) (<= a i_1)), 674823#(or (<= (+ 2 i_3) (+ i_2 a)) (<= a i_1) (<= (+ b a) (+ i_3 1))), 674813#(or (<= b (+ i_2 1)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 674774#(or (<= b i_2) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 674835#(or (<= (+ 2 i_3) (+ i_2 a)) (<= (+ b a) (+ i_3 1)) (<= a (+ i_1 1))), 674790#(or (< (+ i_1 1) a) (<= a i_1) (< i_3 (+ b a))), 674778#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 674822#(or (<= (+ b a) (+ 2 i_3)) (<= (+ 3 i_3) (+ i_2 a))), 674765#(or (<= (+ 2 i_3) (+ b a)) (<= (+ b a) i_3)), 674792#(or (< (+ i_1 1) a) (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= a i_1)), 674799#(or (<= a (+ i_1 1)) (< i_3 (+ b a)) (< (+ 2 i_1) a)), 674810#(or (<= (+ 2 i_3) (+ b a)) (<= (+ b a) i_3) (<= b (+ i_2 1))), 674832#(or (<= i_3 (+ i_2 a 1)) (<= a (+ i_1 1))), 674788#(or (< i_1 a) (<= b (+ i_2 1))), 674796#(or (<= (+ b a) i_3) (<= (+ i_3 1) (+ i_2 a))), 674829#(or (<= (+ b a) (+ i_3 1)) (<= a (+ i_1 1)) (<= (+ 3 i_3) (+ b a))), 674811#(or (< (+ 2 i_2) b) (<= (+ b a) (+ i_3 1)) (<= b (+ i_2 1)) (< (+ 2 i_3) (+ b a))), 674826#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= b (+ i_2 1))), 674771#(or (< (+ i_1 1) a) (<= a i_1)), 674787#(<= b (+ i_2 1)), 674791#(or (<= a i_1) (<= (+ i_3 1) (+ b a))), 674820#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= b i_2)), 674777#(or (< i_2 b) (< i_3 (+ b a))), 674795#(or (<= (+ 2 i_3) (+ b a)) (<= (+ b a) i_3) (<= b i_2)), 674801#(or (<= i_3 (+ i_2 a)) (<= a (+ i_1 1))), 674825#(or (< (+ 3 i_3) (+ b a)) (< (+ 2 i_2) b) (<= (+ b a) (+ 2 i_3)) (<= b (+ i_2 1))), 674789#(or (< (+ i_1 1) a) (<= a i_1) (<= b (+ i_2 1))), 674814#(or (<= (+ i_3 4) (+ b a)) (< i_1 a) (<= (+ b a) (+ 2 i_3))), 674786#(or (< (+ 2 i_2) b) (<= b (+ i_2 1))), 674819#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= b i_2) (< (+ i_2 1) b)), 674821#(or (<= (+ 2 i_3) (+ i_2 a)) (<= (+ b a) (+ i_3 1))), 674785#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b i_2) (< (+ i_2 1) b)), 674776#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3))), 674808#(or (< (+ 2 i_2) b) (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b (+ i_2 1))), 674780#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 674827#(or (<= (+ b a) (+ i_3 1)) (<= a (+ i_1 1)) (<= (+ 3 i_3) (+ b a)) (< (+ 2 i_1) a)), 674824#(or (<= (+ b a) (+ 2 i_3)) (<= (+ 3 i_3) (+ i_2 a)) (<= a i_1)), 674802#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 674781#(or (< i_1 a) (< i_3 (+ b a))), 674800#(or (<= a (+ i_1 1)) (<= (+ i_3 1) (+ b a))), 674818#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= a i_1)), 674836#(or (<= (+ b a) (+ 2 i_3)) (<= (+ 3 i_3) (+ i_2 a)) (<= a (+ i_1 1))), 674828#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 674803#(or (<= (+ 2 i_3) (+ b a)) (<= (+ b a) i_3) (<= a (+ i_1 1))), 674834#(or (<= (+ b a) i_3) (<= (+ i_3 1) (+ i_2 i_1))), 674766#(< i_1 a), 674769#(<= b i_2), 674809#(or (<= b (+ i_2 1)) (< i_3 (+ b a)))] [2022-03-15 20:46:01,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-03-15 20:46:01,521 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:46:01,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-03-15 20:46:01,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=7339, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 20:46:01,522 INFO L87 Difference]: Start difference. First operand 37836 states and 183874 transitions. Second operand has 81 states, 81 states have (on average 3.037037037037037) internal successors, (246), 80 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 20:46:29,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:46:29,596 INFO L93 Difference]: Finished difference Result 139722 states and 640582 transitions. [2022-03-15 20:46:29,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 504 states. [2022-03-15 20:46:29,597 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 3.037037037037037) internal successors, (246), 80 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) Word has length 18 [2022-03-15 20:46:29,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:46:30,674 INFO L225 Difference]: With dead ends: 139722 [2022-03-15 20:46:30,675 INFO L226 Difference]: Without dead ends: 139651 [2022-03-15 20:46:30,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 581 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139632 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=53029, Invalid=286277, Unknown=0, NotChecked=0, Total=339306 [2022-03-15 20:46:30,687 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 2038 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 5670 mSolverCounterSat, 1224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2038 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 6894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1224 IncrementalHoareTripleChecker+Valid, 5670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:46:30,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2038 Valid, 1 Invalid, 6894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1224 Valid, 5670 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 20:46:30,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139651 states. [2022-03-15 20:46:34,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139651 to 74889. [2022-03-15 20:46:34,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74889 states, 74888 states have (on average 5.024516611473133) internal successors, (376276), 74888 states have internal predecessors, (376276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74889 states to 74889 states and 376276 transitions. [2022-03-15 20:46:35,488 INFO L78 Accepts]: Start accepts. Automaton has 74889 states and 376276 transitions. Word has length 18 [2022-03-15 20:46:35,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:46:35,488 INFO L470 AbstractCegarLoop]: Abstraction has 74889 states and 376276 transitions. [2022-03-15 20:46:35,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 3.037037037037037) internal successors, (246), 80 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 20:46:35,488 INFO L276 IsEmpty]: Start isEmpty. Operand 74889 states and 376276 transitions. [2022-03-15 20:46:35,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:46:35,635 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:46:35,635 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:46:35,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-03-15 20:46:35,835 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 20:46:35,836 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:46:35,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:46:35,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1728499727, now seen corresponding path program 6 times [2022-03-15 20:46:35,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:46:35,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081552303] [2022-03-15 20:46:35,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:46:35,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:46:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:46:35,888 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:35,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:46:35,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081552303] [2022-03-15 20:46:35,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081552303] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:46:35,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576262147] [2022-03-15 20:46:35,889 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:46:35,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:35,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:46:35,891 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 20:46:35,893 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 20:46:35,916 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 20:46:35,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:46:35,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:46:35,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:46:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:36,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:46:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:36,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576262147] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:46:36,121 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:46:36,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 18 [2022-03-15 20:46:36,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1777705918] [2022-03-15 20:46:36,121 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:46:36,122 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:46:36,132 INFO L252 McrAutomatonBuilder]: Finished intersection with 112 states and 248 transitions. [2022-03-15 20:46:36,133 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:46:38,638 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 60 new interpolants: [965476#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3))), 965456#(or (<= (+ b a) i_3) (<= (+ i_2 a) (+ i_3 1))), 965471#(or (<= (+ 2 i_2 a) i_3) (< i_1 a)), 965449#(or (< i_2 b) (< i_3 (+ b a))), 965480#(or (<= (+ b a) (+ i_3 1)) (<= (+ i_2 a) (+ i_3 1))), 965465#(or (< i_1 a) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 965497#(or (<= (+ b a) (+ i_3 1)) (<= (+ i_2 4) b) (< (+ 2 i_3) (+ b a)) (<= b (+ 2 i_2))), 965451#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 965475#(or (< i_1 a) (<= (+ b a) i_3) (<= (+ i_2 a 1) i_3)), 965462#(or (< i_1 a) (<= (+ i_2 a) i_3)), 965457#(or (<= (+ b a) i_3) (<= (+ i_2 a) i_3)), 965482#(or (< (+ i_3 4) (+ b a)) (<= (+ b a) (+ 3 i_3)) (< i_2 b)), 965461#(or (<= (+ i_2 1) b) (< i_1 a)), 965505#(or (< i_1 a) (<= (+ 3 i_2 a) i_3)), 965463#(or (< i_1 a) (<= (+ 2 i_2) b) (<= b i_2)), 965495#(or (<= (+ i_2 4) b) (< i_3 (+ b a)) (<= b (+ 2 i_2))), 965452#(or (<= (+ 2 i_2) b) (<= b i_2)), 965489#(or (< (+ i_3 4) (+ b a)) (< i_1 a) (<= (+ b a) (+ 3 i_3))), 965458#(< i_1 a), 965447#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3)), 965484#(or (< (+ i_3 4) (+ b a)) (<= (+ b a) (+ 3 i_3)) (<= b i_2) (< (+ i_2 1) b)), 965492#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= (+ 3 i_2) b) (<= b (+ i_2 1))), 965455#(or (<= (+ b a) (+ i_3 1)) (<= (+ 2 i_2) b) (<= b i_2) (< (+ 2 i_3) (+ b a))), 965459#(or (< i_1 a) (< i_3 (+ b a))), 965469#(or (< i_1 a) (<= (+ 3 i_2) b) (<= b (+ i_2 1))), 965479#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= (+ 2 i_2) b) (<= b i_2)), 965460#(or (< (+ i_3 1) (+ b a)) (< i_1 a) (<= (+ b a) i_3)), 965467#(or (< i_1 a) (<= (+ b a) i_3) (<= (+ i_2 a) i_3)), 965488#(or (< i_1 a) (<= (+ b a) (+ i_3 1)) (<= (+ i_2 a) (+ i_3 1))), 965468#(or (<= (+ 3 i_2) b) (<= b (+ i_2 1))), 965464#(or (< i_1 a) (<= (+ i_2 a 1) i_3)), 965502#(or (< i_1 a) (<= (+ b a) (+ i_3 1)) (<= (+ i_2 a) i_3)), 965498#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= (+ i_2 4) b) (<= b (+ 2 i_2))), 965486#(or (< (+ 3 i_3) (+ b a)) (< i_1 a) (<= (+ b a) (+ 2 i_3))), 965485#(or (<= (+ i_2 a) (+ 2 i_3)) (<= (+ b a) (+ 2 i_3))), 965466#(or (< i_1 a) (<= (+ b a) i_3) (<= (+ i_2 a) (+ i_3 1))), 965446#(< i_3 (+ b a)), 965472#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= (+ 3 i_2) b) (<= b (+ i_2 1))), 965478#(or (<= (+ i_2 a) (+ 2 i_3)) (<= (+ b a) (+ i_3 1))), 965491#(or (<= (+ i_2 a) (+ 2 i_3)) (< i_1 a) (<= (+ b a) (+ 2 i_3))), 965501#(or (<= (+ b a) (+ 2 i_3)) (<= (+ i_2 a) (+ i_3 1))), 965474#(or (<= (+ b a) i_3) (<= (+ i_2 a 1) i_3)), 965500#(or (<= (+ b a) (+ i_3 1)) (<= (+ i_2 a) i_3)), 965481#(or (< (+ i_3 4) (+ b a)) (<= (+ b a) (+ 3 i_3))), 965496#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= (+ i_2 4) b) (<= b (+ 2 i_2))), 965450#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 965454#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= (+ 2 i_2) b) (<= b i_2)), 965493#(or (< (+ i_3 4) (+ b a)) (<= (+ b a) (+ 3 i_3)) (<= (+ 3 i_2) b) (<= b (+ i_2 1))), 965504#(or (< i_1 a) (<= (+ i_2 4) b) (<= b (+ 2 i_2))), 965499#(or (< (+ i_3 4) (+ b a)) (<= (+ b a) (+ 3 i_3)) (<= (+ i_2 4) b) (<= b (+ 2 i_2))), 965470#(or (<= (+ 3 i_2) b) (<= b (+ i_2 1)) (< i_3 (+ b a))), 965483#(or (<= (+ i_2 a) (+ 3 i_3)) (<= (+ b a) (+ 2 i_3))), 965503#(or (< i_1 a) (<= (+ b a) (+ 2 i_3)) (<= (+ i_2 a) (+ i_3 1))), 965448#(or (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 965453#(or (<= (+ 2 i_2) b) (<= b i_2) (< i_3 (+ b a))), 965477#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 965473#(or (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_2) b) (<= b (+ i_2 1)) (< (+ 2 i_3) (+ b a))), 965494#(or (<= (+ i_2 4) b) (<= b (+ 2 i_2))), 965487#(or (<= (+ i_2 a) (+ 2 i_3)) (< i_1 a) (<= (+ b a) (+ i_3 1))), 965490#(or (< i_1 a) (<= (+ i_2 a) (+ 3 i_3)) (<= (+ b a) (+ 2 i_3)))] [2022-03-15 20:46:38,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-03-15 20:46:38,638 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:46:38,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-03-15 20:46:38,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=5298, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 20:46:38,640 INFO L87 Difference]: Start difference. First operand 74889 states and 376276 transitions. Second operand has 69 states, 69 states have (on average 3.0144927536231885) internal successors, (208), 68 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:51,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:46:51,022 INFO L93 Difference]: Finished difference Result 82314 states and 403354 transitions. [2022-03-15 20:46:51,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2022-03-15 20:46:51,023 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 3.0144927536231885) internal successors, (208), 68 states have internal predecessors, (208), 0 states have call successors, (0), 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 20:46:51,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:46:51,642 INFO L225 Difference]: With dead ends: 82314 [2022-03-15 20:46:51,642 INFO L226 Difference]: Without dead ends: 82251 [2022-03-15 20:46:51,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31198 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=13870, Invalid=75830, Unknown=0, NotChecked=0, Total=89700 [2022-03-15 20:46:51,645 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1740 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 4449 mSolverCounterSat, 1331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 5780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1331 IncrementalHoareTripleChecker+Valid, 4449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:46:51,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1740 Valid, 1 Invalid, 5780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1331 Valid, 4449 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 20:46:51,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82251 states. [2022-03-15 20:46:53,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82251 to 75984. [2022-03-15 20:46:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75984 states, 75983 states have (on average 5.019622810365476) internal successors, (381406), 75983 states have internal predecessors, (381406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75984 states to 75984 states and 381406 transitions. [2022-03-15 20:46:54,662 INFO L78 Accepts]: Start accepts. Automaton has 75984 states and 381406 transitions. Word has length 18 [2022-03-15 20:46:54,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:46:54,662 INFO L470 AbstractCegarLoop]: Abstraction has 75984 states and 381406 transitions. [2022-03-15 20:46:54,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 3.0144927536231885) internal successors, (208), 68 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:54,662 INFO L276 IsEmpty]: Start isEmpty. Operand 75984 states and 381406 transitions. [2022-03-15 20:46:54,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:46:54,971 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:46:54,971 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:46:54,986 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 20:46:55,175 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 20:46:55,175 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:46:55,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:46:55,176 INFO L85 PathProgramCache]: Analyzing trace with hash -175765971, now seen corresponding path program 13 times [2022-03-15 20:46:55,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:46:55,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422483696] [2022-03-15 20:46:55,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:46:55,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:46:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:46:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:55,242 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:46:55,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422483696] [2022-03-15 20:46:55,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422483696] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:46:55,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423024044] [2022-03-15 20:46:55,242 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:46:55,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:55,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:46:55,243 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 20:46:55,244 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 20:46:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:46:55,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 20:46:55,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:46:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:55,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:46:55,525 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:55,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423024044] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:46:55,526 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:46:55,526 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 5] total 15 [2022-03-15 20:46:55,526 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1411921690] [2022-03-15 20:46:55,526 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:46:55,527 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:46:55,538 INFO L252 McrAutomatonBuilder]: Finished intersection with 112 states and 238 transitions. [2022-03-15 20:46:55,538 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:46:57,158 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [1200357#(and (< x_3 (+ (* 3 c) x_2 x_1 1)) (<= (+ (* 3 c) x_2 x_1) x_3)), 1200355#(and (< x_3 (+ x_2 x_1 c 1)) (<= (+ x_2 x_1 c) x_3)), 1200358#(and (< x_3 (+ (* c 4) x_2 x_1 1)) (<= (+ (* c 4) x_2 x_1) x_3)), 1200356#(and (<= (+ x_2 x_1 (* 2 c)) x_3) (< x_3 (+ x_2 x_1 (* 2 c) 1)))] [2022-03-15 20:46:57,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:46:57,159 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:46:57,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:46:57,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:46:57,159 INFO L87 Difference]: Start difference. First operand 75984 states and 381406 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:58,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:46:58,671 INFO L93 Difference]: Finished difference Result 102207 states and 510328 transitions. [2022-03-15 20:46:58,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 20:46:58,671 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 20:46:58,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:46:59,196 INFO L225 Difference]: With dead ends: 102207 [2022-03-15 20:46:59,197 INFO L226 Difference]: Without dead ends: 102203 [2022-03-15 20:46:59,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 106 SyntacticMatches, 12 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:46:59,197 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 38 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:46:59,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 1 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:46:59,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102203 states. [2022-03-15 20:47:02,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102203 to 97240. [2022-03-15 20:47:02,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97240 states, 97239 states have (on average 5.033679902096895) internal successors, (489470), 97239 states have internal predecessors, (489470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:03,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97240 states to 97240 states and 489470 transitions. [2022-03-15 20:47:03,314 INFO L78 Accepts]: Start accepts. Automaton has 97240 states and 489470 transitions. Word has length 19 [2022-03-15 20:47:03,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:03,314 INFO L470 AbstractCegarLoop]: Abstraction has 97240 states and 489470 transitions. [2022-03-15 20:47:03,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:03,314 INFO L276 IsEmpty]: Start isEmpty. Operand 97240 states and 489470 transitions. [2022-03-15 20:47:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:47:03,500 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:03,500 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:03,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-15 20:47:03,701 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 20:47:03,701 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:47:03,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:03,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1464542374, now seen corresponding path program 7 times [2022-03-15 20:47:03,702 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:03,702 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218255421] [2022-03-15 20:47:03,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:03,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:03,785 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:03,786 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:03,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218255421] [2022-03-15 20:47:03,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218255421] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:03,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044212746] [2022-03-15 20:47:03,786 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:47:03,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:03,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:03,787 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 20:47:03,787 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 20:47:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:03,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 20:47:03,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:03,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:03,931 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:03,931 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044212746] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:03,931 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:03,931 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-03-15 20:47:03,931 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [630206676] [2022-03-15 20:47:03,931 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:03,932 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:03,944 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 293 transitions. [2022-03-15 20:47:03,944 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:06,230 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 54 new interpolants: [1497209#(or (<= b (+ 3 i_2)) (< (+ i_2 4) b)), 1497213#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= b (+ 3 i_2)) (< (+ i_2 4) b)), 1497175#(or (<= (+ b a) i_3) (<= (+ 3 i_3) (+ b a))), 1497221#(or (< (+ i_3 1) (+ b a)) (< (+ 5 i_2) b) (<= b (+ i_2 4)) (<= (+ b a) i_3)), 1497207#(<= b (+ i_2 1)), 1497189#(or (<= (+ b a) (+ 2 i_3)) (<= (+ 5 i_3) (+ b a))), 1497205#(or (<= (+ 2 i_3) (+ i_2 a)) (<= (+ b a) (+ 2 i_3))), 1497194#(or (< (+ 3 i_3) (+ b a)) (< (+ 2 i_2) b) (<= (+ b a) (+ 2 i_3)) (<= b (+ i_2 1))), 1497177#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3))), 1497188#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 1497133#(< i_3 (+ b a)), 1497192#(or (<= (+ 3 i_3) (+ i_2 a)) (<= (+ b a) (+ i_3 1))), 1497215#(or (<= i_3 (+ i_2 a)) (<= (+ b a) (+ i_3 1))), 1497174#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 1497178#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 1497182#(or (< (+ 2 i_2) b) (<= b (+ i_2 1)) (< i_3 (+ b a))), 1497183#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b i_2) (< (+ i_2 1) b)), 1497185#(or (<= (+ b a) (+ i_3 1)) (<= b i_2) (< (+ i_2 1) b) (< (+ 2 i_3) (+ b a))), 1497206#(<= b i_2), 1497196#(or (<= (+ 2 i_3) (+ i_2 a)) (<= (+ b a) (+ i_3 1))), 1497179#(or (<= b i_2) (< (+ i_2 1) b)), 1497191#(or (<= (+ 2 i_3) (+ i_2 a)) (<= (+ b a) i_3)), 1497222#(or (< (+ 5 i_2) b) (<= b (+ i_2 4)) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 1497208#(<= b (+ 2 i_2)), 1497187#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ i_3 1))), 1497212#(or (<= (+ b a) (+ i_3 1)) (<= b (+ 3 i_2)) (< (+ i_2 4) b) (< (+ 2 i_3) (+ b a))), 1497218#(or (< (+ 5 i_2) b) (<= b (+ i_2 4))), 1497217#(<= b (+ 3 i_2)), 1497173#(or (< i_2 b) (< i_3 (+ b a))), 1497214#(or (<= i_3 (+ i_2 a 1)) (<= (+ b a) i_3)), 1497198#(or (< (+ 3 i_2) b) (<= b (+ 2 i_2))), 1497200#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (< (+ 3 i_2) b) (<= b (+ 2 i_2))), 1497211#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b (+ 3 i_2)) (< (+ i_2 4) b)), 1497171#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3)), 1497172#(< i_2 b), 1497180#(or (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 1497220#(or (< (+ 5 i_2) b) (<= b (+ i_2 4)) (< i_3 (+ b a))), 1497204#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (< (+ 3 i_2) b) (<= b (+ 2 i_2))), 1497195#(or (<= (+ b a) i_3) (<= (+ i_3 1) (+ i_2 a))), 1497197#(or (<= (+ b a) (+ 2 i_3)) (<= (+ 3 i_3) (+ i_2 a))), 1497184#(or (< (+ 2 i_2) b) (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b (+ i_2 1))), 1497190#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= b i_2) (< (+ i_2 1) b)), 1497193#(or (<= (+ i_3 4) (+ i_2 a)) (<= (+ b a) (+ 2 i_3))), 1497186#(or (< (+ 2 i_2) b) (<= (+ b a) (+ i_3 1)) (<= b (+ i_2 1)) (< (+ 2 i_3) (+ b a))), 1497199#(or (< (+ 3 i_2) b) (< i_3 (+ b a)) (<= b (+ 2 i_2))), 1497201#(or (< (+ 3 i_2) b) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a)) (<= b (+ 2 i_2))), 1497203#(or (<= (+ i_3 1) (+ i_2 a)) (<= (+ b a) (+ i_3 1))), 1497202#(or (<= i_3 (+ i_2 a)) (<= (+ b a) i_3)), 1497223#(or (< (+ 3 i_3) (+ b a)) (< (+ 5 i_2) b) (<= b (+ i_2 4)) (<= (+ b a) (+ 2 i_3))), 1497216#(or (<= (+ b a) (+ 2 i_3)) (<= (+ i_3 1) (+ i_2 a))), 1497219#(<= b (+ i_2 4)), 1497176#(or (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 1497210#(or (<= b (+ 3 i_2)) (< (+ i_2 4) b) (< i_3 (+ b a))), 1497181#(or (< (+ 2 i_2) b) (<= b (+ i_2 1)))] [2022-03-15 20:47:06,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 20:47:06,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:06,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 20:47:06,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=4164, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 20:47:06,232 INFO L87 Difference]: Start difference. First operand 97240 states and 489470 transitions. Second operand has 63 states, 63 states have (on average 3.111111111111111) internal successors, (196), 62 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 20:47:10,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:10,185 INFO L93 Difference]: Finished difference Result 205904 states and 1014310 transitions. [2022-03-15 20:47:10,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 20:47:10,185 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 3.111111111111111) internal successors, (196), 62 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) Word has length 19 [2022-03-15 20:47:10,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:11,765 INFO L225 Difference]: With dead ends: 205904 [2022-03-15 20:47:11,765 INFO L226 Difference]: Without dead ends: 205884 [2022-03-15 20:47:11,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3225 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2464, Invalid=8248, Unknown=0, NotChecked=0, Total=10712 [2022-03-15 20:47:11,766 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 669 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:11,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [669 Valid, 1 Invalid, 1855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:47:11,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205884 states. [2022-03-15 20:47:17,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205884 to 111753. [2022-03-15 20:47:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111753 states, 111752 states have (on average 5.063801990120982) internal successors, (565890), 111752 states have internal predecessors, (565890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111753 states to 111753 states and 565890 transitions. [2022-03-15 20:47:18,474 INFO L78 Accepts]: Start accepts. Automaton has 111753 states and 565890 transitions. Word has length 19 [2022-03-15 20:47:18,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:18,474 INFO L470 AbstractCegarLoop]: Abstraction has 111753 states and 565890 transitions. [2022-03-15 20:47:18,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 3.111111111111111) internal successors, (196), 62 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 20:47:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand 111753 states and 565890 transitions. [2022-03-15 20:47:18,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:47:18,700 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:18,700 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:18,717 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 20:47:18,901 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 20:47:18,901 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:47:18,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:18,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1287959963, now seen corresponding path program 14 times [2022-03-15 20:47:18,902 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:18,902 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802582804] [2022-03-15 20:47:18,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:18,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:18,945 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:18,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802582804] [2022-03-15 20:47:18,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802582804] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:18,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028027800] [2022-03-15 20:47:18,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:47:18,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:18,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:18,946 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 20:47:18,947 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 20:47:18,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:47:18,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:18,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:47:18,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:19,035 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:47:19,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:19,063 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:47:19,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028027800] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:19,063 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:19,064 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 12 [2022-03-15 20:47:19,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2114816665] [2022-03-15 20:47:19,064 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:19,065 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:19,075 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 233 transitions. [2022-03-15 20:47:19,075 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:20,315 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [1926836#(or (< (+ 3 i_3) (+ b a)) (<= (+ a 1) i_1) (<= (+ b a) (+ 2 i_3))), 1926842#(or (<= (+ i_3 1) (+ i_1 b)) (<= (+ b a) i_3)), 1926839#(<= a (+ 3 i_1)), 1926825#(or (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 1926823#(< i_3 (+ b a)), 1926840#(or (<= i_3 (+ 3 i_1 b)) (<= a i_1)), 1926828#(or (< (+ i_3 1) (+ b a)) (<= (+ a 1) i_1) (<= (+ b a) i_3)), 1926826#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3))), 1926834#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= a (+ i_1 1))), 1926838#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= a (+ i_1 1))), 1926841#(or (<= i_3 (+ 2 i_1 b)) (<= a i_1)), 1926835#(or (<= (+ b a) (+ i_3 1)) (<= a (+ i_1 1)) (< (+ 2 i_3) (+ b a))), 1926829#(or (<= (+ a 1) i_1) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 1926830#(or (<= a i_1) (< i_3 (+ b a))), 1926831#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= a i_1)), 1926837#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= a i_1)), 1926833#(or (<= a (+ i_1 1)) (< i_3 (+ b a))), 1926827#(or (<= (+ a 1) i_1) (< i_3 (+ b a))), 1926824#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3)), 1926832#(or (<= a i_1) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a)))] [2022-03-15 20:47:20,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 20:47:20,315 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:20,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 20:47:20,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:47:20,316 INFO L87 Difference]: Start difference. First operand 111753 states and 565890 transitions. Second operand has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:24,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:24,062 INFO L93 Difference]: Finished difference Result 224961 states and 1099213 transitions. [2022-03-15 20:47:24,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-15 20:47:24,063 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 20:47:24,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:25,841 INFO L225 Difference]: With dead ends: 224961 [2022-03-15 20:47:25,841 INFO L226 Difference]: Without dead ends: 224797 [2022-03-15 20:47:25,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1515 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1346, Invalid=4056, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 20:47:25,842 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 408 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:25,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [408 Valid, 1 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:47:26,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224797 states. [2022-03-15 20:47:33,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224797 to 160263. [2022-03-15 20:47:33,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160263 states, 160262 states have (on average 5.059677278456528) internal successors, (810874), 160262 states have internal predecessors, (810874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:35,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160263 states to 160263 states and 810874 transitions. [2022-03-15 20:47:35,391 INFO L78 Accepts]: Start accepts. Automaton has 160263 states and 810874 transitions. Word has length 19 [2022-03-15 20:47:35,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:35,391 INFO L470 AbstractCegarLoop]: Abstraction has 160263 states and 810874 transitions. [2022-03-15 20:47:35,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:35,391 INFO L276 IsEmpty]: Start isEmpty. Operand 160263 states and 810874 transitions. [2022-03-15 20:47:35,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:47:35,898 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:35,898 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:35,915 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 20:47:36,114 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 20:47:36,114 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:47:36,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:36,116 INFO L85 PathProgramCache]: Analyzing trace with hash -2054647072, now seen corresponding path program 15 times [2022-03-15 20:47:36,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:36,117 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295198776] [2022-03-15 20:47:36,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:36,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:36,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:36,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295198776] [2022-03-15 20:47:36,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295198776] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:36,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952302690] [2022-03-15 20:47:36,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:47:36,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:36,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:36,252 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 20:47:36,315 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 20:47:36,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 20:47:36,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:36,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:47:36,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:36,546 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:36,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:36,592 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:36,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952302690] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:36,593 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:36,593 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-03-15 20:47:36,593 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [699004880] [2022-03-15 20:47:36,593 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:36,595 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:36,613 INFO L252 McrAutomatonBuilder]: Finished intersection with 127 states and 273 transitions. [2022-03-15 20:47:36,613 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:38,981 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [2472565#(or (<= (+ 2 i_3) (+ b a)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 2472569#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ 2 i_3) (+ b a))), 2472580#(or (<= a (+ i_1 4)) (<= (+ 3 i_3) (+ b a)) (< (+ 5 i_1) a)), 2472560#(or (< i_1 a) (<= (+ 5 i_3) (+ b a))), 2472553#(or (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 2472582#(or (<= a (+ i_1 4)) (<= (+ i_3 4) (+ b a)) (< (+ 5 i_1) a)), 2472552#(or (< (+ i_1 1) a) (<= a i_1) (< i_3 (+ b a))), 2472557#(or (< i_1 a) (<= (+ 2 i_3) (+ b a))), 2472559#(or (<= (+ i_3 4) (+ b a)) (< i_1 a)), 2472581#(or (< (+ i_1 4) a) (<= (+ i_3 4) (+ b a)) (<= a (+ 3 i_1))), 2472571#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ i_3 4) (+ b a))), 2472583#(or (< (+ i_1 4) a) (<= (+ 5 i_3) (+ b a)) (<= a (+ 3 i_1))), 2472566#(or (<= a (+ i_1 1)) (<= (+ 3 i_3) (+ b a)) (< (+ 2 i_1) a)), 2472555#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1))), 2472562#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ 3 i_3) (+ b a))), 2472556#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (< i_3 (+ b a))), 2472575#(or (< (+ i_1 4) a) (<= (+ 2 i_3) (+ b a)) (<= a (+ 3 i_1))), 2472558#(or (< i_1 a) (<= (+ 3 i_3) (+ b a))), 2472554#(or (<= a (+ i_1 1)) (< i_3 (+ b a)) (< (+ 2 i_1) a)), 2472570#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ 3 i_3) (+ b a))), 2472563#(or (< (+ i_1 1) a) (<= (+ i_3 4) (+ b a)) (<= a i_1)), 2472568#(or (<= (+ 5 i_3) (+ b a)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 2472585#(or (<= (+ 2 i_3) (+ b a)) (<= (+ b a) i_3)), 2472561#(or (< (+ i_1 1) a) (<= (+ 2 i_3) (+ b a)) (<= a i_1)), 2472578#(or (<= a (+ i_1 4)) (< i_3 (+ b a)) (< (+ 5 i_1) a)), 2472572#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ 5 i_3) (+ b a))), 2472574#(or (< (+ i_1 4) a) (<= a (+ 3 i_1)) (< i_3 (+ b a))), 2472588#(or (<= (+ b a) (+ 3 i_3)) (<= (+ 5 i_3) (+ b a))), 2472567#(or (<= (+ i_3 4) (+ b a)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 2472564#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ 5 i_3) (+ b a))), 2472584#(or (<= a (+ i_1 4)) (<= (+ 5 i_3) (+ b a)) (< (+ 5 i_1) a)), 2472577#(or (<= a (+ i_1 4)) (< (+ 5 i_1) a)), 2472551#(or (< i_1 a) (< i_3 (+ b a))), 2472576#(or (< (+ i_1 4) a) (<= (+ 3 i_3) (+ b a)) (<= a (+ 3 i_1))), 2472550#(or (< (+ i_1 1) a) (<= a i_1)), 2472587#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3))), 2472573#(or (< (+ i_1 4) a) (<= a (+ 3 i_1))), 2472549#(< i_1 a), 2472579#(or (<= a (+ i_1 4)) (<= (+ 2 i_3) (+ b a)) (< (+ 5 i_1) a)), 2472586#(or (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a)))] [2022-03-15 20:47:38,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-03-15 20:47:38,981 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:38,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-03-15 20:47:38,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=3196, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 20:47:38,982 INFO L87 Difference]: Start difference. First operand 160263 states and 810874 transitions. Second operand has 52 states, 52 states have (on average 3.019230769230769) internal successors, (157), 51 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:46,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:46,837 INFO L93 Difference]: Finished difference Result 408247 states and 2034123 transitions. [2022-03-15 20:47:46,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-03-15 20:47:46,837 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.019230769230769) internal successors, (157), 51 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 20:47:46,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:50,483 INFO L225 Difference]: With dead ends: 408247 [2022-03-15 20:47:50,484 INFO L226 Difference]: Without dead ends: 408152 [2022-03-15 20:47:50,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 89 SyntacticMatches, 5 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6043 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3192, Invalid=13320, Unknown=0, NotChecked=0, Total=16512 [2022-03-15 20:47:50,485 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 652 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 1875 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 1875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:50,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [652 Valid, 1 Invalid, 2245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 1875 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:47:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408152 states. [2022-03-15 20:48:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408152 to 221912. [2022-03-15 20:48:03,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221912 states, 221911 states have (on average 5.08648962872503) internal successors, (1128748), 221911 states have internal predecessors, (1128748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:05,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221912 states to 221912 states and 1128748 transitions. [2022-03-15 20:48:05,467 INFO L78 Accepts]: Start accepts. Automaton has 221912 states and 1128748 transitions. Word has length 20 [2022-03-15 20:48:05,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:48:05,467 INFO L470 AbstractCegarLoop]: Abstraction has 221912 states and 1128748 transitions. [2022-03-15 20:48:05,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.019230769230769) internal successors, (157), 51 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:05,467 INFO L276 IsEmpty]: Start isEmpty. Operand 221912 states and 1128748 transitions. [2022-03-15 20:48:06,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:48:06,129 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:48:06,129 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:48:06,153 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 20:48:06,344 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 20:48:06,344 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:48:06,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:48:06,345 INFO L85 PathProgramCache]: Analyzing trace with hash 561514673, now seen corresponding path program 11 times [2022-03-15 20:48:06,346 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:48:06,346 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473525679] [2022-03-15 20:48:06,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:48:06,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:48:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:48:06,449 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:06,449 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:48:06,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473525679] [2022-03-15 20:48:06,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473525679] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:48:06,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438561555] [2022-03-15 20:48:06,450 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:48:06,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:48:06,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:48:06,451 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 20:48:06,453 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 20:48:06,481 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 20:48:06,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:48:06,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 20:48:06,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:48:06,758 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:06,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:48:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:06,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438561555] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:48:06,848 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:48:06,848 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2022-03-15 20:48:06,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [963026688] [2022-03-15 20:48:06,848 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:48:06,849 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:48:06,867 INFO L252 McrAutomatonBuilder]: Finished intersection with 160 states and 368 transitions. [2022-03-15 20:48:06,867 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:48:12,895 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 119 new interpolants: [3324951#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 3325014#(or (< (+ i_1 4) a) (<= b i_2) (< (+ i_2 1) b) (<= a (+ 3 i_1))), 3324965#(or (< i_1 a) (<= (+ 5 i_3) (+ b a))), 3325011#(or (< (+ i_1 1) a) (<= (+ 2 i_3) (+ b a)) (<= a i_1) (<= b i_2) (< (+ i_2 1) b)), 3325040#(or (<= b i_2) (<= (+ 5 i_3) (+ b a)) (<= a (+ i_1 1)) (< (+ i_2 1) b) (< (+ 2 i_1) a)), 3325010#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 3325007#(or (<= b i_2) (<= a (+ i_1 1)) (< (+ i_2 1) b) (< (+ 2 i_1) a)), 3324992#(or (< i_1 a) (<= b i_2) (<= (+ 3 i_3) (+ b a)) (< (+ i_2 1) b)), 3325051#(and (or (< (+ i_1 4) a) (<= (+ x_2 4) (+ i_2 a)) (<= a (+ 3 i_1))) (or (< (+ i_1 4) a) (= (+ (* (- 1) i_3) x_2) 0) (<= a (+ 3 i_1)))), 3324998#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ 2 i_3) (+ b a)) (< i_2 b)), 3324980#(or (< i_2 b) (<= a (+ i_1 1)) (<= (+ 3 i_3) (+ b a)) (< (+ 2 i_1) a)), 3325026#(or (< i_1 a) (<= b i_2) (<= (+ 5 i_3) (+ b a)) (< (+ i_2 1) b)), 3325050#(or (< (+ i_1 4) a) (<= b i_2) (<= (+ 5 i_3) (+ b a)) (< (+ i_2 1) b) (<= a (+ 3 i_1))), 3324961#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1) (< i_3 (+ b a))), 3324933#(< i_1 a), 3324956#(or (< i_1 a) (< i_2 b) (< i_3 (+ b a))), 3325013#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ 2 i_3) (+ b a)) (<= b i_2) (< (+ i_2 1) b)), 3325019#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3)) (<= b i_2) (< (+ i_2 1) b)), 3325034#(or (< (+ i_1 4) a) (<= (+ 5 i_3) (+ b a)) (<= a (+ 3 i_1))), 3324983#(or (<= b i_2) (< (+ i_2 1) b)), 3324969#(or (< i_1 a) (< i_2 b) (<= (+ 5 i_3) (+ b a))), 3324957#(or (< i_1 a) (<= (+ 2 i_3) (+ b a)) (< i_2 b)), 3324997#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (< i_2 b) (< i_3 (+ b a))), 3324970#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1) (<= (+ 5 i_3) (+ b a))), 3324967#(or (<= (+ b a) (+ 3 i_3)) (< i_2 b) (<= (+ 5 i_3) (+ b a))), 3325024#(or (<= (+ b a) (+ 3 i_3)) (<= b i_2) (<= (+ 5 i_3) (+ b a)) (< (+ i_2 1) b)), 3324958#(or (< i_1 a) (< i_2 b) (<= (+ 3 i_3) (+ b a))), 3324984#(or (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 3325018#(or (<= b i_2) (<= a (+ i_1 1)) (<= (+ 3 i_3) (+ b a)) (< (+ i_2 1) b) (< (+ 2 i_1) a)), 3325049#(or (< (+ i_1 4) a) (<= (+ i_3 4) (+ b a)) (<= b i_2) (< (+ i_2 1) b) (<= a (+ 3 i_1))), 3324972#(or (<= a (+ i_1 1)) (< i_3 (+ b a)) (< (+ 2 i_1) a)), 3325022#(or (< (+ i_1 1) a) (<= (+ i_3 4) (+ b a)) (<= a i_1) (<= b i_2) (< (+ i_2 1) b)), 3324943#(or (< (+ i_1 1) a) (<= (+ 2 i_3) (+ b a)) (<= a i_1)), 3325005#(or (< (+ i_1 1) a) (<= a i_1) (<= b i_2) (< (+ i_2 1) b)), 3325039#(or (< (+ i_1 1) a) (<= a i_1) (<= b i_2) (<= (+ 5 i_3) (+ b a)) (< (+ i_2 1) b)), 3325030#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ i_3 4) (+ b a))), 3324955#(or (< i_1 a) (< i_2 b)), 3325004#(or (< (+ i_1 4) a) (<= (+ 2 i_3) (+ b a)) (< i_2 b) (<= a (+ 3 i_1))), 3325002#(or (< (+ i_1 4) a) (< i_2 b) (<= a (+ 3 i_1)) (< i_3 (+ b a))), 3324950#(or (<= (+ 2 i_3) (+ b a)) (< i_2 b)), 3324946#(or (< (+ i_1 1) a) (<= (+ i_3 4) (+ b a)) (<= a i_1)), 3325041#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= b i_2) (<= (+ 5 i_3) (+ b a)) (< (+ i_2 1) b)), 3324994#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (< i_3 (+ b a))), 3325001#(or (< (+ i_1 4) a) (<= a (+ 3 i_1)) (< i_3 (+ b a))), 3325000#(or (< (+ i_1 4) a) (< i_2 b) (<= a (+ 3 i_1))), 3324939#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3))), 3325048#(or (< (+ i_1 4) a) (<= b i_2) (<= (+ 3 i_3) (+ b a)) (< (+ i_2 1) b) (<= a (+ 3 i_1))), 3324971#(or (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 3325047#(or (< (+ i_1 4) a) (< i_2 b) (<= (+ 5 i_3) (+ b a)) (<= a (+ 3 i_1))), 3324991#(or (<= b i_2) (<= (+ 3 i_3) (+ b a)) (< (+ i_2 1) b)), 3325020#(or (<= (+ i_3 4) (+ b a)) (<= b i_2) (< (+ i_2 1) b)), 3324938#(or (<= (+ b a) (+ i_3 1)) (<= (+ 3 i_3) (+ b a))), 3324959#(or (<= (+ i_3 4) (+ b a)) (< i_1 a) (< i_2 b)), 3325038#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ i_3 4) (+ b a)) (<= b i_2) (< (+ i_2 1) b)), 3325008#(or (<= b i_2) (<= a (+ i_1 1)) (< (+ i_2 1) b) (< i_3 (+ b a)) (< (+ 2 i_1) a)), 3325031#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ 5 i_3) (+ b a))), 3324947#(< i_2 b), 3324986#(or (<= (+ 2 i_3) (+ b a)) (<= b i_2) (< (+ i_2 1) b)), 3324935#(or (< (+ i_1 1) a) (<= a i_1)), 3324940#(or (<= (+ b a) (+ 3 i_3)) (<= (+ 5 i_3) (+ b a))), 3325036#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (< i_2 b) (<= (+ 5 i_3) (+ b a))), 3324941#(or (< i_1 a) (<= (+ 2 i_3) (+ b a))), 3324985#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3) (<= b i_2) (< (+ i_2 1) b)), 3325045#(or (< (+ i_1 4) a) (< i_2 b) (<= (+ 3 i_3) (+ b a)) (<= a (+ 3 i_1))), 3324934#(or (< i_1 a) (< i_3 (+ b a))), 3325028#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ 3 i_3) (+ b a))), 3325023#(or (<= (+ i_3 4) (+ b a)) (<= b i_2) (<= a (+ i_1 1)) (< (+ i_2 1) b) (< (+ 2 i_1) a)), 3324995#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ 2 i_3) (+ b a))), 3325037#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= b i_2) (<= (+ 3 i_3) (+ b a)) (< (+ i_2 1) b)), 3325021#(or (<= (+ i_3 4) (+ b a)) (< i_1 a) (<= b i_2) (< (+ i_2 1) b)), 3324989#(or (< i_1 a) (<= (+ 2 i_3) (+ b a)) (<= b i_2) (< (+ i_2 1) b)), 3325025#(or (<= b i_2) (<= (+ 5 i_3) (+ b a)) (< (+ i_2 1) b)), 3325017#(or (< (+ i_1 1) a) (<= a i_1) (<= b i_2) (<= (+ 3 i_3) (+ b a)) (< (+ i_2 1) b)), 3324953#(or (<= (+ i_3 4) (+ b a)) (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 3324979#(or (<= (+ 2 i_3) (+ b a)) (< i_2 b) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 3324948#(or (< i_2 b) (< i_3 (+ b a))), 3324999#(or (< (+ i_1 4) a) (<= a (+ 3 i_1))), 3325046#(or (< (+ i_1 4) a) (<= (+ i_3 4) (+ b a)) (< i_2 b) (<= a (+ 3 i_1))), 3324966#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ 5 i_3) (+ b a))), 3324990#(or (<= (+ b a) (+ i_3 1)) (<= b i_2) (<= (+ 3 i_3) (+ b a)) (< (+ i_2 1) b)), 3325042#(and (or (< (+ i_1 1) a) (<= (+ x_2 4) (+ i_2 a)) (<= a i_1)) (or (< (+ i_1 1) a) (= (+ (* (- 1) i_3) x_2) 0) (<= a i_1))), 3325012#(or (<= (+ 2 i_3) (+ b a)) (<= b i_2) (<= a (+ i_1 1)) (< (+ i_2 1) b) (< (+ 2 i_1) a)), 3324977#(or (< i_2 b) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 3325003#(or (< (+ i_1 4) a) (<= (+ 2 i_3) (+ b a)) (<= a (+ 3 i_1))), 3325015#(or (< (+ i_1 4) a) (<= b i_2) (< (+ i_2 1) b) (<= a (+ 3 i_1)) (< i_3 (+ b a))), 3324960#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1)), 3324974#(or (<= a (+ i_1 1)) (<= (+ 3 i_3) (+ b a)) (< (+ 2 i_1) a)), 3324987#(or (< i_1 a) (<= b i_2) (< (+ i_2 1) b)), 3325035#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ i_3 4) (+ b a)) (< i_2 b)), 3324942#(or (< i_1 a) (<= (+ 3 i_3) (+ b a))), 3324978#(or (< i_2 b) (<= a (+ i_1 1)) (< i_3 (+ b a)) (< (+ 2 i_1) a)), 3325029#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (< i_2 b) (<= (+ 3 i_3) (+ b a))), 3324982#(or (< i_2 b) (<= (+ 5 i_3) (+ b a)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 3325033#(or (< (+ i_1 4) a) (<= (+ i_3 4) (+ b a)) (<= a (+ 3 i_1))), 3324962#(or (< (+ i_1 1) a) (<= (+ 2 i_3) (+ b a)) (< i_2 b) (<= a i_1)), 3325009#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= b i_2) (< (+ i_2 1) b)), 3324976#(or (<= (+ 5 i_3) (+ b a)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 3324936#(or (< (+ i_1 1) a) (<= a i_1) (< i_3 (+ b a))), 3324964#(or (< (+ i_1 1) a) (<= (+ i_3 4) (+ b a)) (< i_2 b) (<= a i_1)), 3325032#(or (< (+ i_1 4) a) (<= (+ 3 i_3) (+ b a)) (<= a (+ 3 i_1))), 3324937#(or (<= (+ 2 i_3) (+ b a)) (<= (+ b a) i_3)), 3324988#(or (< i_1 a) (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 3324963#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1) (<= (+ 3 i_3) (+ b a))), 3325006#(or (< (+ i_1 1) a) (<= a i_1) (<= b i_2) (< (+ i_2 1) b) (< i_3 (+ b a))), 3324952#(or (< i_2 b) (<= (+ 3 i_3) (+ b a))), 3324993#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1))), 3324968#(or (< i_2 b) (<= (+ 5 i_3) (+ b a))), 3324954#(or (<= (+ i_3 4) (+ b a)) (< i_2 b)), 3325044#(and (or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (= (+ (* (- 1) i_3) x_2) 0)) (or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ x_2 4) (+ i_2 a)))), 3325016#(or (< (+ i_1 4) a) (<= (+ 2 i_3) (+ b a)) (<= b i_2) (< (+ i_2 1) b) (<= a (+ 3 i_1))), 3324949#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 3324973#(or (<= (+ 2 i_3) (+ b a)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 3324996#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (< i_2 b)), 3324975#(or (<= (+ i_3 4) (+ b a)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 3325043#(and (or (<= (+ x_2 4) (+ i_2 a)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)) (or (= (+ (* (- 1) i_3) x_2) 0) (<= a (+ i_1 1)) (< (+ 2 i_1) a))), 3324944#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ 3 i_3) (+ b a))), 3324945#(or (<= (+ i_3 4) (+ b a)) (< i_1 a)), 3325027#(and (or (< i_1 a) (= (+ (* (- 1) i_3) x_2) 0)) (or (<= (+ x_2 4) (+ i_2 a)) (< i_1 a))), 3324981#(or (<= (+ i_3 4) (+ b a)) (< i_2 b) (<= a (+ i_1 1)) (< (+ 2 i_1) a))] [2022-03-15 20:48:12,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-03-15 20:48:12,896 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:48:12,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-03-15 20:48:12,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1999, Invalid=19171, Unknown=0, NotChecked=0, Total=21170 [2022-03-15 20:48:12,898 INFO L87 Difference]: Start difference. First operand 221912 states and 1128748 transitions. Second operand has 131 states, 131 states have (on average 2.6412213740458017) internal successors, (346), 130 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:01,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:49:01,449 INFO L93 Difference]: Finished difference Result 266414 states and 1320674 transitions. [2022-03-15 20:49:01,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 747 states. [2022-03-15 20:49:01,449 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 131 states have (on average 2.6412213740458017) internal successors, (346), 130 states have internal predecessors, (346), 0 states have call successors, (0), 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 20:49:01,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:49:03,371 INFO L225 Difference]: With dead ends: 266414 [2022-03-15 20:49:03,371 INFO L226 Difference]: Without dead ends: 266320 [2022-03-15 20:49:03,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 893 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 849 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331003 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=111621, Invalid=611729, Unknown=0, NotChecked=0, Total=723350 [2022-03-15 20:49:03,399 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 4652 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 7385 mSolverCounterSat, 4872 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4652 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 12257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4872 IncrementalHoareTripleChecker+Valid, 7385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:49:03,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4652 Valid, 1 Invalid, 12257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4872 Valid, 7385 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-03-15 20:49:03,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266320 states. [2022-03-15 20:49:10,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266320 to 222754. [2022-03-15 20:49:11,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222754 states, 222753 states have (on average 5.079756501595938) internal successors, (1131531), 222753 states have internal predecessors, (1131531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222754 states to 222754 states and 1131531 transitions. [2022-03-15 20:49:13,342 INFO L78 Accepts]: Start accepts. Automaton has 222754 states and 1131531 transitions. Word has length 20 [2022-03-15 20:49:13,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:49:13,343 INFO L470 AbstractCegarLoop]: Abstraction has 222754 states and 1131531 transitions. [2022-03-15 20:49:13,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 2.6412213740458017) internal successors, (346), 130 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 222754 states and 1131531 transitions. [2022-03-15 20:49:13,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:49:13,998 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:49:13,999 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:49:14,018 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 20:49:14,199 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 20:49:14,199 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:49:14,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:49:14,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1175973220, now seen corresponding path program 16 times [2022-03-15 20:49:14,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:49:14,200 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897260230] [2022-03-15 20:49:14,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:49:14,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:49:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:49:14,268 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:14,268 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:49:14,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897260230] [2022-03-15 20:49:14,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897260230] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:49:14,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671489435] [2022-03-15 20:49:14,269 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:49:14,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:49:14,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:49:14,270 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 20:49:14,271 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 20:49:14,295 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:49:14,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:49:14,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 20:49:14,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:49:14,525 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:14,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:49:14,573 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:14,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671489435] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:49:14,574 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:49:14,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2022-03-15 20:49:14,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [602943860] [2022-03-15 20:49:14,574 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:49:14,575 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:49:14,589 INFO L252 McrAutomatonBuilder]: Finished intersection with 127 states and 273 transitions. [2022-03-15 20:49:14,590 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:49:17,995 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 83 new interpolants: [4038527#(or (< (+ i_3 1) (+ b a)) (<= (+ b a) i_3)), 4038579#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (< i_2 b)), 4038538#(or (< (+ i_3 4) (+ b a)) (<= (+ b a) (+ 3 i_3)) (< i_2 b)), 4038564#(or (< i_2 b) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 4038591#(or (< (+ i_1 4) a) (< i_2 b) (<= a (+ 3 i_1))), 4038523#(< i_1 a), 4038532#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3))), 4038574#(or (<= (+ b a) (+ i_3 4)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 4038547#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ b a) i_3)), 4038526#(< i_3 (+ b a)), 4038531#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 4038562#(or (< (+ i_1 1) a) (< i_2 b) (<= (+ b a) i_3) (<= a i_1)), 4038602#(or (< (+ i_1 1) a) (<= (+ i_2 a) (+ i_3 4)) (<= a i_1)), 4038560#(or (<= (+ b a) (+ 3 i_3)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 4038605#(or (< (+ i_1 4) a) (<= (+ i_2 a) (+ i_3 4)) (<= a (+ 3 i_1))), 4038536#(or (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 4038534#(or (< i_2 b) (<= (+ b a) i_3)), 4038528#(or (< i_2 b) (< i_3 (+ b a))), 4038585#(or (<= (+ b a) (+ i_3 4)) (< i_2 b) (< (+ 5 i_3) (+ b a))), 4038555#(or (< (+ i_1 1) a) (<= (+ b a) (+ 2 i_3)) (<= a i_1)), 4038589#(or (<= (+ b a) (+ i_3 4)) (< i_2 b) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 4038577#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ b a) (+ 3 i_3))), 4038571#(or (<= (+ b a) (+ 3 i_3)) (< i_2 b) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 4038525#(or (< i_1 a) (< i_2 b)), 4038540#(or (< (+ i_1 1) a) (<= a i_1)), 4038590#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ b a) (+ i_3 4)) (< i_2 b)), 4038570#(or (< (+ i_1 1) a) (<= (+ b a) (+ 3 i_3)) (< i_2 b) (<= a i_1)), 4038583#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ b a) (+ 3 i_3)) (< i_2 b)), 4038596#(or (< (+ i_1 4) a) (<= (+ b a) (+ 2 i_3)) (< i_2 b) (<= a (+ 3 i_1))), 4038603#(or (<= (+ i_2 a) (+ i_3 4)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 4038541#(or (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 4038539#(or (<= (+ b a) (+ 3 i_3)) (< i_2 b)), 4038573#(or (< (+ i_1 1) a) (<= (+ b a) (+ i_3 4)) (<= a i_1)), 4038592#(or (< (+ i_1 4) a) (< i_2 b) (<= (+ b a) i_3) (<= a (+ 3 i_1))), 4038581#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (< i_2 b) (<= (+ b a) (+ i_3 1))), 4038601#(or (<= (+ i_2 a) (+ i_3 4)) (< i_1 a)), 4038548#(or (< (+ i_1 4) a) (<= (+ b a) i_3) (<= a (+ 3 i_1))), 4038543#(or (< (+ i_1 4) a) (<= a (+ 3 i_1))), 4038569#(or (< i_1 a) (<= (+ b a) (+ 3 i_3)) (< i_2 b)), 4038587#(or (<= (+ b a) (+ i_3 4)) (< i_1 a) (< i_2 b)), 4038551#(or (< i_1 a) (< i_2 b) (<= (+ b a) (+ i_3 1))), 4038597#(or (< (+ i_1 4) a) (<= (+ b a) (+ 3 i_3)) (<= a (+ 3 i_1))), 4038550#(or (< i_1 a) (< i_2 b) (<= (+ b a) i_3)), 4038546#(or (<= (+ b a) i_3) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 4038565#(or (< i_2 b) (<= (+ b a) i_3) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 4038567#(or (< (+ i_1 1) a) (<= (+ b a) (+ 2 i_3)) (< i_2 b) (<= a i_1)), 4038584#(or (<= (+ b a) (+ i_3 4)) (< (+ 5 i_3) (+ b a))), 4038578#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ b a) (+ i_3 4))), 4038575#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ b a) (+ i_3 1))), 4038582#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 4038598#(or (< (+ i_1 4) a) (<= (+ b a) (+ 3 i_3)) (< i_2 b) (<= a (+ 3 i_1))), 4038537#(or (< (+ i_3 4) (+ b a)) (<= (+ b a) (+ 3 i_3))), 4038545#(or (< (+ i_1 1) a) (<= (+ b a) i_3) (<= a i_1)), 4038593#(or (< (+ i_1 4) a) (<= (+ b a) (+ i_3 1)) (<= a (+ 3 i_1))), 4038599#(or (< (+ i_1 4) a) (<= (+ b a) (+ i_3 4)) (<= a (+ 3 i_1))), 4038586#(or (<= (+ b a) (+ i_3 4)) (< i_2 b)), 4038544#(or (< i_1 a) (<= (+ b a) i_3)), 4038563#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1) (<= (+ b a) (+ i_3 1))), 4038604#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ i_2 a) (+ i_3 4))), 4038576#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (<= (+ b a) (+ 2 i_3))), 4038588#(or (< (+ i_1 1) a) (<= (+ b a) (+ i_3 4)) (< i_2 b) (<= a i_1)), 4038549#(or (< i_1 a) (<= (+ b a) (+ i_3 1))), 4038533#(or (< (+ 3 i_3) (+ b a)) (<= (+ b a) (+ 2 i_3)) (< i_2 b)), 4038529#(or (< (+ i_3 1) (+ b a)) (< i_2 b) (<= (+ b a) i_3)), 4038572#(or (<= (+ b a) (+ i_3 4)) (< i_1 a)), 4038556#(or (< i_1 a) (<= (+ b a) (+ 3 i_3))), 4038594#(or (< (+ i_1 4) a) (< i_2 b) (<= (+ b a) (+ i_3 1)) (<= a (+ 3 i_1))), 4038557#(or (< (+ i_1 1) a) (<= (+ b a) (+ 3 i_3)) (<= a i_1)), 4038595#(or (< (+ i_1 4) a) (<= (+ b a) (+ 2 i_3)) (<= a (+ 3 i_1))), 4038558#(or (<= (+ b a) (+ i_3 1)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 4038530#(or (<= (+ b a) (+ i_3 1)) (< (+ 2 i_3) (+ b a))), 4038542#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1))), 4038566#(or (< i_2 b) (<= (+ b a) (+ i_3 1)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 4038535#(or (< i_2 b) (<= (+ b a) (+ i_3 1))), 4038559#(or (<= (+ b a) (+ 2 i_3)) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 4038580#(or (< (+ 3 i_1) a) (<= a (+ 2 i_1)) (< i_2 b) (<= (+ b a) i_3)), 4038568#(or (<= (+ b a) (+ 2 i_3)) (< i_2 b) (<= a (+ i_1 1)) (< (+ 2 i_1) a)), 4038524#(< i_2 b), 4038554#(or (< (+ i_1 1) a) (<= a i_1) (<= (+ b a) (+ i_3 1))), 4038552#(or (< i_1 a) (<= (+ b a) (+ 2 i_3))), 4038600#(or (< (+ i_1 4) a) (<= (+ b a) (+ i_3 4)) (< i_2 b) (<= a (+ 3 i_1))), 4038561#(or (< (+ i_1 1) a) (< i_2 b) (<= a i_1)), 4038553#(or (< i_1 a) (<= (+ b a) (+ 2 i_3)) (< i_2 b))] [2022-03-15 20:49:17,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-03-15 20:49:17,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:49:17,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-03-15 20:49:17,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1235, Invalid=10321, Unknown=0, NotChecked=0, Total=11556 [2022-03-15 20:49:17,997 INFO L87 Difference]: Start difference. First operand 222754 states and 1131531 transitions. Second operand has 96 states, 96 states have (on average 2.5520833333333335) internal successors, (245), 95 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)