/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/bench/exp2x3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:53:37,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:53:37,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:53:37,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:53:37,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:53:37,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:53:37,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:53:37,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:53:37,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:53:37,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:53:37,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:53:37,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:53:37,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:53:37,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:53:37,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:53:37,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:53:37,269 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:53:37,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:53:37,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:53:37,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:53:37,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:53:37,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:53:37,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:53:37,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:53:37,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:53:37,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:53:37,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:53:37,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:53:37,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:53:37,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:53:37,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:53:37,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:53:37,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:53:37,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:53:37,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:53:37,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:53:37,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:53:37,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:53:37,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:53:37,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:53:37,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:53:37,303 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:53:37,334 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:53:37,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:53:37,336 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:53:37,336 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:53:37,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:53:37,337 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:53:37,337 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:53:37,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:53:37,337 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:53:37,337 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:53:37,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:53:37,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:53:37,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:53:37,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:53:37,338 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:53:37,338 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:53:37,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:53:37,339 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:53:37,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:53:37,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:53:37,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:53:37,339 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:53:37,339 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:53:37,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:53:37,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:53:37,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:53:37,340 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:53:37,341 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:53:37,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:53:37,341 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:53:37,341 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:53:37,342 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:53:37,342 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:53:37,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:53:37,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:53:37,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:53:37,585 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 20:53:37,587 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 20:53:37,587 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp2x3.wvr.bpl [2022-03-15 20:53:37,588 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp2x3.wvr.bpl' [2022-03-15 20:53:37,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:53:37,609 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 20:53:37,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:53:37,611 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:53:37,611 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:53:37,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:53:37" (1/1) ... [2022-03-15 20:53:37,624 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:53:37" (1/1) ... [2022-03-15 20:53:37,628 INFO L137 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 20:53:37,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:53:37,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:53:37,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:53:37,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:53:37,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:53:37" (1/1) ... [2022-03-15 20:53:37,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:53:37" (1/1) ... [2022-03-15 20:53:37,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:53:37" (1/1) ... [2022-03-15 20:53:37,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:53:37" (1/1) ... [2022-03-15 20:53:37,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:53:37" (1/1) ... [2022-03-15 20:53:37,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:53:37" (1/1) ... [2022-03-15 20:53:37,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:53:37" (1/1) ... [2022-03-15 20:53:37,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:53:37,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:53:37,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:53:37,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:53:37,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:53:37" (1/1) ... [2022-03-15 20:53:37,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:53:37,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:53:37,670 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:53:37,692 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:53:37,709 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 20:53:37,710 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 20:53:37,710 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 20:53:37,710 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 20:53:37,710 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 20:53:37,710 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 20:53:37,710 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 20:53:37,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:53:37,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:53:37,710 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 20:53:37,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 20:53:37,711 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 20:53:37,711 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2022-03-15 20:53:37,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 20:53:37,712 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 20:53:37,712 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:53:37,757 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:53:37,759 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:53:37,869 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:53:37,875 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:53:37,875 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 20:53:37,877 INFO L202 PluginConnector]: Adding new model exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:53:37 BoogieIcfgContainer [2022-03-15 20:53:37,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:53:37,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:53:37,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:53:37,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:53:37,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:53:37" (1/2) ... [2022-03-15 20:53:37,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef6d886 and model type exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:53:37, skipping insertion in model container [2022-03-15 20:53:37,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:53:37" (2/2) ... [2022-03-15 20:53:37,891 INFO L111 eAbstractionObserver]: Analyzing ICFG exp2x3.wvr.bpl [2022-03-15 20:53:37,896 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:53:37,896 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:53:37,896 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 20:53:37,896 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:53:37,969 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-15 20:53:38,034 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:53:38,044 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:53:38,044 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 20:53:38,057 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:53:38,066 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 33 transitions, 98 flow [2022-03-15 20:53:38,069 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 33 transitions, 98 flow [2022-03-15 20:53:38,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 98 flow [2022-03-15 20:53:38,111 INFO L129 PetriNetUnfolder]: 4/29 cut-off events. [2022-03-15 20:53:38,112 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-03-15 20:53:38,116 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 29 events. 4/29 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2022-03-15 20:53:38,118 INFO L116 LiptonReduction]: Number of co-enabled transitions 288 [2022-03-15 20:53:38,304 INFO L131 LiptonReduction]: Checked pairs total: 222 [2022-03-15 20:53:38,305 INFO L133 LiptonReduction]: Total number of compositions: 11 [2022-03-15 20:53:38,312 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 23 transitions, 78 flow [2022-03-15 20:53:38,344 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 48 states, 47 states have (on average 3.4893617021276597) internal successors, (164), 47 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:53:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 47 states have (on average 3.4893617021276597) internal successors, (164), 47 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:53:38,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:53:38,357 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:53:38,357 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:53:38,358 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:53:38,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:53:38,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1942767702, now seen corresponding path program 1 times [2022-03-15 20:53:38,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:53:38,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301108323] [2022-03-15 20:53:38,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:53:38,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:53:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:53:38,512 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:53:38,513 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:53:38,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301108323] [2022-03-15 20:53:38,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301108323] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:53:38,513 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:53:38,514 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 20:53:38,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [647634303] [2022-03-15 20:53:38,515 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:53:38,519 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:53:38,583 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 98 transitions. [2022-03-15 20:53:38,584 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:53:39,411 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:53:39,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:53:39,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:53:39,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:53:39,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:53:39,435 INFO L87 Difference]: Start difference. First operand has 48 states, 47 states have (on average 3.4893617021276597) internal successors, (164), 47 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) Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:53:39,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:53:39,479 INFO L93 Difference]: Finished difference Result 93 states and 325 transitions. [2022-03-15 20:53:39,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:53:39,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:53:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:53:39,487 INFO L225 Difference]: With dead ends: 93 [2022-03-15 20:53:39,487 INFO L226 Difference]: Without dead ends: 88 [2022-03-15 20:53:39,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:53:39,491 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:53:39,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:53:39,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-03-15 20:53:39,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-03-15 20:53:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 3.574712643678161) internal successors, (311), 87 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have 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:53:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 311 transitions. [2022-03-15 20:53:39,522 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 311 transitions. Word has length 14 [2022-03-15 20:53:39,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:53:39,523 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 311 transitions. [2022-03-15 20:53:39,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:53:39,523 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 311 transitions. [2022-03-15 20:53:39,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:53:39,524 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:53:39,525 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:53:39,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:53:39,525 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:53:39,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:53:39,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1220607461, now seen corresponding path program 1 times [2022-03-15 20:53:39,526 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:53:39,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308051927] [2022-03-15 20:53:39,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:53:39,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:53:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:53:39,563 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:53:39,563 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:53:39,563 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308051927] [2022-03-15 20:53:39,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308051927] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:53:39,564 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:53:39,564 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:53:39,564 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [226470916] [2022-03-15 20:53:39,564 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:53:39,566 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:53:39,575 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 147 transitions. [2022-03-15 20:53:39,575 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:53:40,261 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [417#(< x2 n), 418#(or (< (* 2 x2) n) (not (< x2 n))), 420#(or (< x1 n) (< x2 n)), 421#(or (< (* 2 x2) n) (< x1 n) (not (< x2 n))), 419#(< x1 n), 422#(or (< x1 n) (= x2 x1))] [2022-03-15 20:53:40,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:53:40,262 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:53:40,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:53:40,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:53:40,263 INFO L87 Difference]: Start difference. First operand 88 states and 311 transitions. Second operand has 10 states, 10 states have (on average 4.8) 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:53:40,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:53:40,460 INFO L93 Difference]: Finished difference Result 160 states and 547 transitions. [2022-03-15 20:53:40,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 20:53:40,460 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) 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 15 [2022-03-15 20:53:40,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:53:40,462 INFO L225 Difference]: With dead ends: 160 [2022-03-15 20:53:40,462 INFO L226 Difference]: Without dead ends: 157 [2022-03-15 20:53:40,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:53:40,464 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 67 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:53:40,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 1 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:53:40,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-03-15 20:53:40,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 139. [2022-03-15 20:53:40,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 3.5942028985507246) internal successors, (496), 138 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have 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:53:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 496 transitions. [2022-03-15 20:53:40,479 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 496 transitions. Word has length 15 [2022-03-15 20:53:40,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:53:40,479 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 496 transitions. [2022-03-15 20:53:40,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) 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:53:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 496 transitions. [2022-03-15 20:53:40,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:53:40,481 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:53:40,481 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:53:40,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 20:53:40,482 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:53:40,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:53:40,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1383680987, now seen corresponding path program 1 times [2022-03-15 20:53:40,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:53:40,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944440305] [2022-03-15 20:53:40,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:53:40,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:53:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:53:40,514 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:53:40,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:53:40,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944440305] [2022-03-15 20:53:40,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944440305] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:53:40,515 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:53:40,515 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:53:40,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1255420466] [2022-03-15 20:53:40,515 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:53:40,517 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:53:40,523 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 147 transitions. [2022-03-15 20:53:40,523 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:53:41,103 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [867#(< x3 n), 869#(or (< (* 2 x3) n) (not (< x3 n))), 872#(or (<= (+ x4 1) n) (<= n x3)), 868#(or (<= (+ x4 1) n) (< x3 n)), 871#(or (<= (+ x4 1) n) (< (* 2 x3) n) (not (< x3 n))), 870#(<= n x3)] [2022-03-15 20:53:41,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:53:41,105 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:53:41,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:53:41,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:53:41,107 INFO L87 Difference]: Start difference. First operand 139 states and 496 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:53:41,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:53:41,253 INFO L93 Difference]: Finished difference Result 272 states and 968 transitions. [2022-03-15 20:53:41,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 20:53:41,254 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 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:53:41,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:53:41,256 INFO L225 Difference]: With dead ends: 272 [2022-03-15 20:53:41,257 INFO L226 Difference]: Without dead ends: 256 [2022-03-15 20:53:41,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 16 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:53:41,258 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 83 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:53:41,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 1 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:53:41,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-03-15 20:53:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 241. [2022-03-15 20:53:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 3.7625) internal successors, (903), 240 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have 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:53:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 903 transitions. [2022-03-15 20:53:41,276 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 903 transitions. Word has length 15 [2022-03-15 20:53:41,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:53:41,276 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 903 transitions. [2022-03-15 20:53:41,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:53:41,276 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 903 transitions. [2022-03-15 20:53:41,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:53:41,279 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:53:41,279 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:53:41,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 20:53:41,279 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:53:41,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:53:41,280 INFO L85 PathProgramCache]: Analyzing trace with hash 205308252, now seen corresponding path program 1 times [2022-03-15 20:53:41,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:53:41,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680313194] [2022-03-15 20:53:41,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:53:41,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:53:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:53:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:53:41,379 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:53:41,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680313194] [2022-03-15 20:53:41,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680313194] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:53:41,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960258920] [2022-03-15 20:53:41,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:53:41,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:41,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:53:41,387 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:53:41,422 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:53:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:53:41,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:53:41,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:53:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:41,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:53:41,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:53:41,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960258920] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:53:41,762 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:53:41,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 2] total 3 [2022-03-15 20:53:41,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1146184533] [2022-03-15 20:53:41,762 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:53:41,764 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:53:41,772 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 208 transitions. [2022-03-15 20:53:41,772 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:53:43,539 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1726#(and (= (* 2 x3) x4) (= x2 x1))] [2022-03-15 20:53:43,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 20:53:43,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:53:43,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 20:53:43,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:53:43,541 INFO L87 Difference]: Start difference. First operand 241 states and 903 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have 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:53:43,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:53:43,630 INFO L93 Difference]: Finished difference Result 373 states and 1334 transitions. [2022-03-15 20:53:43,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 20:53:43,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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:53:43,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:53:43,634 INFO L225 Difference]: With dead ends: 373 [2022-03-15 20:53:43,634 INFO L226 Difference]: Without dead ends: 365 [2022-03-15 20:53:43,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 45 SyntacticMatches, 55 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:53:43,635 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 7 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:53:43,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 1 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:53:43,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-03-15 20:53:43,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 316. [2022-03-15 20:53:43,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 3.8285714285714287) internal successors, (1206), 315 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have 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:53:43,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 1206 transitions. [2022-03-15 20:53:43,673 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 1206 transitions. Word has length 16 [2022-03-15 20:53:43,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:53:43,673 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 1206 transitions. [2022-03-15 20:53:43,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have 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:53:43,674 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 1206 transitions. [2022-03-15 20:53:43,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:53:43,676 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:53:43,676 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:53:43,700 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:53:43,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:43,893 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:53:43,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:53:43,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1452030651, now seen corresponding path program 1 times [2022-03-15 20:53:43,895 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:53:43,895 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253846177] [2022-03-15 20:53:43,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:53:43,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:53:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:53:43,948 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:53:43,949 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:53:43,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253846177] [2022-03-15 20:53:43,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253846177] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:53:43,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526293307] [2022-03-15 20:53:43,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:53:43,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:43,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:53:43,951 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:53:43,979 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:53:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:53:43,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:53:43,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:53:44,126 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:53:44,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:53:44,208 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:53:44,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526293307] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:53:44,209 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:53:44,209 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 2] total 3 [2022-03-15 20:53:44,209 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1471487017] [2022-03-15 20:53:44,209 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:53:44,211 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:53:44,218 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 208 transitions. [2022-03-15 20:53:44,218 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:53:45,812 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2827#(and (= x4 x3) (= 0 (+ (* (- 2) x2) x1)))] [2022-03-15 20:53:45,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 20:53:45,812 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:53:45,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 20:53:45,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:53:45,813 INFO L87 Difference]: Start difference. First operand 316 states and 1206 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have 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:53:45,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:53:45,906 INFO L93 Difference]: Finished difference Result 482 states and 1754 transitions. [2022-03-15 20:53:45,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 20:53:45,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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:53:45,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:53:45,910 INFO L225 Difference]: With dead ends: 482 [2022-03-15 20:53:45,910 INFO L226 Difference]: Without dead ends: 469 [2022-03-15 20:53:45,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 32 SyntacticMatches, 68 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:53:45,911 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 11 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:53:45,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 1 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:53:45,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-03-15 20:53:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 402. [2022-03-15 20:53:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 3.882793017456359) internal successors, (1557), 401 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have 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:53:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1557 transitions. [2022-03-15 20:53:45,926 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1557 transitions. Word has length 16 [2022-03-15 20:53:45,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:53:45,926 INFO L470 AbstractCegarLoop]: Abstraction has 402 states and 1557 transitions. [2022-03-15 20:53:45,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have 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:53:45,927 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1557 transitions. [2022-03-15 20:53:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:53:45,929 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:53:45,929 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:53:45,955 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:53:46,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:46,154 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:53:46,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:53:46,154 INFO L85 PathProgramCache]: Analyzing trace with hash -206112863, now seen corresponding path program 2 times [2022-03-15 20:53:46,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:53:46,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161910370] [2022-03-15 20:53:46,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:53:46,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:53:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:53:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:46,205 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:53:46,205 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161910370] [2022-03-15 20:53:46,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161910370] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:53:46,205 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69738958] [2022-03-15 20:53:46,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:53:46,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:46,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:53:46,207 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:53:46,208 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:53:46,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:53:46,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:53:46,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 20:53:46,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:53:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:46,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:53:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:46,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69738958] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:53:46,354 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:53:46,354 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-03-15 20:53:46,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1363427933] [2022-03-15 20:53:46,355 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:53:46,356 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:53:46,365 INFO L252 McrAutomatonBuilder]: Finished intersection with 113 states and 279 transitions. [2022-03-15 20:53:46,365 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:53:48,177 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [4231#(or (<= n x3) (<= (+ (* 2 x4) 1) n)), 4233#(or (<= n (* 2 x3)) (<= (+ (* 2 x4) 1) n) (not (< x3 n))), 4223#(or (<= (+ x4 1) n) (<= n (* 2 x3)) (< (* x3 4) n)), 4232#(or (<= n (* 2 x3)) (<= (+ (* 2 x4) 1) n) (not (< x4 n)) (< (* x3 4) n)), 4224#(<= n x3), 4221#(or (<= (+ x4 1) n) (< x3 n)), 4227#(or (<= (+ x4 1) n) (<= n (* 2 x3)) (not (< x3 n))), 4220#(or (<= n (* 2 x3)) (< (* x3 4) n)), 4228#(or (<= (+ (* 2 x4) 1) n) (not (< x4 n))), 4225#(or (<= n (* 2 x3)) (not (< x3 n))), 4222#(or (<= (+ x4 1) n) (< (* 2 x3) n) (not (< x3 n))), 4229#(or (< x3 n) (<= (+ (* 2 x4) 1) n) (not (< x4 n))), 4226#(or (<= (+ x4 1) n) (<= n x3)), 4218#(< x3 n), 4219#(or (< (* 2 x3) n) (not (< x3 n))), 4230#(or (< (* 2 x3) n) (<= (+ (* 2 x4) 1) n) (not (< x3 n)) (not (< x4 n)))] [2022-03-15 20:53:48,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 20:53:48,178 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:53:48,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 20:53:48,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:53:48,179 INFO L87 Difference]: Start difference. First operand 402 states and 1557 transitions. Second operand has 22 states, 22 states have (on average 4.681818181818182) internal successors, (103), 21 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:53:48,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:53:48,812 INFO L93 Difference]: Finished difference Result 808 states and 3205 transitions. [2022-03-15 20:53:48,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 20:53:48,812 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.681818181818182) internal successors, (103), 21 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:53:48,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:53:48,818 INFO L225 Difference]: With dead ends: 808 [2022-03-15 20:53:48,818 INFO L226 Difference]: Without dead ends: 796 [2022-03-15 20:53:48,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 84 SyntacticMatches, 26 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=358, Invalid=1202, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 20:53:48,819 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 362 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:53:48,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [362 Valid, 1 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:53:48,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2022-03-15 20:53:48,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 656. [2022-03-15 20:53:48,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 655 states have (on average 4.235114503816794) internal successors, (2774), 655 states have internal predecessors, (2774), 0 states have call successors, (0), 0 states have 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:53:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 2774 transitions. [2022-03-15 20:53:48,849 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 2774 transitions. Word has length 17 [2022-03-15 20:53:48,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:53:48,849 INFO L470 AbstractCegarLoop]: Abstraction has 656 states and 2774 transitions. [2022-03-15 20:53:48,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.681818181818182) internal successors, (103), 21 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:53:48,850 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 2774 transitions. [2022-03-15 20:53:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:53:48,852 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:53:48,852 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:53:48,879 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:53:49,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:49,068 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:53:49,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:53:49,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1964508165, now seen corresponding path program 3 times [2022-03-15 20:53:49,069 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:53:49,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53932218] [2022-03-15 20:53:49,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:53:49,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:53:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:53:49,105 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:53:49,105 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:53:49,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53932218] [2022-03-15 20:53:49,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53932218] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:53:49,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979640035] [2022-03-15 20:53:49,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:53:49,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:49,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:53:49,107 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:53:49,108 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:53:49,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 20:53:49,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:53:49,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 20:53:49,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:53:49,185 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:53:49,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:53:49,219 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:53:49,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979640035] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:53:49,220 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:53:49,220 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2022-03-15 20:53:49,220 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [583965049] [2022-03-15 20:53:49,220 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:53:49,221 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:53:49,230 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 269 transitions. [2022-03-15 20:53:49,230 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:53:50,774 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [6490#(< x4 n), 6491#(or (< (* 2 x4) n) (not (< x4 n))), 6493#(or (< (* 2 x4) n) (< x3 n) (not (< x4 n))), 6494#(or (<= n (* 2 x4)) (< (* x4 4) n)), 6498#(or (< (* 2 x4) n) (<= (+ (* 2 x3) 1) n) (not (< x3 n)) (not (< x4 n))), 6492#(or (< x4 n) (<= (+ x3 1) n)), 6500#(or (<= n (* 2 x4)) (< (* 2 x3) n) (not (< x3 n)) (< (* x4 4) n)), 6495#(or (<= n (* 2 x4)) (< x3 n) (< (* x4 4) n)), 6499#(or (<= (* 2 x3) x4) (not (< x3 n))), 6501#(or (<= (* 2 x3) (* 2 x4)) (not (< x3 n))), 6496#(or (<= (+ (* 2 x3) 1) n) (not (< x3 n))), 6497#(or (< x4 n) (<= (+ (* 2 x3) 1) n) (not (< x3 n)))] [2022-03-15 20:53:50,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 20:53:50,775 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:53:50,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 20:53:50,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:53:50,775 INFO L87 Difference]: Start difference. First operand 656 states and 2774 transitions. Second operand has 18 states, 18 states have (on average 5.222222222222222) internal successors, (94), 17 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:53:52,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:53:52,062 INFO L93 Difference]: Finished difference Result 1615 states and 6099 transitions. [2022-03-15 20:53:52,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 20:53:52,062 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.222222222222222) internal successors, (94), 17 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:53:52,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:53:52,074 INFO L225 Difference]: With dead ends: 1615 [2022-03-15 20:53:52,075 INFO L226 Difference]: Without dead ends: 1609 [2022-03-15 20:53:52,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 92 SyntacticMatches, 19 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=730, Invalid=3052, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 20:53:52,078 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 596 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:53:52,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [596 Valid, 1 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:53:52,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2022-03-15 20:53:52,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 838. [2022-03-15 20:53:52,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 4.308243727598566) internal successors, (3606), 837 states have internal predecessors, (3606), 0 states have call successors, (0), 0 states have 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:53:52,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 3606 transitions. [2022-03-15 20:53:52,120 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 3606 transitions. Word has length 17 [2022-03-15 20:53:52,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:53:52,120 INFO L470 AbstractCegarLoop]: Abstraction has 838 states and 3606 transitions. [2022-03-15 20:53:52,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.222222222222222) internal successors, (94), 17 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:53:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 3606 transitions. [2022-03-15 20:53:52,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:53:52,123 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:53:52,123 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:53:52,147 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:53:52,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:52,337 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:53:52,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:53:52,337 INFO L85 PathProgramCache]: Analyzing trace with hash 461004860, now seen corresponding path program 2 times [2022-03-15 20:53:52,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:53:52,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547155905] [2022-03-15 20:53:52,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:53:52,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:53:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:53:52,376 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:53:52,377 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:53:52,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547155905] [2022-03-15 20:53:52,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547155905] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:53:52,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684757457] [2022-03-15 20:53:52,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:53:52,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:52,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:53:52,379 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:53:52,400 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:53:52,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:53:52,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:53:52,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 20:53:52,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:53:52,460 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:53:52,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:53:52,492 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:53:52,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684757457] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:53:52,493 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:53:52,493 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-03-15 20:53:52,493 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [480818503] [2022-03-15 20:53:52,493 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:53:52,494 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:53:52,501 INFO L252 McrAutomatonBuilder]: Finished intersection with 113 states and 279 transitions. [2022-03-15 20:53:52,501 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:53:54,095 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [9986#(or (not (< x1 n)) (<= (+ (* 2 x1) 1) n) (< x2 n)), 9983#(or (< x1 n) (< x2 n)), 9991#(or (not (< x1 n)) (< (* x2 4) n) (< (* 2 x1) n) (<= n (* 2 x2))), 9989#(or (<= (+ (* 2 x1) 1) n) (< x2 n)), 9981#(< x2 n), 9982#(or (< (* 2 x2) n) (not (< x2 n))), 9990#(or (< x1 n) (< (* x2 4) n) (<= n (* 2 x2))), 9988#(or (< (* x2 4) n) (<= n (* 2 x2))), 9987#(or (not (< x1 n)) (<= (+ (* 2 x1) 1) n) (< (* 2 x2) n) (not (< x2 n))), 9984#(or (< (* 2 x2) n) (< x1 n) (not (< x2 n))), 9985#(or (not (< x1 n)) (<= (+ (* 2 x1) 1) n)), 9993#(or (<= (+ (* 2 x1) 1) n) (not (< (* 2 x2) n)) (< (* x2 4) n)), 9992#(or (<= (+ (* 2 x1) 1) n) (< (* 2 x2) n) (not (< x2 n)))] [2022-03-15 20:53:54,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 20:53:54,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:53:54,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 20:53:54,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:53:54,097 INFO L87 Difference]: Start difference. First operand 838 states and 3606 transitions. Second operand has 19 states, 19 states have (on average 5.2105263157894735) internal successors, (99), 18 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have 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:53:54,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:53:54,667 INFO L93 Difference]: Finished difference Result 2195 states and 10080 transitions. [2022-03-15 20:53:54,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 20:53:54,667 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.2105263157894735) internal successors, (99), 18 states have internal predecessors, (99), 0 states have call successors, (0), 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:53:54,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:53:54,683 INFO L225 Difference]: With dead ends: 2195 [2022-03-15 20:53:54,683 INFO L226 Difference]: Without dead ends: 2195 [2022-03-15 20:53:54,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 94 SyntacticMatches, 19 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=338, Invalid=1222, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 20:53:54,684 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 435 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:53:54,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [435 Valid, 1 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:53:54,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2022-03-15 20:53:54,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 1810. [2022-03-15 20:53:54,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1809 states have (on average 4.847982310668878) internal successors, (8770), 1809 states have internal predecessors, (8770), 0 states have call successors, (0), 0 states have 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:53:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 8770 transitions. [2022-03-15 20:53:54,773 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 8770 transitions. Word has length 17 [2022-03-15 20:53:54,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:53:54,774 INFO L470 AbstractCegarLoop]: Abstraction has 1810 states and 8770 transitions. [2022-03-15 20:53:54,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.2105263157894735) internal successors, (99), 18 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have 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:53:54,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 8770 transitions. [2022-03-15 20:53:54,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:53:54,781 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:53:54,781 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:53:54,806 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:53:55,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:55,004 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:53:55,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:53:55,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1714285757, now seen corresponding path program 3 times [2022-03-15 20:53:55,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:53:55,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572449751] [2022-03-15 20:53:55,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:53:55,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:53:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:53:55,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:55,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:53:55,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572449751] [2022-03-15 20:53:55,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572449751] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:53:55,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409390292] [2022-03-15 20:53:55,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:53:55,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:55,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:53:55,048 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:53:55,053 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:53:55,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 20:53:55,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:53:55,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 20:53:55,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:53:55,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:55,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:53:55,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:55,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409390292] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:53:55,167 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:53:55,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-03-15 20:53:55,168 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [268234132] [2022-03-15 20:53:55,168 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:53:55,169 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:53:55,177 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 269 transitions. [2022-03-15 20:53:55,177 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:53:56,707 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [15956#(or (not (< x1 n)) (< x2 n) (< (* 2 x1) n)), 15951#(< x2 n), 15962#(or (< (* x1 4) n) (< x2 n) (<= n (* 2 x1))), 15960#(or (<= n x1) (< (* 2 x2) n) (not (< x2 n))), 15954#(or (not (< x1 n)) (< (* 2 x1) n)), 15955#(or (< x1 n) (< x2 n)), 15961#(or (< (* x1 4) n) (<= n (* 2 x1))), 15952#(or (< (* 2 x2) n) (not (< x2 n))), 15953#(< x1 n), 15964#(or (< (* x1 4) n) (< (* 2 x2) n) (<= n x2) (<= n (* 2 x1))), 15957#(or (< (* 2 x2) n) (< x1 n) (not (< x2 n))), 15963#(or (< x2 n) (<= n (* 2 x1))), 15958#(or (not (< x1 n)) (< (* 2 x2) n) (not (< x2 n)) (< (* 2 x1) n)), 15965#(or (< (* 2 x2) n) (not (< x2 n)) (<= n (* 2 x1))), 15959#(or (<= n x1) (< x2 n))] [2022-03-15 20:53:56,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 20:53:56,708 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:53:56,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 20:53:56,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:53:56,709 INFO L87 Difference]: Start difference. First operand 1810 states and 8770 transitions. Second operand has 21 states, 21 states have (on average 5.190476190476191) internal successors, (109), 20 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:53:57,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:53:57,394 INFO L93 Difference]: Finished difference Result 3632 states and 15740 transitions. [2022-03-15 20:53:57,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 20:53:57,394 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.190476190476191) internal successors, (109), 20 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 17 [2022-03-15 20:53:57,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:53:57,418 INFO L225 Difference]: With dead ends: 3632 [2022-03-15 20:53:57,418 INFO L226 Difference]: Without dead ends: 3612 [2022-03-15 20:53:57,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 91 SyntacticMatches, 17 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=471, Invalid=1599, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 20:53:57,420 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 625 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:53:57,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [625 Valid, 1 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:53:57,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3612 states. [2022-03-15 20:53:57,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3612 to 1653. [2022-03-15 20:53:57,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1652 states have (on average 4.703389830508475) internal successors, (7770), 1652 states have internal predecessors, (7770), 0 states have call successors, (0), 0 states have 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:53:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 7770 transitions. [2022-03-15 20:53:57,496 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 7770 transitions. Word has length 17 [2022-03-15 20:53:57,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:53:57,496 INFO L470 AbstractCegarLoop]: Abstraction has 1653 states and 7770 transitions. [2022-03-15 20:53:57,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.190476190476191) internal successors, (109), 20 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:53:57,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 7770 transitions. [2022-03-15 20:53:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:53:57,502 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:53:57,503 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:53:57,527 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:53:57,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:57,720 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:53:57,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:53:57,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1833660842, now seen corresponding path program 4 times [2022-03-15 20:53:57,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:53:57,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956995418] [2022-03-15 20:53:57,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:53:57,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:53:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:53:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:53:57,781 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:53:57,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956995418] [2022-03-15 20:53:57,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956995418] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:53:57,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015748677] [2022-03-15 20:53:57,782 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:53:57,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:57,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:53:57,783 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:53:57,788 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:53:57,813 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:53:57,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:53:57,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:53:57,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:53:57,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:57,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:53:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:53:58,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015748677] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:53:58,064 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:53:58,064 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 3] total 5 [2022-03-15 20:53:58,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [677308419] [2022-03-15 20:53:58,064 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:53:58,065 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:53:58,092 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 362 transitions. [2022-03-15 20:53:58,092 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:54:00,952 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [23059#(and (= (* 2 x3) x4) (= x2 x1)), 23060#(and (= (* x3 4) x4) (= x2 x1))] [2022-03-15 20:54:00,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 20:54:00,952 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:54:00,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 20:54:00,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:54:00,953 INFO L87 Difference]: Start difference. First operand 1653 states and 7770 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:54:01,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:54:01,135 INFO L93 Difference]: Finished difference Result 2047 states and 9064 transitions. [2022-03-15 20:54:01,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:54:01,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 20:54:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:54:01,149 INFO L225 Difference]: With dead ends: 2047 [2022-03-15 20:54:01,150 INFO L226 Difference]: Without dead ends: 2039 [2022-03-15 20:54:01,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 77 SyntacticMatches, 78 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:54:01,150 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:54:01,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 1 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:54:01,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2022-03-15 20:54:01,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 1823. [2022-03-15 20:54:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1823 states, 1822 states have (on average 4.680570801317234) internal successors, (8528), 1822 states have internal predecessors, (8528), 0 states have call successors, (0), 0 states have 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:54:01,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 8528 transitions. [2022-03-15 20:54:01,214 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 8528 transitions. Word has length 18 [2022-03-15 20:54:01,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:54:01,216 INFO L470 AbstractCegarLoop]: Abstraction has 1823 states and 8528 transitions. [2022-03-15 20:54:01,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:54:01,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 8528 transitions. [2022-03-15 20:54:01,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:54:01,222 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:54:01,222 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:54:01,245 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:54:01,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:54:01,443 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:54:01,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:54:01,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2026181786, now seen corresponding path program 5 times [2022-03-15 20:54:01,445 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:54:01,445 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353074039] [2022-03-15 20:54:01,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:54:01,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:54:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:54:01,481 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:54:01,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:54:01,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353074039] [2022-03-15 20:54:01,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353074039] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:54:01,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448332073] [2022-03-15 20:54:01,481 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:54:01,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:54:01,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:54:01,483 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:54:01,483 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:54:01,507 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 20:54:01,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:54:01,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:54:01,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:54:01,655 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:54:01,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:54:01,751 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:54:01,752 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448332073] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:54:01,752 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:54:01,752 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-03-15 20:54:01,753 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [375755937] [2022-03-15 20:54:01,753 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:54:01,754 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:54:01,765 INFO L252 McrAutomatonBuilder]: Finished intersection with 132 states and 330 transitions. [2022-03-15 20:54:01,765 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:54:03,517 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [28881#(or (< x4 n) (< (* 2 x3) n) (not (< x3 n))), 28880#(or (< (* 2 x3) n) (not (< x3 n))), 28882#(or (< (* 2 x4) n) (< (* 2 x3) n) (not (< x3 n)) (not (< x4 n))), 28889#(or (< (* 2 x3) n) (not (< x3 n)) (<= (+ 2 n) x4)), 28875#(or (<= n (* 2 x4)) (< (* x4 4) n)), 28878#(or (< (* 2 x4) n) (< x3 n) (not (< x4 n))), 28887#(or (< x3 n) (<= (+ 2 n) (* 2 x4))), 28879#(or (<= n (* 2 x4)) (< x3 n) (< (* x4 4) n)), 28888#(or (<= n x3) (<= n (* x4 4)) (< (* x4 8) n) (< (* 2 x3) n)), 28876#(< x3 n), 28883#(or (<= n (* 2 x4)) (< (* 2 x3) n) (not (< x3 n)) (< (* x4 4) n)), 28884#(or (<= n (* x4 4)) (< (* x4 8) n)), 28877#(or (< x4 n) (< x3 n)), 28890#(or (< (* 2 x3) n) (not (< x3 n)) (<= (+ 2 n) (* 2 x4))), 28874#(or (< (* 2 x4) n) (not (< x4 n))), 28873#(< x4 n), 28885#(or (<= n (* x4 4)) (< x3 n) (< (* x4 8) n)), 28886#(or (< x3 n) (<= (+ 2 n) x4)), 28891#(or (<= (+ (* 2 x3) 2) (* x4 4)) (not (< x3 n)))] [2022-03-15 20:54:03,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 20:54:03,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:54:03,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 20:54:03,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1028, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:54:03,519 INFO L87 Difference]: Start difference. First operand 1823 states and 8528 transitions. Second operand has 26 states, 26 states have (on average 4.730769230769231) internal successors, (123), 25 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have 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:54:06,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:54:06,042 INFO L93 Difference]: Finished difference Result 5014 states and 21021 transitions. [2022-03-15 20:54:06,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 20:54:06,042 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.730769230769231) internal successors, (123), 25 states have internal predecessors, (123), 0 states have call successors, (0), 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:54:06,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:54:06,064 INFO L225 Difference]: With dead ends: 5014 [2022-03-15 20:54:06,064 INFO L226 Difference]: Without dead ends: 4861 [2022-03-15 20:54:06,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 111 SyntacticMatches, 8 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2498 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1530, Invalid=7212, Unknown=0, NotChecked=0, Total=8742 [2022-03-15 20:54:06,067 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 917 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:54:06,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [917 Valid, 1 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:54:06,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4861 states. [2022-03-15 20:54:06,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4861 to 2385. [2022-03-15 20:54:06,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 2384 states have (on average 4.760067114093959) internal successors, (11348), 2384 states have internal predecessors, (11348), 0 states have call successors, (0), 0 states have 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:54:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 11348 transitions. [2022-03-15 20:54:06,171 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 11348 transitions. Word has length 18 [2022-03-15 20:54:06,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:54:06,171 INFO L470 AbstractCegarLoop]: Abstraction has 2385 states and 11348 transitions. [2022-03-15 20:54:06,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.730769230769231) internal successors, (123), 25 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have 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:54:06,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 11348 transitions. [2022-03-15 20:54:06,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:54:06,180 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:54:06,180 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:54:06,205 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:54:06,403 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,SelfDestructingSolverStorable10 [2022-03-15 20:54:06,403 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:54:06,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:54:06,404 INFO L85 PathProgramCache]: Analyzing trace with hash 888844454, now seen corresponding path program 4 times [2022-03-15 20:54:06,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:54:06,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265554298] [2022-03-15 20:54:06,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:54:06,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:54:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:54:06,457 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:54:06,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:54:06,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265554298] [2022-03-15 20:54:06,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265554298] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:54:06,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853230991] [2022-03-15 20:54:06,458 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:54:06,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:54:06,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:54:06,459 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:54:06,470 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:54:06,491 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:54:06,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:54:06,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:54:06,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:54:06,658 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:54:06,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:54:06,737 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:54:06,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853230991] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:54:06,738 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:54:06,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 3] total 5 [2022-03-15 20:54:06,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [345490121] [2022-03-15 20:54:06,738 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:54:06,739 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:54:06,765 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 362 transitions. [2022-03-15 20:54:06,766 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:54:09,172 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [38902#(and (= x4 x3) (= (+ x1 (* x2 (- 4))) 0)), 38901#(and (= x4 x3) (= 0 (+ (* (- 2) x2) x1)))] [2022-03-15 20:54:09,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 20:54:09,172 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:54:09,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 20:54:09,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:54:09,172 INFO L87 Difference]: Start difference. First operand 2385 states and 11348 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:54:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:54:09,346 INFO L93 Difference]: Finished difference Result 2783 states and 12625 transitions. [2022-03-15 20:54:09,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:54:09,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 20:54:09,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:54:09,357 INFO L225 Difference]: With dead ends: 2783 [2022-03-15 20:54:09,358 INFO L226 Difference]: Without dead ends: 2770 [2022-03-15 20:54:09,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 49 SyntacticMatches, 106 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:54:09,358 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 22 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:54:09,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 1 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:54:09,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2022-03-15 20:54:09,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2476. [2022-03-15 20:54:09,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2475 states have (on average 4.734949494949495) internal successors, (11719), 2475 states have internal predecessors, (11719), 0 states have call successors, (0), 0 states have 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:54:09,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 11719 transitions. [2022-03-15 20:54:09,443 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 11719 transitions. Word has length 18 [2022-03-15 20:54:09,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:54:09,443 INFO L470 AbstractCegarLoop]: Abstraction has 2476 states and 11719 transitions. [2022-03-15 20:54:09,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:54:09,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 11719 transitions. [2022-03-15 20:54:09,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:54:09,451 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:54:09,451 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:54:09,473 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:54:09,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:54:09,674 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:54:09,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:54:09,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1735038811, now seen corresponding path program 1 times [2022-03-15 20:54:09,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:54:09,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406513876] [2022-03-15 20:54:09,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:54:09,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:54:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:54:09,754 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:54:09,754 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:54:09,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406513876] [2022-03-15 20:54:09,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406513876] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:54:09,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912378677] [2022-03-15 20:54:09,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:54:09,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:54:09,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:54:09,755 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:54:09,756 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:54:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:54:09,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:54:09,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:54:09,956 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:54:09,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:54:10,049 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:54:10,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912378677] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:54:10,050 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:54:10,050 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 6 [2022-03-15 20:54:10,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [462740747] [2022-03-15 20:54:10,050 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:54:10,051 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:54:10,060 INFO L252 McrAutomatonBuilder]: Finished intersection with 163 states and 434 transitions. [2022-03-15 20:54:10,061 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:54:13,512 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [46750#(and (= (* 2 x1) x2) (= (* 2 x3) x4)), 46751#(and (= x1 (* 2 x2)) (= (* 2 x4) x3)), 46752#(and (= (* 2 x3) x4) (= x1 (* 2 x2))), 46749#(and (= (+ (* (- 1) x4) (* 2 x3)) 0) (= x2 x1)), 46748#(and (= (+ (* (- 1) x4) x3) 0) (= x1 (* 2 x2)))] [2022-03-15 20:54:13,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:54:13,513 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:54:13,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:54:13,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:54:13,513 INFO L87 Difference]: Start difference. First operand 2476 states and 11719 transitions. Second operand has 11 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:54:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:54:13,987 INFO L93 Difference]: Finished difference Result 4041 states and 18217 transitions. [2022-03-15 20:54:13,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:54:13,988 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 20:54:13,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:54:14,006 INFO L225 Difference]: With dead ends: 4041 [2022-03-15 20:54:14,007 INFO L226 Difference]: Without dead ends: 4009 [2022-03-15 20:54:14,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 54 SyntacticMatches, 118 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:54:14,008 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 35 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:54:14,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 1 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:54:14,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2022-03-15 20:54:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 3113. [2022-03-15 20:54:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3113 states, 3112 states have (on average 4.837403598971722) internal successors, (15054), 3112 states have internal predecessors, (15054), 0 states have call successors, (0), 0 states have 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:54:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 15054 transitions. [2022-03-15 20:54:14,142 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 15054 transitions. Word has length 18 [2022-03-15 20:54:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:54:14,142 INFO L470 AbstractCegarLoop]: Abstraction has 3113 states and 15054 transitions. [2022-03-15 20:54:14,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:54:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 15054 transitions. [2022-03-15 20:54:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:54:14,153 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:54:14,154 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:54:14,178 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:54:14,377 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,SelfDestructingSolverStorable12 [2022-03-15 20:54:14,378 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:54:14,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:54:14,378 INFO L85 PathProgramCache]: Analyzing trace with hash 53225995, now seen corresponding path program 5 times [2022-03-15 20:54:14,379 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:54:14,379 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368340547] [2022-03-15 20:54:14,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:54:14,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:54:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:54:14,416 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:54:14,416 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:54:14,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368340547] [2022-03-15 20:54:14,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368340547] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:54:14,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976926369] [2022-03-15 20:54:14,417 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:54:14,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:54:14,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:54:14,419 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:54:14,427 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:54:14,453 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 20:54:14,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:54:14,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:54:14,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:54:14,581 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:54:14,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:54:14,657 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:54:14,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976926369] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:54:14,657 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:54:14,657 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-03-15 20:54:14,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1366052146] [2022-03-15 20:54:14,658 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:54:14,658 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:54:14,667 INFO L252 McrAutomatonBuilder]: Finished intersection with 138 states and 350 transitions. [2022-03-15 20:54:14,667 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:54:16,490 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [57156#(or (<= (+ 2 n) (* 2 x2)) (not (< x1 n)) (< (* 2 x1) n)), 57147#(or (< (* x2 4) n) (<= n (* 2 x2))), 57139#(< x2 n), 57142#(or (not (< x1 n)) (< (* 2 x1) n)), 57149#(or (<= n x1) (< (* x2 4) n) (< (* 2 x1) n) (<= n (* 2 x2))), 57143#(or (not (< x1 n)) (< x2 n) (< (* 2 x1) n)), 57155#(or (not (< x1 n)) (< (* 2 x1) n) (<= (+ 2 n) x2)), 57140#(< x1 n), 57153#(or (< x1 n) (<= (+ 2 n) x2)), 57154#(or (<= (+ 2 n) (* 2 x2)) (< x1 n)), 57141#(or (< x1 n) (< x2 n)), 57146#(or (not (< x1 n)) (< (* 2 x2) n) (not (< x2 n)) (< (* 2 x1) n)), 57144#(or (< (* 2 x2) n) (not (< x2 n))), 57150#(or (<= n (* x2 4)) (< (* x2 8) n)), 57151#(or (<= n (* x2 4)) (< x1 n) (< (* x2 8) n)), 57145#(or (< (* 2 x2) n) (< x1 n) (not (< x2 n))), 57152#(or (<= n (* x2 4)) (<= n x1) (< (* 2 x1) n) (< (* x2 8) n)), 57148#(or (< x1 n) (< (* x2 4) n) (<= n (* 2 x2)))] [2022-03-15 20:54:16,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:54:16,490 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:54:16,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:54:16,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=968, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 20:54:16,491 INFO L87 Difference]: Start difference. First operand 3113 states and 15054 transitions. Second operand has 25 states, 25 states have (on average 5.4) internal successors, (135), 24 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:54:17,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:54:17,969 INFO L93 Difference]: Finished difference Result 6899 states and 31159 transitions. [2022-03-15 20:54:17,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 20:54:17,969 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.4) internal successors, (135), 24 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 20:54:17,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:54:17,996 INFO L225 Difference]: With dead ends: 6899 [2022-03-15 20:54:17,996 INFO L226 Difference]: Without dead ends: 6851 [2022-03-15 20:54:17,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 118 SyntacticMatches, 8 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=855, Invalid=3837, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 20:54:17,998 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 603 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:54:17,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [603 Valid, 1 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:54:18,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6851 states. [2022-03-15 20:54:18,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6851 to 4341. [2022-03-15 20:54:18,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4341 states, 4340 states have (on average 4.904608294930876) internal successors, (21286), 4340 states have internal predecessors, (21286), 0 states have call successors, (0), 0 states have 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:54:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4341 states to 4341 states and 21286 transitions. [2022-03-15 20:54:18,171 INFO L78 Accepts]: Start accepts. Automaton has 4341 states and 21286 transitions. Word has length 18 [2022-03-15 20:54:18,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:54:18,171 INFO L470 AbstractCegarLoop]: Abstraction has 4341 states and 21286 transitions. [2022-03-15 20:54:18,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.4) internal successors, (135), 24 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:54:18,171 INFO L276 IsEmpty]: Start isEmpty. Operand 4341 states and 21286 transitions. [2022-03-15 20:54:18,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:54:18,184 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:54:18,184 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:54:18,205 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:54:18,399 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,SelfDestructingSolverStorable13 [2022-03-15 20:54:18,399 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:54:18,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:54:18,400 INFO L85 PathProgramCache]: Analyzing trace with hash -2072361125, now seen corresponding path program 6 times [2022-03-15 20:54:18,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:54:18,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011780261] [2022-03-15 20:54:18,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:54:18,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:54:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:54:18,439 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:54:18,439 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:54:18,439 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011780261] [2022-03-15 20:54:18,439 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011780261] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:54:18,439 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377624828] [2022-03-15 20:54:18,439 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:54:18,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:54:18,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:54:18,441 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:54:18,449 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:54:18,474 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 20:54:18,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:54:18,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:54:18,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:54:18,556 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:54:18,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:54:18,598 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:54:18,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377624828] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:54:18,599 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:54:18,599 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2022-03-15 20:54:18,599 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2076834989] [2022-03-15 20:54:18,599 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:54:18,600 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:54:18,613 INFO L252 McrAutomatonBuilder]: Finished intersection with 174 states and 455 transitions. [2022-03-15 20:54:18,613 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:54:21,541 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [72942#(or (<= (+ x4 1) n) (<= n (* 2 x3)) (not (< x3 n))), 72926#(or (< (* 2 x3) n) (not (< x3 n))), 72952#(or (<= n (* 2 x3)) (<= (+ (* x4 4) 1) n) (not (< x3 n))), 72946#(or (<= n (* x3 4)) (<= (+ (* 2 x4) 1) n) (not (< x3 n))), 72933#(or (<= (+ x4 1) n) (<= n (* 2 x3)) (< (* x3 4) n)), 72928#(<= n x3), 72948#(or (<= n (* 2 x4)) (< x3 n) (<= (+ (* x4 4) 1) n)), 72932#(or (<= (+ x4 1) n) (< (* 2 x3) n) (not (< x3 n))), 72953#(or (<= n (* x3 4)) (<= n (* 2 x4)) (< (* x3 8) n) (<= (+ (* x4 4) 1) n)), 72936#(or (< x3 n) (<= (+ (* 2 x4) 1) n) (not (< x4 n))), 72950#(or (<= n (* 2 x4)) (<= n (* 2 x3)) (<= (+ (* x4 4) 1) n) (< (* x3 4) n)), 72951#(or (<= n x3) (<= (+ (* x4 4) 1) n)), 72931#(or (<= (+ x4 1) n) (< x3 n)), 72937#(or (< (* 2 x3) n) (<= (+ (* 2 x4) 1) n) (not (< x3 n)) (not (< x4 n))), 72929#(or (<= n (* 2 x3)) (not (< x3 n))), 72954#(or (<= n (* x3 4)) (<= (+ (* x4 4) 1) n) (not (< x3 n))), 72925#(< x3 n), 72930#(or (<= n (* x3 4)) (< (* x3 8) n)), 72947#(or (<= n (* 2 x4)) (<= (+ (* x4 4) 1) n)), 72940#(or (<= n x3) (<= n (* x3 4))), 72939#(or (<= n x4) (<= n (* x3 4)) (< (* x3 8) n) (<= (+ (* 2 x4) 1) n)), 72927#(or (<= n (* 2 x3)) (< (* x3 4) n)), 72943#(or (<= (+ x4 1) n) (<= n x3) (<= n (* x3 4))), 72938#(or (<= n (* 2 x3)) (<= (+ (* 2 x4) 1) n) (not (< x4 n)) (< (* x3 4) n)), 72935#(or (<= (+ (* 2 x4) 1) n) (not (< x4 n))), 72941#(or (<= (+ x4 1) n) (<= n x3)), 72944#(or (<= n x3) (<= (+ (* 2 x4) 1) n)), 72949#(or (<= n x3) (<= n (* 2 x4)) (<= (+ (* x4 4) 1) n) (< (* 2 x3) n)), 72934#(or (<= (+ x4 1) n) (<= n (* x3 4)) (< (* x3 8) n)), 72945#(or (<= n (* 2 x3)) (<= (+ (* 2 x4) 1) n) (not (< x3 n)))] [2022-03-15 20:54:21,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 20:54:21,542 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:54:21,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 20:54:21,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1344, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 20:54:21,543 INFO L87 Difference]: Start difference. First operand 4341 states and 21286 transitions. Second operand has 38 states, 38 states have (on average 4.578947368421052) internal successors, (174), 37 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have 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:54:23,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:54:23,015 INFO L93 Difference]: Finished difference Result 9468 states and 44680 transitions. [2022-03-15 20:54:23,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-15 20:54:23,015 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.578947368421052) internal successors, (174), 37 states have internal predecessors, (174), 0 states have call successors, (0), 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:54:23,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:54:23,066 INFO L225 Difference]: With dead ends: 9468 [2022-03-15 20:54:23,066 INFO L226 Difference]: Without dead ends: 9377 [2022-03-15 20:54:23,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 128 SyntacticMatches, 30 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1989 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1347, Invalid=4973, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 20:54:23,068 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1176 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:54:23,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1176 Valid, 1 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:54:23,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9377 states. [2022-03-15 20:54:23,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9377 to 6509. [2022-03-15 20:54:23,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6509 states, 6508 states have (on average 5.055623847572218) internal successors, (32902), 6508 states have internal predecessors, (32902), 0 states have call successors, (0), 0 states have 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:54:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6509 states to 6509 states and 32902 transitions. [2022-03-15 20:54:23,282 INFO L78 Accepts]: Start accepts. Automaton has 6509 states and 32902 transitions. Word has length 19 [2022-03-15 20:54:23,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:54:23,282 INFO L470 AbstractCegarLoop]: Abstraction has 6509 states and 32902 transitions. [2022-03-15 20:54:23,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.578947368421052) internal successors, (174), 37 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have 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:54:23,283 INFO L276 IsEmpty]: Start isEmpty. Operand 6509 states and 32902 transitions. [2022-03-15 20:54:23,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:54:23,304 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:54:23,304 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:54:23,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 20:54:23,505 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,SelfDestructingSolverStorable14 [2022-03-15 20:54:23,505 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:54:23,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:54:23,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1069967837, now seen corresponding path program 6 times [2022-03-15 20:54:23,507 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:54:23,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849141268] [2022-03-15 20:54:23,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:54:23,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:54:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:54:23,552 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:54:23,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:54:23,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849141268] [2022-03-15 20:54:23,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849141268] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:54:23,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441047956] [2022-03-15 20:54:23,553 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:54:23,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:54:23,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:54:23,554 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:54:23,555 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:54:23,580 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 20:54:23,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:54:23,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:54:23,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:54:23,657 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:54:23,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:54:23,708 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:54:23,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441047956] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:54:23,709 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:54:23,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2022-03-15 20:54:23,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1691620910] [2022-03-15 20:54:23,709 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:54:23,710 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:54:23,724 INFO L252 McrAutomatonBuilder]: Finished intersection with 174 states and 455 transitions. [2022-03-15 20:54:23,724 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:54:26,982 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [95652#(or (< (* 2 x2) n) (<= (+ (* x1 4) 1) n) (not (< x2 n)) (<= n (* 2 x1))), 95641#(or (< (* 2 x2) n) (< x1 n) (not (< x2 n))), 95647#(or (not (< x1 n)) (<= (+ (* 2 x1) 1) n) (< x2 n)), 95649#(or (not (< x1 n)) (< (* x2 4) n) (< (* 2 x1) n) (<= n (* 2 x2))), 95651#(or (<= (+ (* x1 4) 1) n) (< x2 n) (<= n (* 2 x1))), 95644#(or (<= n (* x2 4)) (< (* x2 8) n)), 95645#(or (<= n (* x2 4)) (< x1 n) (< (* x2 8) n)), 95653#(or (<= n (* x2 4)) (<= n x1) (< (* 2 x1) n) (< (* x2 8) n)), 95656#(or (<= (+ (* 2 x1) 1) n) (not (< (* 2 x2) n)) (< (* x2 4) n)), 95663#(or (<= n (* x2 4)) (<= (+ (* x1 4) 1) n) (< (* x2 8) n)), 95642#(or (< (* x2 4) n) (<= n (* 2 x2))), 95655#(or (<= (+ (* 2 x1) 1) n) (< (* 2 x2) n) (not (< x2 n))), 95662#(or (<= (+ (* x1 4) 1) n) (< (* x2 4) n) (<= n (* 2 x2))), 95643#(or (< x1 n) (< (* x2 4) n) (<= n (* 2 x2))), 95661#(or (< (* 2 x2) n) (<= (+ (* x1 4) 1) n) (not (< x2 n))), 95640#(or (< x1 n) (< x2 n)), 95657#(or (<= n (* x2 4)) (<= (+ (* 2 x1) 1) n) (< (* x2 8) n)), 95638#(< x2 n), 95648#(or (not (< x1 n)) (<= (+ (* 2 x1) 1) n) (< (* 2 x2) n) (not (< x2 n))), 95659#(or (<= n (* x2 4)) (< (* x1 4) n) (<= n (* 2 x1)) (< (* x2 8) n)), 95658#(or (< (* x1 4) n) (< (* x2 4) n) (<= n (* 2 x1)) (<= n (* 2 x2))), 95646#(or (not (< x1 n)) (<= (+ (* 2 x1) 1) n)), 95654#(or (<= (+ (* 2 x1) 1) n) (< x2 n)), 95639#(or (< (* 2 x2) n) (not (< x2 n))), 95660#(or (<= (+ (* x1 4) 1) n) (< x2 n)), 95650#(or (<= (+ (* x1 4) 1) n) (<= n (* 2 x1)))] [2022-03-15 20:54:26,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 20:54:26,983 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:54:26,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 20:54:26,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1108, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 20:54:26,983 INFO L87 Difference]: Start difference. First operand 6509 states and 32902 transitions. Second operand has 34 states, 34 states have (on average 5.0588235294117645) internal successors, (172), 33 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:54:28,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:54:28,922 INFO L93 Difference]: Finished difference Result 15020 states and 75324 transitions. [2022-03-15 20:54:28,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 20:54:28,923 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.0588235294117645) internal successors, (172), 33 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 19 [2022-03-15 20:54:28,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:54:28,976 INFO L225 Difference]: With dead ends: 15020 [2022-03-15 20:54:28,976 INFO L226 Difference]: Without dead ends: 15020 [2022-03-15 20:54:28,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 134 SyntacticMatches, 28 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2002 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1332, Invalid=5474, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 20:54:28,978 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1327 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1327 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:54:28,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1327 Valid, 1 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:54:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15020 states. [2022-03-15 20:54:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15020 to 9794. [2022-03-15 20:54:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9794 states, 9793 states have (on average 5.3141019095272135) internal successors, (52041), 9793 states have internal predecessors, (52041), 0 states have call successors, (0), 0 states have 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:54:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9794 states to 9794 states and 52041 transitions. [2022-03-15 20:54:29,321 INFO L78 Accepts]: Start accepts. Automaton has 9794 states and 52041 transitions. Word has length 19 [2022-03-15 20:54:29,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:54:29,321 INFO L470 AbstractCegarLoop]: Abstraction has 9794 states and 52041 transitions. [2022-03-15 20:54:29,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.0588235294117645) internal successors, (172), 33 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:54:29,322 INFO L276 IsEmpty]: Start isEmpty. Operand 9794 states and 52041 transitions. [2022-03-15 20:54:29,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:54:29,355 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:54:29,355 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:54:29,379 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:54:29,579 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,SelfDestructingSolverStorable15 [2022-03-15 20:54:29,579 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:54:29,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:54:29,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1266969980, now seen corresponding path program 7 times [2022-03-15 20:54:29,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:54:29,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980747744] [2022-03-15 20:54:29,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:54:29,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:54:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:54:29,625 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:54:29,626 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:54:29,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980747744] [2022-03-15 20:54:29,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980747744] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:54:29,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308604680] [2022-03-15 20:54:29,626 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:54:29,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:54:29,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:54:29,627 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:54:29,629 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:54:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:54:29,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:54:29,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:54:29,736 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:54:29,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:54:29,794 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:54:29,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308604680] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:54:29,794 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:54:29,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2022-03-15 20:54:29,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1545629268] [2022-03-15 20:54:29,795 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:54:29,796 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:54:29,874 INFO L252 McrAutomatonBuilder]: Finished intersection with 171 states and 445 transitions. [2022-03-15 20:54:29,875 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:54:32,792 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [130486#(or (< x1 n) (< x2 n)), 130491#(or (< (* 2 x2) n) (< x1 n) (not (< x2 n))), 130499#(or (< (* x1 8) n) (<= n (* x1 4)) (< x2 n)), 130485#(< x2 n), 130496#(or (<= n x1) (< (* x2 4) n) (< (* 2 x1) n) (<= n (* 2 x2))), 130501#(or (< (* x1 8) n) (<= n (* x1 4)) (< (* x2 4) n) (<= n (* 2 x2))), 130488#(or (< (* x1 4) n) (<= n (* 2 x1))), 130509#(or (< (* 2 x2) n) (<= n (* x1 4)) (not (< x2 n))), 130484#(or (not (< x1 n)) (< (* 2 x1) n)), 130492#(or (not (< x1 n)) (< (* 2 x2) n) (not (< x2 n)) (< (* 2 x1) n)), 130506#(or (<= n x1) (not (< (* 2 x2) n)) (< (* x2 4) n)), 130510#(or (not (< (* 2 x2) n)) (<= n (* x1 4)) (< (* x2 4) n)), 130483#(< x1 n), 130489#(or (< (* x1 4) n) (< x2 n) (<= n (* 2 x1))), 130498#(or (< (* x1 8) n) (<= n (* x1 4))), 130497#(or (< (* x1 4) n) (< (* x2 4) n) (<= n (* 2 x1)) (<= n (* 2 x2))), 130494#(or (< (* x2 4) n) (<= n (* 2 x2))), 130490#(or (< (* 2 x2) n) (not (< x2 n))), 130505#(or (< (* 2 x2) n) (not (< x2 n)) (<= n (* 2 x1))), 130508#(or (<= n (* x1 4)) (< x2 n)), 130487#(or (not (< x1 n)) (< x2 n) (< (* 2 x1) n)), 130495#(or (< x1 n) (< (* x2 4) n) (<= n (* 2 x2))), 130507#(or (< (* x2 4) n) (<= n (* 2 x1)) (<= n (* 2 x2))), 130493#(or (< (* x1 4) n) (< (* 2 x2) n) (<= n x2) (<= n (* 2 x1))), 130504#(or (<= n x1) (< (* 2 x2) n) (not (< x2 n))), 130503#(or (< x2 n) (<= n (* 2 x1))), 130500#(or (< (* 2 x2) n) (< (* x1 8) n) (<= n (* x1 4)) (<= n x2)), 130502#(or (<= n x1) (< x2 n))] [2022-03-15 20:54:32,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 20:54:32,793 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:54:32,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 20:54:32,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1246, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 20:54:32,794 INFO L87 Difference]: Start difference. First operand 9794 states and 52041 transitions. Second operand has 36 states, 36 states have (on average 5.111111111111111) internal successors, (184), 35 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:54:35,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:54:35,945 INFO L93 Difference]: Finished difference Result 29719 states and 146377 transitions. [2022-03-15 20:54:35,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-03-15 20:54:35,945 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.111111111111111) internal successors, (184), 35 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 20:54:35,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:54:36,057 INFO L225 Difference]: With dead ends: 29719 [2022-03-15 20:54:36,057 INFO L226 Difference]: Without dead ends: 29631 [2022-03-15 20:54:36,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 135 SyntacticMatches, 22 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4642 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2859, Invalid=11903, Unknown=0, NotChecked=0, Total=14762 [2022-03-15 20:54:36,061 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 2247 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 1526 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2247 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 1526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:54:36,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2247 Valid, 1 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:54:36,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29631 states. [2022-03-15 20:54:36,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29631 to 12592. [2022-03-15 20:54:36,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12592 states, 12591 states have (on average 5.482725756492733) internal successors, (69033), 12591 states have internal predecessors, (69033), 0 states have call successors, (0), 0 states have 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:54:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12592 states to 12592 states and 69033 transitions. [2022-03-15 20:54:36,698 INFO L78 Accepts]: Start accepts. Automaton has 12592 states and 69033 transitions. Word has length 19 [2022-03-15 20:54:36,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:54:36,698 INFO L470 AbstractCegarLoop]: Abstraction has 12592 states and 69033 transitions. [2022-03-15 20:54:36,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.111111111111111) internal successors, (184), 35 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:54:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 12592 states and 69033 transitions. [2022-03-15 20:54:36,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:54:36,741 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:54:36,741 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:54:36,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-03-15 20:54:36,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:54:36,961 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:54:36,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:54:36,962 INFO L85 PathProgramCache]: Analyzing trace with hash 442185180, now seen corresponding path program 7 times [2022-03-15 20:54:36,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:54:36,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906025036] [2022-03-15 20:54:36,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:54:36,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:54:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:54:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:54:37,031 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:54:37,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906025036] [2022-03-15 20:54:37,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906025036] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:54:37,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101602683] [2022-03-15 20:54:37,031 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:54:37,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:54:37,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:54:37,033 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:54:37,042 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:54:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:54:37,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 20:54:37,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:54:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:54:37,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:54:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:54:37,372 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101602683] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:54:37,373 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:54:37,373 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 4] total 7 [2022-03-15 20:54:37,373 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1111527063] [2022-03-15 20:54:37,373 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:54:37,374 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:54:37,390 INFO L252 McrAutomatonBuilder]: Finished intersection with 210 states and 560 transitions. [2022-03-15 20:54:37,391 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:54:41,973 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [185705#(and (= (* x3 8) x4) (= x2 x1)), 185704#(and (= (* x3 4) x4) (= x2 x1)), 185703#(and (= (* 2 x3) x4) (= x2 x1))] [2022-03-15 20:54:41,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:54:41,973 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:54:41,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:54:41,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:54:41,974 INFO L87 Difference]: Start difference. First operand 12592 states and 69033 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:54:42,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:54:42,321 INFO L93 Difference]: Finished difference Result 13244 states and 71007 transitions. [2022-03-15 20:54:42,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 20:54:42,321 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 20:54:42,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:54:42,368 INFO L225 Difference]: With dead ends: 13244 [2022-03-15 20:54:42,368 INFO L226 Difference]: Without dead ends: 13236 [2022-03-15 20:54:42,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 116 SyntacticMatches, 108 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:54:42,369 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:54:42,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 1 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:54:42,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13236 states. [2022-03-15 20:54:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13236 to 12739. [2022-03-15 20:54:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12739 states, 12738 states have (on average 5.465771706704349) internal successors, (69623), 12738 states have internal predecessors, (69623), 0 states have call successors, (0), 0 states have 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:54:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12739 states to 12739 states and 69623 transitions. [2022-03-15 20:54:42,758 INFO L78 Accepts]: Start accepts. Automaton has 12739 states and 69623 transitions. Word has length 20 [2022-03-15 20:54:42,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:54:42,758 INFO L470 AbstractCegarLoop]: Abstraction has 12739 states and 69623 transitions. [2022-03-15 20:54:42,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:54:42,758 INFO L276 IsEmpty]: Start isEmpty. Operand 12739 states and 69623 transitions. [2022-03-15 20:54:42,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:54:42,801 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:54:42,801 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:54:42,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-03-15 20:54:43,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 20:54:43,015 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:54:43,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:54:43,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1453552714, now seen corresponding path program 8 times [2022-03-15 20:54:43,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:54:43,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300041728] [2022-03-15 20:54:43,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:54:43,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:54:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:54:43,069 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:54:43,069 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:54:43,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300041728] [2022-03-15 20:54:43,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300041728] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:54:43,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254267482] [2022-03-15 20:54:43,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:54:43,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:54:43,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:54:43,070 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:54:43,071 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:54:43,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:54:43,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:54:43,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:54:43,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:54:43,196 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:54:43,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:54:43,262 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:54:43,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254267482] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:54:43,262 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:54:43,262 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5] total 15 [2022-03-15 20:54:43,262 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [77205036] [2022-03-15 20:54:43,262 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:54:43,263 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:54:43,278 INFO L252 McrAutomatonBuilder]: Finished intersection with 200 states and 528 transitions. [2022-03-15 20:54:43,278 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:54:47,104 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 33 new interpolants: [224572#(or (<= n (* 2 x3)) (< (* x3 4) n)), 224565#(or (<= (+ (* 2 x3) 5) n) (not (< x3 n))), 224573#(or (not (< (* 2 x3) n)) (<= (+ (* x3 4) 5) n) (not (< x3 n))), 224558#(< x4 n), 224582#(or (not (< x3 n)) (<= (+ (* 2 x3) 4) (* x4 4))), 224588#(or (<= n (* x4 8)) (<= n (* 2 x3)) (< (* 16 x4) n) (< (* x3 4) n)), 224576#(or (< (* 2 x4) n) (<= n (* 2 x3)) (not (< x4 n)) (< (* x3 4) n)), 224568#(or (<= (+ (* 2 x3) 4) x4) (not (< x3 n))), 224589#(or (not (< (* 2 x3) n)) (<= (+ (* x3 4) 4) (* x4 8)) (not (< x3 n))), 224574#(or (< x4 n) (<= n (* 2 x3)) (< (* x3 4) n)), 224579#(or (not (< (* 2 x3) n)) (<= (+ (* x3 4) 4) (* 2 x4)) (not (< x3 n))), 224560#(or (<= n (* 2 x4)) (< (* x4 4) n)), 224580#(or (<= n (* x4 4)) (< x3 n) (< (* x4 8) n)), 224587#(or (not (< (* 2 x3) n)) (not (< x3 n)) (<= (+ (* x3 4) 4) (* x4 4))), 224559#(or (< (* 2 x4) n) (not (< x4 n))), 224584#(or (<= n x3) (<= n (* x4 8)) (< (* 2 x3) n) (< (* 16 x4) n)), 224577#(or (not (< (* 2 x3) n)) (<= (+ (* x3 4) 4) x4) (not (< x3 n))), 224563#(or (< x4 n) (< x3 n)), 224585#(or (<= (+ (* 2 x3) 4) (* x4 8)) (not (< x3 n))), 224570#(or (<= n (* 2 x4)) (< (* 2 x3) n) (not (< x3 n)) (< (* x4 4) n)), 224569#(or (<= n (* 2 x4)) (< x3 n) (< (* x4 4) n)), 224578#(or (<= n (* 2 x4)) (<= n (* 2 x3)) (< (* x4 4) n) (< (* x3 4) n)), 224518#(< x3 n), 224562#(or (< (* 2 x3) n) (not (< x3 n))), 224564#(or (< x4 n) (< (* 2 x3) n) (not (< x3 n))), 224583#(or (<= n (* x4 8)) (< x3 n) (< (* 16 x4) n)), 224571#(or (<= (+ (* 2 x3) 4) (* 2 x4)) (not (< x3 n))), 224567#(or (< (* 2 x4) n) (< (* 2 x3) n) (not (< x3 n)) (not (< x4 n))), 224581#(or (<= n x3) (<= n (* x4 4)) (< (* x4 8) n) (< (* 2 x3) n)), 224575#(or (<= n (* x4 8)) (< (* 16 x4) n)), 224566#(or (< (* 2 x4) n) (< x3 n) (not (< x4 n))), 224586#(or (<= n (* x4 4)) (<= n (* 2 x3)) (< (* x4 8) n) (< (* x3 4) n)), 224561#(or (<= n (* x4 4)) (< (* x4 8) n))] [2022-03-15 20:54:47,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 20:54:47,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:54:47,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 20:54:47,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1990, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 20:54:47,105 INFO L87 Difference]: Start difference. First operand 12739 states and 69623 transitions. Second operand has 42 states, 42 states have (on average 4.738095238095238) internal successors, (199), 41 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have 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:54:58,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:54:58,269 INFO L93 Difference]: Finished difference Result 43434 states and 208255 transitions. [2022-03-15 20:54:58,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2022-03-15 20:54:58,269 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.738095238095238) internal successors, (199), 41 states have internal predecessors, (199), 0 states have call successors, (0), 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:54:58,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:54:58,481 INFO L225 Difference]: With dead ends: 43434 [2022-03-15 20:54:58,481 INFO L226 Difference]: Without dead ends: 43416 [2022-03-15 20:54:58,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 161 SyntacticMatches, 18 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19451 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=8232, Invalid=46758, Unknown=0, NotChecked=0, Total=54990 [2022-03-15 20:54:58,486 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 3401 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 5887 mSolverCounterSat, 641 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3401 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 6528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 641 IncrementalHoareTripleChecker+Valid, 5887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:54:58,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3401 Valid, 1 Invalid, 6528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [641 Valid, 5887 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 20:54:58,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43416 states. [2022-03-15 20:54:59,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43416 to 19483. [2022-03-15 20:54:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19483 states, 19482 states have (on average 5.475926496252951) internal successors, (106682), 19482 states have internal predecessors, (106682), 0 states have call successors, (0), 0 states have 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:54:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19483 states to 19483 states and 106682 transitions. [2022-03-15 20:54:59,615 INFO L78 Accepts]: Start accepts. Automaton has 19483 states and 106682 transitions. Word has length 20 [2022-03-15 20:54:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:54:59,615 INFO L470 AbstractCegarLoop]: Abstraction has 19483 states and 106682 transitions. [2022-03-15 20:54:59,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.738095238095238) internal successors, (199), 41 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have 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:54:59,616 INFO L276 IsEmpty]: Start isEmpty. Operand 19483 states and 106682 transitions. [2022-03-15 20:54:59,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:54:59,665 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:54:59,665 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:54:59,681 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:54:59,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:54:59,866 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:54:59,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:54:59,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1708139739, now seen corresponding path program 8 times [2022-03-15 20:54:59,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:54:59,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504788424] [2022-03-15 20:54:59,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:54:59,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:54:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:55:00,089 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:55:00,090 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:55:00,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504788424] [2022-03-15 20:55:00,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504788424] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:55:00,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204214321] [2022-03-15 20:55:00,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:55:00,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:55:00,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:55:00,091 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:55:00,096 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:55:00,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:55:00,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:55:00,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 20:55:00,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:55:00,372 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:55:00,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:55:00,477 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:55:00,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204214321] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:55:00,477 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:55:00,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 4] total 7 [2022-03-15 20:55:00,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [251193876] [2022-03-15 20:55:00,477 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:55:00,479 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:55:00,494 INFO L252 McrAutomatonBuilder]: Finished intersection with 210 states and 560 transitions. [2022-03-15 20:55:00,494 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:55:04,684 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [307487#(and (= x4 x3) (= 0 (+ (* (- 2) x2) x1))), 307488#(and (= x4 x3) (= (+ x1 (* x2 (- 4))) 0)), 307489#(and (= x4 x3) (= (+ x1 (* x2 (- 8))) 0))] [2022-03-15 20:55:04,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:55:04,684 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:55:04,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:55:04,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:55:04,685 INFO L87 Difference]: Start difference. First operand 19483 states and 106682 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:05,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:55:05,164 INFO L93 Difference]: Finished difference Result 20327 states and 109566 transitions. [2022-03-15 20:55:05,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 20:55:05,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 20:55:05,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:55:05,244 INFO L225 Difference]: With dead ends: 20327 [2022-03-15 20:55:05,244 INFO L226 Difference]: Without dead ends: 20314 [2022-03-15 20:55:05,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 69 SyntacticMatches, 155 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:55:05,245 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 33 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:55:05,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 1 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:55:05,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20314 states. [2022-03-15 20:55:05,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20314 to 19696. [2022-03-15 20:55:05,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19696 states, 19695 states have (on average 5.462300076161462) internal successors, (107580), 19695 states have internal predecessors, (107580), 0 states have call successors, (0), 0 states have 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:55:05,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19696 states to 19696 states and 107580 transitions. [2022-03-15 20:55:05,873 INFO L78 Accepts]: Start accepts. Automaton has 19696 states and 107580 transitions. Word has length 20 [2022-03-15 20:55:05,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:55:05,873 INFO L470 AbstractCegarLoop]: Abstraction has 19696 states and 107580 transitions. [2022-03-15 20:55:05,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:05,873 INFO L276 IsEmpty]: Start isEmpty. Operand 19696 states and 107580 transitions. [2022-03-15 20:55:05,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:55:05,921 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:55:05,921 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:55:05,938 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:55:06,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:55:06,122 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:55:06,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:55:06,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1175637338, now seen corresponding path program 2 times [2022-03-15 20:55:06,123 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:55:06,124 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636200594] [2022-03-15 20:55:06,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:55:06,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:55:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:55:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:06,254 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:55:06,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636200594] [2022-03-15 20:55:06,255 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636200594] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:55:06,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162906447] [2022-03-15 20:55:06,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:55:06,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:55:06,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:55:06,260 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:55:06,261 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:55:06,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:55:06,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:55:06,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 20:55:06,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:55:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:06,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:55:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:06,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162906447] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:55:06,868 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:55:06,868 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 9 [2022-03-15 20:55:06,868 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1336168235] [2022-03-15 20:55:06,868 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:55:06,870 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:55:06,893 INFO L252 McrAutomatonBuilder]: Finished intersection with 264 states and 748 transitions. [2022-03-15 20:55:06,894 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:55:13,402 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [367340#(and (= (* 2 x3) x4) (= (* x2 4) x1)), 367341#(and (= (* 2 x1) x2) (= (* 2 x3) x4)), 367336#(and (= x1 (* 2 x2)) (= (* 2 x4) x3)), 367342#(and (= x2 (* x1 4)) (= (* 2 x3) x4)), 367339#(and (= (* x2 4) x1) (= (* 2 x4) x3)), 367337#(and (= (* 2 x3) x4) (= x1 (* 2 x2))), 367334#(and (= (+ (* (- 1) x4) (* 2 x3)) 0) (= x2 x1)), 367335#(and (= (+ (* (- 1) x4) x3) 0) (= x1 (* 2 x2))), 367338#(and (= (+ (* (- 1) x4) x3) 0) (= (* x2 4) x1))] [2022-03-15 20:55:13,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 20:55:13,402 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:55:13,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 20:55:13,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:55:13,403 INFO L87 Difference]: Start difference. First operand 19696 states and 107580 transitions. Second operand has 17 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:14,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:55:14,680 INFO L93 Difference]: Finished difference Result 24730 states and 130652 transitions. [2022-03-15 20:55:14,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:55:14,681 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 20:55:14,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:55:14,854 INFO L225 Difference]: With dead ends: 24730 [2022-03-15 20:55:14,854 INFO L226 Difference]: Without dead ends: 24692 [2022-03-15 20:55:14,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 86 SyntacticMatches, 184 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:55:14,855 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 66 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 3033 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:55:14,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 1 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3033 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:55:14,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24692 states. [2022-03-15 20:55:15,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24692 to 20529. [2022-03-15 20:55:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20529 states, 20528 states have (on average 5.4633671083398285) internal successors, (112152), 20528 states have internal predecessors, (112152), 0 states have call successors, (0), 0 states have 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:55:15,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20529 states to 20529 states and 112152 transitions. [2022-03-15 20:55:15,614 INFO L78 Accepts]: Start accepts. Automaton has 20529 states and 112152 transitions. Word has length 20 [2022-03-15 20:55:15,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:55:15,615 INFO L470 AbstractCegarLoop]: Abstraction has 20529 states and 112152 transitions. [2022-03-15 20:55:15,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:15,616 INFO L276 IsEmpty]: Start isEmpty. Operand 20529 states and 112152 transitions. [2022-03-15 20:55:15,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:55:15,676 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:55:15,676 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:55:15,699 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:55:15,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:55:15,895 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:55:15,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:55:15,897 INFO L85 PathProgramCache]: Analyzing trace with hash 378413509, now seen corresponding path program 3 times [2022-03-15 20:55:15,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:55:15,897 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730392538] [2022-03-15 20:55:15,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:55:15,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:55:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:55:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:16,002 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:55:16,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730392538] [2022-03-15 20:55:16,003 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730392538] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:55:16,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976442918] [2022-03-15 20:55:16,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:55:16,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:55:16,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:55:16,004 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:55:16,030 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:55:16,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 20:55:16,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:55:16,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 20:55:16,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:55:16,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:16,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:55:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:16,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976442918] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:55:16,624 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:55:16,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 9 [2022-03-15 20:55:16,625 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1025054296] [2022-03-15 20:55:16,625 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:55:16,626 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:55:16,644 INFO L252 McrAutomatonBuilder]: Finished intersection with 264 states and 748 transitions. [2022-03-15 20:55:16,644 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:55:23,473 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [433262#(and (= (* x3 4) x4) (= x1 (* 2 x2))), 433258#(and (= (+ (* (- 1) x4) x3) 0) (= x1 (* 2 x2))), 433256#(and (= (+ (* (- 1) x4) (* 2 x3)) 0) (= x2 x1)), 433263#(and (= (* 2 x1) x2) (= (* 2 x3) x4)), 433260#(and (= x3 (* x4 4)) (= x1 (* 2 x2))), 433261#(and (= (* 2 x3) x4) (= x1 (* 2 x2))), 433264#(and (= (* 2 x1) x2) (= (* x3 4) x4)), 433257#(and (= (+ (* (- 1) x4) (* x3 4)) 0) (= x2 x1)), 433259#(and (= x1 (* 2 x2)) (= (* 2 x4) x3))] [2022-03-15 20:55:23,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 20:55:23,474 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:55:23,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 20:55:23,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:55:23,474 INFO L87 Difference]: Start difference. First operand 20529 states and 112152 transitions. Second operand has 17 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:24,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:55:24,802 INFO L93 Difference]: Finished difference Result 30809 states and 162290 transitions. [2022-03-15 20:55:24,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:55:24,803 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 20:55:24,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:55:24,947 INFO L225 Difference]: With dead ends: 30809 [2022-03-15 20:55:24,948 INFO L226 Difference]: Without dead ends: 30771 [2022-03-15 20:55:24,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 97 SyntacticMatches, 173 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:55:24,948 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 68 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 3048 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:55:24,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 1 Invalid, 3048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3048 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:55:24,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30771 states. [2022-03-15 20:55:25,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30771 to 26256. [2022-03-15 20:55:25,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26256 states, 26255 states have (on average 5.519101123595505) internal successors, (144904), 26255 states have internal predecessors, (144904), 0 states have call successors, (0), 0 states have 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:55:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26256 states to 26256 states and 144904 transitions. [2022-03-15 20:55:26,011 INFO L78 Accepts]: Start accepts. Automaton has 26256 states and 144904 transitions. Word has length 20 [2022-03-15 20:55:26,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:55:26,011 INFO L470 AbstractCegarLoop]: Abstraction has 26256 states and 144904 transitions. [2022-03-15 20:55:26,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 26256 states and 144904 transitions. [2022-03-15 20:55:26,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:55:26,085 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:55:26,085 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:55:26,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 20:55:26,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:55:26,412 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:55:26,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:55:26,413 INFO L85 PathProgramCache]: Analyzing trace with hash 941915604, now seen corresponding path program 9 times [2022-03-15 20:55:26,442 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:55:26,442 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603906464] [2022-03-15 20:55:26,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:55:26,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:55:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:55:26,493 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:55:26,493 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:55:26,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603906464] [2022-03-15 20:55:26,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603906464] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:55:26,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888167488] [2022-03-15 20:55:26,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:55:26,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:55:26,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:55:26,495 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:55:26,495 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:55:26,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 20:55:26,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:55:26,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:55:26,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:55:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:55:26,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:55:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:55:26,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888167488] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:55:26,704 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:55:26,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-03-15 20:55:26,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1500991618] [2022-03-15 20:55:26,705 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:55:26,706 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:55:26,721 INFO L252 McrAutomatonBuilder]: Finished intersection with 206 states and 548 transitions. [2022-03-15 20:55:26,722 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:55:30,627 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [516746#(or (<= n (* x2 4)) (< (* x1 4) n) (<= n (* 2 x1)) (< (* x2 8) n)), 516734#(or (<= n (* x2 4)) (<= n x1) (< (* 2 x1) n) (< (* x2 8) n)), 516736#(or (< (* 16 x2) n) (< x1 n) (<= n (* x2 8))), 516730#(or (<= n x1) (< (* x2 4) n) (< (* 2 x1) n) (<= n (* 2 x2))), 516741#(or (< (* 16 x2) n) (not (< x1 n)) (< (* 2 x1) n) (<= n (* x2 8))), 516720#(or (not (< x1 n)) (< (* 2 x1) n)), 516722#(or (not (< x1 n)) (< x2 n) (< (* 2 x1) n)), 516729#(or (< x1 n) (<= (+ n 4) (* 2 x2))), 516732#(or (<= n (* x2 4)) (< (* x2 8) n)), 516747#(or (< (* 16 x2) n) (< (* x1 4) n) (<= n (* 2 x1)) (<= n (* x2 8))), 516717#(< x2 n), 516743#(or (< (* x1 4) n) (< (* x2 4) n) (<= n (* 2 x1)) (<= n (* 2 x2))), 516738#(or (< (* x1 4) n) (< x2 n) (<= n (* 2 x1))), 516745#(or (< (* x1 4) n) (<= (+ n 4) (* 2 x2)) (not (< (* 2 x1) n))), 516727#(or (< (* x2 4) n) (<= n (* 2 x2))), 516726#(or (<= (+ n 4) x2) (not (< x1 n)) (< (* 2 x1) n)), 516725#(or (<= (+ n 4) x2) (< x1 n)), 516739#(or (< x1 n) (<= (+ n 4) (* x2 4))), 516724#(or (not (< x1 n)) (< (* 2 x2) n) (not (< x2 n)) (< (* 2 x1) n)), 516742#(or (< (* x1 4) n) (< (* 2 x2) n) (<= n x2) (<= n (* 2 x1))), 516723#(or (< (* 2 x2) n) (< x1 n) (not (< x2 n))), 516721#(or (< x1 n) (< x2 n)), 516718#(or (< (* 2 x2) n) (not (< x2 n))), 516731#(or (not (< x1 n)) (<= (+ n 4) (* 2 x2)) (< (* 2 x1) n)), 516748#(or (< (* x1 4) n) (<= (+ n 4) (* x2 4)) (<= n (* 2 x1))), 516728#(or (< x1 n) (< (* x2 4) n) (<= n (* 2 x2))), 516735#(or (< (* 16 x2) n) (<= n (* x2 8))), 516737#(or (< (* x1 4) n) (<= n (* 2 x1))), 516719#(< x1 n), 516733#(or (<= n (* x2 4)) (< x1 n) (< (* x2 8) n)), 516740#(or (not (< x1 n)) (<= (+ n 4) (* x2 4)) (< (* 2 x1) n)), 516744#(or (<= (+ n 4) x2) (< (* x1 4) n) (not (< (* 2 x1) n)))] [2022-03-15 20:55:30,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 20:55:30,627 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:55:30,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 20:55:30,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=2010, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 20:55:30,628 INFO L87 Difference]: Start difference. First operand 26256 states and 144904 transitions. Second operand has 41 states, 41 states have (on average 5.317073170731708) internal successors, (218), 40 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have 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:55:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:55:39,926 INFO L93 Difference]: Finished difference Result 91716 states and 447655 transitions. [2022-03-15 20:55:39,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2022-03-15 20:55:39,927 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 5.317073170731708) internal successors, (218), 40 states have internal predecessors, (218), 0 states have call successors, (0), 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:55:39,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:55:40,683 INFO L225 Difference]: With dead ends: 91716 [2022-03-15 20:55:40,683 INFO L226 Difference]: Without dead ends: 91450 [2022-03-15 20:55:40,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 166 SyntacticMatches, 18 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11973 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=6066, Invalid=30606, Unknown=0, NotChecked=0, Total=36672 [2022-03-15 20:55:40,685 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 2441 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 4372 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2441 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 4774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 4372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:55:40,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2441 Valid, 1 Invalid, 4774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 4372 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 20:55:40,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91450 states. [2022-03-15 20:55:42,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91450 to 44165. [2022-03-15 20:55:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44165 states, 44164 states have (on average 5.578004709718322) internal successors, (246347), 44164 states have internal predecessors, (246347), 0 states have call successors, (0), 0 states have 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:55:43,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44165 states to 44165 states and 246347 transitions. [2022-03-15 20:55:43,294 INFO L78 Accepts]: Start accepts. Automaton has 44165 states and 246347 transitions. Word has length 20 [2022-03-15 20:55:43,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:55:43,294 INFO L470 AbstractCegarLoop]: Abstraction has 44165 states and 246347 transitions. [2022-03-15 20:55:43,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 5.317073170731708) internal successors, (218), 40 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have 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:55:43,294 INFO L276 IsEmpty]: Start isEmpty. Operand 44165 states and 246347 transitions. [2022-03-15 20:55:43,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:55:43,629 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:55:43,629 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:55:43,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-03-15 20:55:43,841 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,SelfDestructingSolverStorable22 [2022-03-15 20:55:43,842 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:55:43,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:55:43,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1315520095, now seen corresponding path program 9 times [2022-03-15 20:55:43,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:55:43,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216673826] [2022-03-15 20:55:43,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:55:43,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:55:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:55:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:43,906 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:55:43,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216673826] [2022-03-15 20:55:43,907 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216673826] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:55:43,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063802230] [2022-03-15 20:55:43,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:55:43,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:55:43,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:55:43,912 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:55:43,915 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:55:43,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 20:55:43,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:55:43,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:55:43,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:55:44,036 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:44,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:55:44,094 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:44,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063802230] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:55:44,095 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:55:44,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-15 20:55:44,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2035524312] [2022-03-15 20:55:44,095 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:55:44,096 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:55:44,114 INFO L252 McrAutomatonBuilder]: Finished intersection with 249 states and 675 transitions. [2022-03-15 20:55:44,115 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:55:49,270 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 48 new interpolants: [697216#(or (<= n (* 2 x4)) (<= (+ (* x4 4) 1) n)), 697221#(or (<= (+ x4 1) n) (< x3 n)), 697257#(or (<= n (* x4 4)) (<= n (* x3 4)) (< (* x3 8) n) (<= (+ (* x4 8) 1) n)), 697239#(or (<= n (* 2 x3)) (not (< x3 n))), 697248#(or (<= n (* x4 4)) (< (* 2 x3) n) (<= (+ (* x4 8) 1) n) (not (< x3 n))), 697220#(or (<= n (* 2 x3)) (< (* x3 4) n)), 697249#(or (<= n x3) (<= (+ (* x4 8) 1) n)), 697226#(or (<= n (* 2 x3)) (<= (+ (* 2 x4) 1) n) (not (< x4 n)) (< (* x3 4) n)), 697254#(or (<= n (* 2 x3)) (<= (+ (* x4 4) 1) n) (not (< x3 n))), 697232#(or (<= n x4) (< (* 16 x3) n) (<= n (* x3 8)) (<= (+ (* 2 x4) 1) n)), 697225#(or (< (* 2 x3) n) (<= (+ (* 2 x4) 1) n) (not (< x3 n)) (not (< x4 n))), 697241#(or (<= (+ x4 1) n) (<= n (* 2 x3)) (not (< x3 n))), 697262#(or (<= n x3) (<= n (* x3 8)) (<= (+ (* x4 8) 1) n)), 697258#(or (<= n (* x3 4)) (<= (+ (* x4 4) 1) n) (not (< x3 n))), 697260#(or (<= n (* x3 8)) (<= (+ (* x4 4) 1) n) (not (< x3 n))), 697245#(or (<= (+ x4 1) n) (<= n x3) (<= n (* x3 4))), 697237#(or (< (* 16 x3) n) (<= n (* 2 x4)) (<= n (* x3 8)) (<= (+ (* x4 4) 1) n)), 697251#(or (<= n (* x3 8)) (not (< x3 n))), 697233#(or (<= n (* 2 x4)) (< x3 n) (<= (+ (* x4 4) 1) n)), 697231#(or (< (* 16 x3) n) (< x4 n) (<= n (* x3 8))), 697229#(or (<= n x4) (<= n (* x3 4)) (< (* x3 8) n) (<= (+ (* 2 x4) 1) n)), 697235#(or (<= n (* 2 x4)) (<= n (* 2 x3)) (<= (+ (* x4 4) 1) n) (< (* x3 4) n)), 697259#(or (<= n (* x3 4)) (<= (+ (* x4 8) 1) n) (not (< x3 n))), 697228#(or (<= (+ x4 1) n) (<= n (* x3 4)) (< (* x3 8) n)), 697230#(or (< (* 16 x3) n) (<= n (* x3 8))), 697253#(or (<= n x3) (<= n (* x3 8)) (<= (+ (* 2 x4) 1) n)), 697227#(or (<= n (* x3 4)) (< (* x3 8) n)), 697222#(or (<= (+ x4 1) n) (< (* 2 x3) n) (not (< x3 n))), 697223#(or (<= (+ x4 1) n) (<= n (* 2 x3)) (< (* x3 4) n)), 697242#(or (<= n x3) (<= (+ (* 2 x4) 1) n)), 697244#(or (<= n x3) (<= n (* x3 4))), 697250#(or (<= n (* x3 4)) (<= (+ (* 2 x4) 1) n) (not (< x3 n))), 697256#(or (<= n (* 2 x3)) (<= (+ (* x4 8) 1) n) (not (< x3 n))), 697261#(or (<= n (* x4 4)) (< (* 16 x3) n) (<= n (* x3 8)) (<= (+ (* x4 8) 1) n)), 697234#(or (<= n x3) (<= n (* 2 x4)) (<= (+ (* x4 4) 1) n) (< (* 2 x3) n)), 697252#(or (< x4 n) (<= n (* x3 8)) (not (< x3 n))), 697218#(< x3 n), 697217#(or (<= n (* x4 4)) (<= (+ (* x4 8) 1) n)), 697219#(or (< (* 2 x3) n) (not (< x3 n))), 697255#(or (<= n (* x4 4)) (<= n (* 2 x3)) (<= (+ (* x4 8) 1) n) (< (* x3 4) n)), 697215#(or (<= (+ (* 2 x4) 1) n) (not (< x4 n))), 697240#(or (<= (+ x4 1) n) (<= n x3)), 697247#(or (<= n (* x4 4)) (< x3 n) (<= (+ (* x4 8) 1) n)), 697238#(<= n x3), 697243#(or (<= n (* 2 x3)) (<= (+ (* 2 x4) 1) n) (not (< x3 n))), 697224#(or (< x3 n) (<= (+ (* 2 x4) 1) n) (not (< x4 n))), 697246#(or (<= n x3) (<= (+ (* x4 4) 1) n)), 697236#(or (<= n (* x3 4)) (<= n (* 2 x4)) (< (* x3 8) n) (<= (+ (* x4 4) 1) n))] [2022-03-15 20:55:49,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-03-15 20:55:49,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:55:49,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-03-15 20:55:49,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=3180, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 20:55:49,271 INFO L87 Difference]: Start difference. First operand 44165 states and 246347 transitions. Second operand has 58 states, 58 states have (on average 4.5344827586206895) internal successors, (263), 57 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have 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:55:54,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:55:54,133 INFO L93 Difference]: Finished difference Result 87437 states and 465034 transitions. [2022-03-15 20:55:54,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-03-15 20:55:54,134 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 4.5344827586206895) internal successors, (263), 57 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 20:55:54,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:55:54,721 INFO L225 Difference]: With dead ends: 87437 [2022-03-15 20:55:54,721 INFO L226 Difference]: Without dead ends: 87186 [2022-03-15 20:55:54,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 183 SyntacticMatches, 33 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5516 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3742, Invalid=14080, Unknown=0, NotChecked=0, Total=17822 [2022-03-15 20:55:54,722 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 2516 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 646 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2516 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 3137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 646 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:55:54,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2516 Valid, 1 Invalid, 3137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [646 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 20:55:55,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87186 states. [2022-03-15 20:55:57,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87186 to 61031. [2022-03-15 20:55:57,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61031 states, 61030 states have (on average 5.696051122398821) internal successors, (347630), 61030 states have internal predecessors, (347630), 0 states have call successors, (0), 0 states have 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:55:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61031 states to 61031 states and 347630 transitions. [2022-03-15 20:55:58,046 INFO L78 Accepts]: Start accepts. Automaton has 61031 states and 347630 transitions. Word has length 21 [2022-03-15 20:55:58,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:55:58,046 INFO L470 AbstractCegarLoop]: Abstraction has 61031 states and 347630 transitions. [2022-03-15 20:55:58,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 4.5344827586206895) internal successors, (263), 57 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have 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:55:58,047 INFO L276 IsEmpty]: Start isEmpty. Operand 61031 states and 347630 transitions. [2022-03-15 20:55:58,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:55:58,261 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:55:58,261 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:55:58,278 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:55:58,462 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,SelfDestructingSolverStorable23 [2022-03-15 20:55:58,462 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:55:58,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:55:58,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1988316479, now seen corresponding path program 10 times [2022-03-15 20:55:58,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:55:58,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36532969] [2022-03-15 20:55:58,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:55:58,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:55:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:55:58,525 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:58,525 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:55:58,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36532969] [2022-03-15 20:55:58,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36532969] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:55:58,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528349678] [2022-03-15 20:55:58,526 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:55:58,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:55:58,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:55:58,527 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:55:58,527 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:55:58,554 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:55:58,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:55:58,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:55:58,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:55:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:55:58,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:55:58,744 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:55:58,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528349678] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:55:58,744 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:55:58,744 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2022-03-15 20:55:58,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [336215601] [2022-03-15 20:55:58,744 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:55:58,746 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:55:59,000 INFO L252 McrAutomatonBuilder]: Finished intersection with 229 states and 611 transitions. [2022-03-15 20:55:59,000 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:56:03,445 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 41 new interpolants: [907047#(or (< (* 2 x4) n) (not (< x4 n))), 907076#(or (<= n (* 2 x4)) (<= n (* 2 x3)) (< (* x4 4) n) (< (* x3 4) n)), 907075#(or (< (* 2 x4) n) (<= n (* 2 x3)) (not (< x4 n)) (< (* x3 4) n)), 907074#(or (< x4 n) (<= n (* 2 x3)) (< (* x3 4) n)), 907069#(or (< (* 2 x3) n) (not (< x3 n)) (<= (+ n 12) (* x4 4))), 907084#(or (not (< (* 2 x3) n)) (not (< x3 n)) (<= (+ (* x3 4) 12) (* 16 x4))), 907079#(or (<= n (* x4 4)) (<= n (* 2 x3)) (< (* x4 8) n) (< (* x3 4) n)), 907080#(or (not (< (* 2 x3) n)) (<= (+ n 12) (* x4 4)) (< (* x3 4) n)), 907055#(or (<= n (* 2 x4)) (< (* x4 4) n)), 907066#(or (<= n (* 2 x4)) (< (* 2 x3) n) (not (< x3 n)) (< (* x4 4) n)), 907057#(or (<= n (* x4 8)) (< (* 16 x4) n)), 907065#(or (< (* 32 x4) n) (<= n (* 16 x4)) (< x3 n)), 907073#(or (<= (+ (* 2 x3) 12) (* 16 x4)) (not (< x3 n))), 907062#(or (< x3 n) (<= (+ n 12) (* x4 4))), 907061#(or (< x3 n) (<= (+ n 12) (* 2 x4))), 907045#(< x4 n), 907054#(or (<= n (* 2 x3)) (< (* x3 4) n)), 907056#(or (<= n (* x4 4)) (< (* x4 8) n)), 907051#(or (< x4 n) (< (* 2 x3) n) (not (< x3 n))), 907082#(or (not (< (* 2 x3) n)) (<= (+ n 12) (* x4 8)) (< (* x3 4) n)), 907048#(or (< (* 2 x4) n) (< x3 n) (not (< x4 n))), 907078#(or (not (< (* 2 x3) n)) (<= (+ n 12) (* 2 x4)) (< (* x3 4) n)), 907063#(or (<= n (* x4 8)) (< x3 n) (< (* 16 x4) n)), 907083#(or (< (* 32 x4) n) (<= n (* 16 x4)) (<= n (* 2 x3)) (< (* x3 4) n)), 907053#(or (<= (+ n 12) x4) (< (* 2 x3) n) (not (< x3 n))), 907049#(or (<= (+ n 12) x4) (< x3 n)), 907077#(or (not (< (* 2 x3) n)) (<= (+ n 12) x4) (< (* x3 4) n)), 907081#(or (<= n (* x4 8)) (<= n (* 2 x3)) (< (* 16 x4) n) (< (* x3 4) n)), 907064#(or (<= (+ n 12) (* x4 8)) (< x3 n)), 907067#(or (< (* 2 x3) n) (<= (+ n 12) (* 2 x4)) (not (< x3 n))), 907071#(or (<= (+ n 12) (* x4 8)) (< (* 2 x3) n) (not (< x3 n))), 907070#(or (<= n x3) (<= n (* x4 8)) (< (* 2 x3) n) (< (* 16 x4) n)), 907072#(or (< (* 32 x4) n) (<= n x3) (<= n (* 16 x4)) (< (* 2 x3) n)), 907044#(< x3 n), 907046#(or (< x4 n) (< x3 n)), 907050#(or (< (* 2 x3) n) (not (< x3 n))), 907052#(or (< (* 2 x4) n) (< (* 2 x3) n) (not (< x3 n)) (not (< x4 n))), 907059#(or (<= n (* 2 x4)) (< x3 n) (< (* x4 4) n)), 907060#(or (<= n (* x4 4)) (< x3 n) (< (* x4 8) n)), 907058#(or (< (* 32 x4) n) (<= n (* 16 x4))), 907068#(or (<= n x3) (<= n (* x4 4)) (< (* x4 8) n) (< (* 2 x3) n))] [2022-03-15 20:56:03,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 20:56:03,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:56:03,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 20:56:03,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=2962, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 20:56:03,446 INFO L87 Difference]: Start difference. First operand 61031 states and 347630 transitions. Second operand has 51 states, 51 states have (on average 4.607843137254902) internal successors, (235), 50 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have 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:56:20,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:56:20,935 INFO L93 Difference]: Finished difference Result 178373 states and 913144 transitions. [2022-03-15 20:56:20,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2022-03-15 20:56:20,936 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 4.607843137254902) internal successors, (235), 50 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 20:56:20,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:56:23,775 INFO L225 Difference]: With dead ends: 178373 [2022-03-15 20:56:23,776 INFO L226 Difference]: Without dead ends: 174384 [2022-03-15 20:56:23,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 175 SyntacticMatches, 24 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26725 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=11550, Invalid=64902, Unknown=0, NotChecked=0, Total=76452 [2022-03-15 20:56:23,781 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 3777 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 6237 mSolverCounterSat, 686 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3777 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 6923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 686 IncrementalHoareTripleChecker+Valid, 6237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:56:23,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3777 Valid, 1 Invalid, 6923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [686 Valid, 6237 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-03-15 20:56:24,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174384 states. [2022-03-15 20:56:27,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174384 to 71021. [2022-03-15 20:56:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71021 states, 71020 states have (on average 5.748155449169248) internal successors, (408234), 71020 states have internal predecessors, (408234), 0 states have call successors, (0), 0 states have 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:56:28,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71021 states to 71021 states and 408234 transitions. [2022-03-15 20:56:28,912 INFO L78 Accepts]: Start accepts. Automaton has 71021 states and 408234 transitions. Word has length 21 [2022-03-15 20:56:28,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:56:28,912 INFO L470 AbstractCegarLoop]: Abstraction has 71021 states and 408234 transitions. [2022-03-15 20:56:28,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 4.607843137254902) internal successors, (235), 50 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have 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:56:28,913 INFO L276 IsEmpty]: Start isEmpty. Operand 71021 states and 408234 transitions. [2022-03-15 20:56:29,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:56:29,424 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:56:29,424 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:56:29,440 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:56:29,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:56:29,625 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:56:29,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:56:29,626 INFO L85 PathProgramCache]: Analyzing trace with hash 552739484, now seen corresponding path program 10 times [2022-03-15 20:56:29,627 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:56:29,627 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9989097] [2022-03-15 20:56:29,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:56:29,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:56:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:56:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:56:29,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:56:29,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9989097] [2022-03-15 20:56:29,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9989097] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:56:29,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523925431] [2022-03-15 20:56:29,689 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:56:29,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:56:29,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:56:29,691 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:56:29,691 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:56:29,715 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:56:29,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:56:29,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:56:29,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:56:29,817 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:56:29,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:56:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:56:29,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523925431] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:56:29,882 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:56:29,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-15 20:56:29,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1146274404] [2022-03-15 20:56:29,882 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:56:29,883 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:56:29,901 INFO L252 McrAutomatonBuilder]: Finished intersection with 249 states and 675 transitions. [2022-03-15 20:56:29,901 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:56:35,388 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 43 new interpolants: [1228089#(or (<= n (* x2 4)) (< x1 n) (< (* x2 8) n)), 1228079#(or (<= n (* x1 4)) (< x2 n) (<= (+ (* x1 8) 1) n)), 1228110#(or (not (< (* 2 x2) n)) (< (* x2 4) n) (<= (+ (* x1 8) 1) n)), 1228093#(or (< (* 16 x2) n) (<= n (* x2 8))), 1228098#(or (<= (+ (* 2 x1) 1) n) (< x2 n)), 1228072#(or (< x1 n) (< x2 n)), 1228103#(or (<= (+ (* x1 4) 1) n) (< (* x2 4) n) (<= n (* 2 x2))), 1228106#(or (< (* 16 x2) n) (<= (+ (* 2 x1) 1) n) (<= n (* x2 8))), 1228091#(or (<= n (* x2 4)) (< (* x1 4) n) (<= n (* 2 x1)) (< (* x2 8) n)), 1228084#(or (< x1 n) (< (* x2 4) n) (<= n (* 2 x2))), 1228088#(or (<= n (* x2 4)) (< (* x2 8) n)), 1228107#(or (< (* 16 x2) n) (<= (+ (* x1 4) 1) n) (<= n (* x2 8))), 1228070#(< x2 n), 1228090#(or (<= n (* x2 4)) (<= n x1) (< (* 2 x1) n) (< (* x2 8) n)), 1228077#(or (not (< x1 n)) (<= (+ (* 2 x1) 1) n) (< x2 n)), 1228100#(or (<= (+ (* 2 x1) 1) n) (not (< (* 2 x2) n)) (< (* x2 4) n)), 1228082#(or (< (* 2 x2) n) (<= n (* x1 4)) (<= (+ (* x1 8) 1) n) (<= n x2)), 1228095#(or (< (* 16 x2) n) (not (< x1 n)) (< (* 2 x1) n) (<= n (* x2 8))), 1228085#(or (not (< x1 n)) (< (* x2 4) n) (< (* 2 x1) n) (<= n (* 2 x2))), 1228071#(or (< (* 2 x2) n) (not (< x2 n))), 1228081#(or (< (* 2 x2) n) (<= (+ (* x1 4) 1) n) (not (< x2 n)) (<= n (* 2 x1))), 1228092#(or (<= n (* x2 4)) (< (* x1 8) n) (<= n (* x1 4)) (< (* x2 8) n)), 1228112#(or (< (* 16 x2) n) (not (< (* x2 8) n)) (<= (+ (* x1 8) 1) n)), 1228102#(or (< (* 2 x2) n) (<= (+ (* x1 4) 1) n) (not (< x2 n))), 1228097#(or (< (* 16 x2) n) (< (* x1 8) n) (<= n (* x1 4)) (<= n (* x2 8))), 1228111#(or (not (< (* x2 4) n)) (<= (+ (* x1 8) 1) n) (< (* x2 8) n)), 1228108#(or (< x2 n) (<= (+ (* x1 8) 1) n)), 1228105#(or (<= n (* x2 4)) (<= (+ (* x1 4) 1) n) (< (* x2 8) n)), 1228087#(or (< (* x1 8) n) (<= n (* x1 4)) (< (* x2 4) n) (<= n (* 2 x2))), 1228083#(or (< (* x2 4) n) (<= n (* 2 x2))), 1228078#(or (<= (+ (* x1 4) 1) n) (< x2 n) (<= n (* 2 x1))), 1228094#(or (< (* 16 x2) n) (< x1 n) (<= n (* x2 8))), 1228073#(or (< (* 2 x2) n) (< x1 n) (not (< x2 n))), 1228076#(or (<= n (* x1 4)) (<= (+ (* x1 8) 1) n)), 1228104#(or (<= n (* x2 4)) (<= (+ (* 2 x1) 1) n) (< (* x2 8) n)), 1228080#(or (not (< x1 n)) (<= (+ (* 2 x1) 1) n) (< (* 2 x2) n) (not (< x2 n))), 1228101#(or (<= (+ (* x1 4) 1) n) (< x2 n)), 1228109#(or (< (* 2 x2) n) (not (< x2 n)) (<= (+ (* x1 8) 1) n)), 1228096#(or (< (* 16 x2) n) (< (* x1 4) n) (<= n (* 2 x1)) (<= n (* x2 8))), 1228074#(or (not (< x1 n)) (<= (+ (* 2 x1) 1) n)), 1228086#(or (< (* x1 4) n) (< (* x2 4) n) (<= n (* 2 x1)) (<= n (* 2 x2))), 1228075#(or (<= (+ (* x1 4) 1) n) (<= n (* 2 x1))), 1228099#(or (<= (+ (* 2 x1) 1) n) (< (* 2 x2) n) (not (< x2 n)))] [2022-03-15 20:56:35,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-03-15 20:56:35,388 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:56:35,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-03-15 20:56:35,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=2734, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 20:56:35,389 INFO L87 Difference]: Start difference. First operand 71021 states and 408234 transitions. Second operand has 53 states, 53 states have (on average 5.0) internal successors, (265), 52 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have 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:56:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:56:41,698 INFO L93 Difference]: Finished difference Result 136997 states and 754212 transitions. [2022-03-15 20:56:41,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-03-15 20:56:41,698 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 5.0) internal successors, (265), 52 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 20:56:41,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:56:42,990 INFO L225 Difference]: With dead ends: 136997 [2022-03-15 20:56:42,990 INFO L226 Difference]: Without dead ends: 136997 [2022-03-15 20:56:42,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 185 SyntacticMatches, 36 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6314 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3723, Invalid=16299, Unknown=0, NotChecked=0, Total=20022 [2022-03-15 20:56:42,991 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 3008 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 2522 mSolverCounterSat, 761 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3008 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 3283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 761 IncrementalHoareTripleChecker+Valid, 2522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:56:42,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3008 Valid, 1 Invalid, 3283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [761 Valid, 2522 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 20:56:43,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136997 states. [2022-03-15 20:56:47,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136997 to 95962. [2022-03-15 20:56:47,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95962 states, 95961 states have (on average 5.813788935088213) internal successors, (557897), 95961 states have internal predecessors, (557897), 0 states have call successors, (0), 0 states have 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:56:48,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95962 states to 95962 states and 557897 transitions. [2022-03-15 20:56:48,463 INFO L78 Accepts]: Start accepts. Automaton has 95962 states and 557897 transitions. Word has length 21 [2022-03-15 20:56:48,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:56:48,463 INFO L470 AbstractCegarLoop]: Abstraction has 95962 states and 557897 transitions. [2022-03-15 20:56:48,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 5.0) internal successors, (265), 52 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have 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:56:48,464 INFO L276 IsEmpty]: Start isEmpty. Operand 95962 states and 557897 transitions. [2022-03-15 20:56:49,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:56:49,102 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:56:49,102 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:56:49,126 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:56:49,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:56:49,315 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:56:49,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:56:49,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1930128675, now seen corresponding path program 11 times [2022-03-15 20:56:49,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:56:49,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838070995] [2022-03-15 20:56:49,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:56:49,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:56:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:56:49,369 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:56:49,369 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:56:49,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838070995] [2022-03-15 20:56:49,369 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838070995] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:56:49,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155330978] [2022-03-15 20:56:49,370 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:56:49,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:56:49,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:56:49,371 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:56:49,372 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:56:49,397 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 20:56:49,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:56:49,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:56:49,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:56:49,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:56:49,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:56:49,545 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:56:49,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155330978] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:56:49,546 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:56:49,546 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-15 20:56:49,546 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [373417525] [2022-03-15 20:56:49,546 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:56:49,548 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:56:49,566 INFO L252 McrAutomatonBuilder]: Finished intersection with 246 states and 665 transitions. [2022-03-15 20:56:49,566 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:56:54,744 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 45 new interpolants: [1557382#(or (<= n (* x2 4)) (<= n (* x1 8)) (< (* x2 8) n)), 1557361#(or (<= n (* x1 4)) (< x2 n)), 1557362#(or (< (* 2 x2) n) (<= n (* x1 4)) (not (< x2 n))), 1557376#(or (<= n (* x1 8)) (< x2 n)), 1557365#(or (< (* x1 4) n) (< (* x2 4) n) (<= n (* 2 x1)) (<= n (* 2 x2))), 1557370#(or (<= n (* x2 4)) (< (* x1 4) n) (<= n (* 2 x1)) (< (* x2 8) n)), 1557343#(or (< x1 n) (< x2 n)), 1557347#(or (< (* 2 x2) n) (not (< x2 n))), 1557354#(or (< (* 16 x1) n) (<= n (* x1 8))), 1557372#(or (<= n (* x2 4)) (< (* 16 x1) n) (<= n (* x1 8)) (< (* x2 8) n)), 1557352#(or (< (* x1 4) n) (< (* 2 x2) n) (<= n x2) (<= n (* 2 x1))), 1557380#(or (<= n (* x2 4)) (<= n (* 2 x1)) (< (* x2 8) n)), 1557369#(or (<= n (* x2 4)) (<= n x1) (< (* 2 x1) n) (< (* x2 8) n)), 1557353#(or (< (* 2 x2) n) (< (* x1 8) n) (<= n (* x1 4)) (<= n x2)), 1557368#(or (<= n (* x2 4)) (< x1 n) (< (* x2 8) n)), 1557355#(or (< (* 16 x1) n) (<= n (* x1 8)) (< x2 n)), 1557349#(or (<= n (* x2 4)) (< (* x2 8) n)), 1557351#(or (not (< x1 n)) (< (* 2 x2) n) (not (< x2 n)) (< (* 2 x1) n)), 1557367#(or (< (* 16 x1) n) (<= n (* x1 8)) (< (* x2 4) n) (<= n (* 2 x2))), 1557363#(or (< x1 n) (< (* x2 4) n) (<= n (* 2 x2))), 1557350#(or (< (* 2 x2) n) (< x1 n) (not (< x2 n))), 1557359#(or (<= n x1) (< (* 2 x2) n) (not (< x2 n))), 1557344#(or (not (< x1 n)) (< x2 n) (< (* 2 x1) n)), 1557340#(or (< (* x1 4) n) (<= n (* 2 x1))), 1557381#(or (<= n (* x2 4)) (<= n (* x1 4)) (< (* x2 8) n)), 1557378#(or (not (< (* 2 x2) n)) (<= n (* x1 8)) (< (* x2 4) n)), 1557342#(< x2 n), 1557346#(or (< (* x1 8) n) (<= n (* x1 4)) (< x2 n)), 1557379#(or (<= n (* x2 4)) (<= n x1) (< (* x2 8) n)), 1557377#(or (< (* 2 x2) n) (<= n (* x1 8)) (not (< x2 n))), 1557338#(< x1 n), 1557366#(or (< (* x1 8) n) (<= n (* x1 4)) (< (* x2 4) n) (<= n (* 2 x2))), 1557373#(or (<= n x1) (not (< (* 2 x2) n)) (< (* x2 4) n)), 1557358#(or (< x2 n) (<= n (* 2 x1))), 1557374#(or (< (* x2 4) n) (<= n (* 2 x1)) (<= n (* 2 x2))), 1557348#(or (< (* x2 4) n) (<= n (* 2 x2))), 1557341#(or (< (* x1 8) n) (<= n (* x1 4))), 1557339#(or (not (< x1 n)) (< (* 2 x1) n)), 1557375#(or (not (< (* 2 x2) n)) (<= n (* x1 4)) (< (* x2 4) n)), 1557360#(or (< (* 2 x2) n) (not (< x2 n)) (<= n (* 2 x1))), 1557345#(or (< (* x1 4) n) (< x2 n) (<= n (* 2 x1))), 1557364#(or (<= n x1) (< (* x2 4) n) (< (* 2 x1) n) (<= n (* 2 x2))), 1557371#(or (<= n (* x2 4)) (< (* x1 8) n) (<= n (* x1 4)) (< (* x2 8) n)), 1557356#(or (< (* 16 x1) n) (< (* 2 x2) n) (<= n (* x1 8)) (not (< x2 n))), 1557357#(or (<= n x1) (< x2 n))] [2022-03-15 20:56:54,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-15 20:56:54,744 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:56:54,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-15 20:56:54,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=2973, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 20:56:54,745 INFO L87 Difference]: Start difference. First operand 95962 states and 557897 transitions. Second operand has 55 states, 55 states have (on average 5.072727272727272) internal successors, (279), 54 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have 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:57:09,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:57:09,609 INFO L93 Difference]: Finished difference Result 272924 states and 1441323 transitions. [2022-03-15 20:57:09,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 239 states. [2022-03-15 20:57:09,610 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 5.072727272727272) internal successors, (279), 54 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 20:57:09,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:57:12,674 INFO L225 Difference]: With dead ends: 272924 [2022-03-15 20:57:12,675 INFO L226 Difference]: Without dead ends: 272628 [2022-03-15 20:57:12,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 190 SyntacticMatches, 26 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32516 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=13805, Invalid=70005, Unknown=0, NotChecked=0, Total=83810 [2022-03-15 20:57:12,678 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 5581 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 3528 mSolverCounterSat, 714 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5581 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 4242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 714 IncrementalHoareTripleChecker+Valid, 3528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:57:12,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5581 Valid, 1 Invalid, 4242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [714 Valid, 3528 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 20:57:12,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272628 states. [2022-03-15 20:57:21,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272628 to 121594. [2022-03-15 20:57:21,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121594 states, 121593 states have (on average 5.9246913884845345) internal successors, (720401), 121593 states have internal predecessors, (720401), 0 states have call successors, (0), 0 states have 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:57:23,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121594 states to 121594 states and 720401 transitions. [2022-03-15 20:57:23,100 INFO L78 Accepts]: Start accepts. Automaton has 121594 states and 720401 transitions. Word has length 21 [2022-03-15 20:57:23,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:57:23,101 INFO L470 AbstractCegarLoop]: Abstraction has 121594 states and 720401 transitions. [2022-03-15 20:57:23,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 5.072727272727272) internal successors, (279), 54 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have 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:57:23,101 INFO L276 IsEmpty]: Start isEmpty. Operand 121594 states and 720401 transitions. [2022-03-15 20:57:23,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 20:57:23,894 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:57:23,894 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:57:23,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 20:57:24,094 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,SelfDestructingSolverStorable26 [2022-03-15 20:57:24,094 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:57:24,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:57:24,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1865546666, now seen corresponding path program 11 times [2022-03-15 20:57:24,095 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:57:24,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284263045] [2022-03-15 20:57:24,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:57:24,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:57:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:57:24,190 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:57:24,190 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:57:24,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284263045] [2022-03-15 20:57:24,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284263045] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:57:24,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783938014] [2022-03-15 20:57:24,191 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:57:24,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:57:24,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:57:24,193 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:57:24,193 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:57:24,217 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:57:24,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:57:24,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 20:57:24,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:57:24,480 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:57:24,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:57:24,579 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:57:24,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783938014] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:57:24,580 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:57:24,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 5] total 9 [2022-03-15 20:57:24,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1198937221] [2022-03-15 20:57:24,580 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:57:24,581 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:57:24,603 INFO L252 McrAutomatonBuilder]: Finished intersection with 292 states and 802 transitions. [2022-03-15 20:57:24,604 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:57:31,921 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [2074095#(and (= (* x3 4) x4) (= x2 x1)), 2074097#(and (= (* 16 x3) x4) (= x2 x1)), 2074094#(and (= (* 2 x3) x4) (= x2 x1)), 2074096#(and (= (* x3 8) x4) (= x2 x1))] [2022-03-15 20:57:31,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:57:31,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:57:31,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:57:31,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:57:31,922 INFO L87 Difference]: Start difference. First operand 121594 states and 720401 transitions. Second operand has 11 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:57:33,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:57:33,887 INFO L93 Difference]: Finished difference Result 122877 states and 724409 transitions. [2022-03-15 20:57:33,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:57:33,887 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 20:57:33,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:57:35,215 INFO L225 Difference]: With dead ends: 122877 [2022-03-15 20:57:35,215 INFO L226 Difference]: Without dead ends: 122869 [2022-03-15 20:57:35,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 155 SyntacticMatches, 152 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:57:35,216 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:57:35,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 1 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:57:35,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122869 states. [2022-03-15 20:57:39,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122869 to 121927. [2022-03-15 20:57:40,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121927 states, 121926 states have (on average 5.920328723980119) internal successors, (721842), 121926 states have internal predecessors, (721842), 0 states have call successors, (0), 0 states have 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:57:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121927 states to 121927 states and 721842 transitions. [2022-03-15 20:57:41,441 INFO L78 Accepts]: Start accepts. Automaton has 121927 states and 721842 transitions. Word has length 22 [2022-03-15 20:57:41,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:57:41,441 INFO L470 AbstractCegarLoop]: Abstraction has 121927 states and 721842 transitions. [2022-03-15 20:57:41,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:57:41,441 INFO L276 IsEmpty]: Start isEmpty. Operand 121927 states and 721842 transitions. [2022-03-15 20:57:41,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 20:57:41,855 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:57:41,855 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:57:41,871 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:57:42,056 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,SelfDestructingSolverStorable27 [2022-03-15 20:57:42,056 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:57:42,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:57:42,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1680478710, now seen corresponding path program 12 times [2022-03-15 20:57:42,057 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:57:42,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388465867] [2022-03-15 20:57:42,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:57:42,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:57:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:57:42,124 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:57:42,124 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:57:42,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388465867] [2022-03-15 20:57:42,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388465867] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:57:42,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121434466] [2022-03-15 20:57:42,124 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:57:42,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:57:42,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:57:42,125 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:57:42,126 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:57:42,153 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 20:57:42,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:57:42,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:57:42,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:57:42,715 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-03-15 20:57:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:57:42,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:57:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:57:42,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121434466] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:57:42,891 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:57:42,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-03-15 20:57:42,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [48247732] [2022-03-15 20:57:42,892 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:57:42,893 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:57:42,914 INFO L252 McrAutomatonBuilder]: Finished intersection with 282 states and 770 transitions. [2022-03-15 20:57:42,914 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:57:49,526 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 52 new interpolants: [2440986#(or (< (* 2 x4) n) (not (< x4 n))), 2441030#(or (<= n x4) (< (* 2 x4) n) (<= n (* x3 4)) (< (* x3 8) n)), 2441032#(or (<= n (* x4 4)) (<= n (* x3 4)) (< (* x3 8) n) (< (* x4 8) n)), 2441008#(or (< x4 n) (<= (+ (* 2 x3) 9) n)), 2440991#(or (<= n (* x4 4)) (< x3 n) (< (* x4 8) n)), 2441011#(or (<= n (* x4 4)) (< (* x4 8) n) (<= (+ (* 2 x3) 9) n)), 2440988#(or (<= n (* 2 x4)) (< (* x4 4) n)), 2440996#(or (<= n x3) (<= n (* x4 4)) (< (* x4 8) n) (< (* 2 x3) n)), 2440989#(or (<= n (* 2 x4)) (< x3 n) (< (* x4 4) n)), 2441017#(or (< (* 2 x4) n) (<= n (* 2 x3)) (not (< x4 n)) (< (* x3 4) n)), 2440998#(or (< x4 n) (<= (+ 9 x3) n)), 2441019#(or (<= n (* x4 4)) (<= n (* 2 x3)) (< (* x4 8) n) (< (* x3 4) n)), 2441012#(or (<= n x3) (<= n (* x4 8)) (< (* 2 x3) n) (< (* 16 x4) n)), 2441016#(or (< x4 n) (<= n (* 2 x3)) (< (* x3 4) n)), 2441004#(or (<= n (* x4 8)) (<= (+ 9 x3) n) (< (* 16 x4) n)), 2441018#(or (<= n (* 2 x4)) (<= n (* 2 x3)) (< (* x4 4) n) (< (* x3 4) n)), 2440993#(or (< x4 n) (< (* 2 x3) n) (not (< x3 n))), 2440994#(or (< (* 2 x4) n) (< (* 2 x3) n) (not (< x3 n)) (not (< x4 n))), 2441022#(or (< x4 n) (<= (+ (* x3 4) 9) n)), 2440984#(< x4 n), 2441023#(or (< (* 2 x4) n) (<= (+ (* x3 4) 9) n) (not (< x4 n))), 2440990#(or (<= n (* x4 4)) (< (* x4 8) n)), 2441002#(or (<= n (* x4 8)) (< (* 16 x4) n)), 2441031#(or (<= n (* x3 4)) (<= n (* 2 x4)) (< (* x3 8) n) (< (* x4 4) n)), 2441013#(or (<= n (* x4 8)) (< (* 16 x4) n) (<= (+ (* 2 x3) 9) n)), 2441027#(or (< (* 32 x4) n) (<= (+ (* x3 4) 9) n) (not (< (* 16 x4) n))), 2441034#(or (< (* 32 x4) n) (<= n (* 16 x4)) (<= n (* x3 4)) (< (* x3 8) n)), 2441033#(or (<= n (* x3 4)) (<= n (* x4 8)) (< (* x3 8) n) (< (* 16 x4) n)), 2441029#(or (<= n (* x3 4)) (< x4 n) (< (* x3 8) n)), 2441024#(or (not (< (* 2 x4) n)) (<= (+ (* x3 4) 9) n) (< (* x4 4) n)), 2441015#(or (< (* 32 x4) n) (<= n (* 16 x4)) (<= (+ (* 2 x3) 9) n)), 2441014#(or (< (* 32 x4) n) (<= n x3) (<= n (* 16 x4)) (< (* 2 x3) n)), 2440987#(or (< (* 2 x4) n) (< x3 n) (not (< x4 n))), 2441028#(or (<= n (* x3 4)) (< (* x3 8) n)), 2441005#(or (< (* 32 x4) n) (<= n (* 16 x4))), 2441001#(or (<= n (* x4 4)) (< (* x4 8) n) (<= (+ 9 x3) n)), 2441006#(or (< (* 32 x4) n) (<= n (* 16 x4)) (< x3 n)), 2441020#(or (<= n (* x4 8)) (<= n (* 2 x3)) (< (* 16 x4) n) (< (* x3 4) n)), 2441021#(or (< (* 32 x4) n) (<= n (* 16 x4)) (<= n (* 2 x3)) (< (* x3 4) n)), 2440992#(or (< (* 2 x3) n) (not (< x3 n))), 2441025#(or (<= (+ (* x3 4) 9) n) (not (< (* x4 4) n)) (< (* x4 8) n)), 2440999#(or (< (* 2 x4) n) (<= (+ 9 x3) n) (not (< x4 n))), 2441026#(or (not (< (* x4 8) n)) (<= (+ (* x3 4) 9) n) (< (* 16 x4) n)), 2441000#(or (not (< (* 2 x4) n)) (<= (+ 9 x3) n) (< (* x4 4) n)), 2441010#(or (not (< (* 2 x4) n)) (< (* x4 4) n) (<= (+ (* 2 x3) 9) n)), 2440930#(< x3 n), 2441003#(or (<= n (* x4 8)) (< x3 n) (< (* 16 x4) n)), 2440997#(or (<= n (* 2 x3)) (< (* x3 4) n)), 2441009#(or (< (* 2 x4) n) (not (< x4 n)) (<= (+ (* 2 x3) 9) n)), 2440995#(or (<= n (* 2 x4)) (< (* 2 x3) n) (not (< x3 n)) (< (* x4 4) n)), 2440985#(or (< x4 n) (< x3 n)), 2441007#(or (< (* 32 x4) n) (<= n (* 16 x4)) (<= (+ 9 x3) n))] [2022-03-15 20:57:49,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 20:57:49,527 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:57:49,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 20:57:49,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=999, Invalid=5321, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 20:57:49,528 INFO L87 Difference]: Start difference. First operand 121927 states and 721842 transitions. Second operand has 63 states, 63 states have (on average 4.666666666666667) internal successors, (294), 62 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have 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:58:07,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:58:07,578 INFO L93 Difference]: Finished difference Result 304510 states and 1723920 transitions. [2022-03-15 20:58:07,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2022-03-15 20:58:07,578 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 4.666666666666667) internal successors, (294), 62 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 20:58:07,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:58:11,040 INFO L225 Difference]: With dead ends: 304510 [2022-03-15 20:58:11,040 INFO L226 Difference]: Without dead ends: 304105 [2022-03-15 20:58:11,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 208 SyntacticMatches, 25 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15333 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=8590, Invalid=39152, Unknown=0, NotChecked=0, Total=47742 [2022-03-15 20:58:11,042 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 4627 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 7735 mSolverCounterSat, 1077 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4627 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 8812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1077 IncrementalHoareTripleChecker+Valid, 7735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:58:11,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4627 Valid, 1 Invalid, 8812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1077 Valid, 7735 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-03-15 20:58:11,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304105 states. [2022-03-15 20:58:22,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304105 to 177749. [2022-03-15 20:58:22,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177749 states, 177748 states have (on average 5.986559623736976) internal successors, (1064099), 177748 states have internal predecessors, (1064099), 0 states have call successors, (0), 0 states have 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:58:24,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177749 states to 177749 states and 1064099 transitions. [2022-03-15 20:58:24,885 INFO L78 Accepts]: Start accepts. Automaton has 177749 states and 1064099 transitions. Word has length 22 [2022-03-15 20:58:24,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:58:24,885 INFO L470 AbstractCegarLoop]: Abstraction has 177749 states and 1064099 transitions. [2022-03-15 20:58:24,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 4.666666666666667) internal successors, (294), 62 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have 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:58:24,885 INFO L276 IsEmpty]: Start isEmpty. Operand 177749 states and 1064099 transitions. [2022-03-15 20:58:25,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 20:58:25,807 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:58:25,807 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:58:25,831 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:58:26,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 20:58:26,023 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:58:26,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:58:26,024 INFO L85 PathProgramCache]: Analyzing trace with hash -562349498, now seen corresponding path program 12 times [2022-03-15 20:58:26,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:58:26,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752353683] [2022-03-15 20:58:26,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:58:26,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:58:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:58:26,106 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:58:26,106 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:58:26,106 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752353683] [2022-03-15 20:58:26,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752353683] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:58:26,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090153105] [2022-03-15 20:58:26,107 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:58:26,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:58:26,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:58:26,108 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:58:26,109 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:58:26,134 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 20:58:26,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:58:26,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 20:58:26,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:58:26,418 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:58:26,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:58:26,519 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:58:26,519 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090153105] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:58:26,520 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:58:26,520 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 5] total 9 [2022-03-15 20:58:26,520 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [377711238] [2022-03-15 20:58:26,520 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:58:26,521 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:58:26,542 INFO L252 McrAutomatonBuilder]: Finished intersection with 292 states and 802 transitions. [2022-03-15 20:58:26,542 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:58:33,528 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [3101458#(and (= x4 x3) (= 0 (+ (* (- 2) x2) x1))), 3101459#(and (= x4 x3) (= (+ x1 (* x2 (- 4))) 0)), 3101461#(and (= x4 x3) (= (+ x1 (* (- 16) x2)) 0)), 3101460#(and (= x4 x3) (= (+ x1 (* x2 (- 8))) 0))] [2022-03-15 20:58:33,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:58:33,529 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:58:33,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:58:33,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:58:33,529 INFO L87 Difference]: Start difference. First operand 177749 states and 1064099 transitions. Second operand has 11 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:58:36,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:58:36,600 INFO L93 Difference]: Finished difference Result 179610 states and 1070618 transitions. [2022-03-15 20:58:36,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:58:36,600 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 20:58:36,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:58:38,450 INFO L225 Difference]: With dead ends: 179610 [2022-03-15 20:58:38,451 INFO L226 Difference]: Without dead ends: 179597 [2022-03-15 20:58:38,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 92 SyntacticMatches, 215 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:58:38,451 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 44 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:58:38,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 1 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:58:39,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179597 states. [2022-03-15 20:58:46,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179597 to 178126. [2022-03-15 20:58:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178126 states, 178125 states have (on average 5.98316350877193) internal successors, (1065751), 178125 states have internal predecessors, (1065751), 0 states have call successors, (0), 0 states have 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:58:48,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178126 states to 178126 states and 1065751 transitions. [2022-03-15 20:58:48,706 INFO L78 Accepts]: Start accepts. Automaton has 178126 states and 1065751 transitions. Word has length 22 [2022-03-15 20:58:48,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:58:48,706 INFO L470 AbstractCegarLoop]: Abstraction has 178126 states and 1065751 transitions. [2022-03-15 20:58:48,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:58:48,707 INFO L276 IsEmpty]: Start isEmpty. Operand 178126 states and 1065751 transitions. [2022-03-15 20:58:49,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 20:58:49,271 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:58:49,271 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:58:49,287 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:58:49,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:58:49,472 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:58:49,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:58:49,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1061982459, now seen corresponding path program 4 times [2022-03-15 20:58:49,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:58:49,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838184052] [2022-03-15 20:58:49,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:58:49,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:58:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:58:49,604 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:58:49,605 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:58:49,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838184052] [2022-03-15 20:58:49,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838184052] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:58:49,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259928528] [2022-03-15 20:58:49,605 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:58:49,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:58:49,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:58:49,606 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:58:49,607 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:58:49,632 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:58:49,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:58:49,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 20:58:49,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:58:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:58:50,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:58:50,428 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:58:50,428 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259928528] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:58:50,428 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:58:50,428 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 12 [2022-03-15 20:58:50,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1081316333] [2022-03-15 20:58:50,429 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:58:50,430 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:58:50,460 INFO L252 McrAutomatonBuilder]: Finished intersection with 391 states and 1150 transitions. [2022-03-15 20:58:50,460 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:59:00,677 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [3637466#(and (= x1 (* 2 x2)) (= (* 2 x4) x3)), 3637467#(and (= (* x2 4) x1) (= (* 2 x4) x3)), 3637476#(and (= (* x1 8) x2) (= (* 2 x3) x4)), 3637470#(and (= (+ (* (- 1) x4) (* 2 x3)) 0) (= x2 x1)), 3637471#(and (= (* 2 x3) x4) (= x1 (* 2 x2))), 3637472#(and (= (* 2 x1) x2) (= (* 2 x3) x4)), 3637475#(and (= x2 (* x1 4)) (= (* 2 x3) x4)), 3637465#(and (= (+ (* (- 1) x4) x3) 0) (= (* x2 4) x1)), 3637474#(and (= x1 (* x2 8)) (= (* 2 x3) x4)), 3637473#(and (= (* 2 x3) x4) (= (* x2 4) x1)), 3637469#(and (= x1 (* x2 8)) (= (* 2 x4) x3)), 3637468#(and (= (+ (* (- 1) x4) x3) 0) (= x1 (* x2 8))), 3637464#(and (= (+ (* (- 1) x4) x3) 0) (= x1 (* 2 x2)))] [2022-03-15 20:59:00,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 20:59:00,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:59:00,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 20:59:00,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:59:00,678 INFO L87 Difference]: Start difference. First operand 178126 states and 1065751 transitions. Second operand has 23 states, 22 states have (on average 7.363636363636363) internal successors, (162), 22 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have 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:59:05,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:59:05,290 INFO L93 Difference]: Finished difference Result 190019 states and 1124625 transitions. [2022-03-15 20:59:05,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:59:05,291 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 7.363636363636363) internal successors, (162), 22 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 20:59:05,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:59:07,125 INFO L225 Difference]: With dead ends: 190019 [2022-03-15 20:59:07,125 INFO L226 Difference]: Without dead ends: 189975 [2022-03-15 20:59:07,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 123 SyntacticMatches, 271 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:59:07,126 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 90 mSDsluCounter, 1942 mSDsCounter, 0 mSdLazyCounter, 5755 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 5755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:59:07,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 1 Invalid, 5755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5755 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 20:59:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189975 states. [2022-03-15 20:59:14,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189975 to 180313. [2022-03-15 20:59:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180313 states, 180312 states have (on average 5.981210346510493) internal successors, (1078484), 180312 states have internal predecessors, (1078484), 0 states have call successors, (0), 0 states have 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:59:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180313 states to 180313 states and 1078484 transitions. [2022-03-15 20:59:18,349 INFO L78 Accepts]: Start accepts. Automaton has 180313 states and 1078484 transitions. Word has length 22 [2022-03-15 20:59:18,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:59:18,350 INFO L470 AbstractCegarLoop]: Abstraction has 180313 states and 1078484 transitions. [2022-03-15 20:59:18,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 7.363636363636363) internal successors, (162), 22 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have 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:59:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand 180313 states and 1078484 transitions. [2022-03-15 20:59:19,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 20:59:19,367 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:59:19,368 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:59:19,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 20:59:19,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:59:19,591 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 20:59:19,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:59:19,591 INFO L85 PathProgramCache]: Analyzing trace with hash -123334426, now seen corresponding path program 5 times [2022-03-15 20:59:19,593 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:59:19,593 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197128958] [2022-03-15 20:59:19,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:59:19,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:59:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:59:19,781 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:59:19,782 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:59:19,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197128958] [2022-03-15 20:59:19,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197128958] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:59:19,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348693827] [2022-03-15 20:59:19,782 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:59:19,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:59:19,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:59:19,792 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:59:19,855 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:59:19,888 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 20:59:19,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:59:19,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 20:59:19,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:59:20,430 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:59:20,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:59:20,925 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:59:20,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348693827] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:59:20,925 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:59:20,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 12 [2022-03-15 20:59:20,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [729648036] [2022-03-15 20:59:20,925 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:59:20,927 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:59:20,977 INFO L252 McrAutomatonBuilder]: Finished intersection with 428 states and 1282 transitions. [2022-03-15 20:59:20,978 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:59:33,972 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [4188274#(and (= x3 (* x4 4)) (= x1 (* 2 x2))), 4188270#(and (<= (* 2 x1) x2) (<= x2 (* 2 x1)) (= (* 2 x4) x3)), 4188273#(and (= (* 2 x1) x2) (= (* x3 4) x4)), 4188267#(and (= (+ (* (- 1) x4) (* x3 4)) 0) (= x2 x1)), 4188268#(and (= (* x3 4) x4) (= x1 (* 2 x2))), 4188265#(and (= (+ (* (- 1) x4) x3) 0) (= (* x2 4) x1)), 4188271#(and (= x1 (* 2 x2)) (= (* 2 x4) x3)), 4188278#(and (= x2 (* x1 4)) (= (* x3 4) x4)), 4188266#(and (= (* 2 x3) x4) (= (* x2 4) x1)), 4188263#(and (= (+ (* (- 1) x4) (* 2 x3)) 0) (= x2 x1)), 4188264#(and (= (* 2 x3) x4) (= x1 (* 2 x2))), 4188272#(and (= (* 2 x1) x2) (= (* 2 x3) x4)), 4188275#(and (= (* x2 4) x1) (= (* 2 x4) x3)), 4188277#(and (= x2 (* x1 4)) (= (* 2 x3) x4)), 4188269#(and (= (* x2 4) x1) (= (* x3 4) x4)), 4188276#(and (= x3 (* x4 4)) (= (* x2 4) x1)), 4188262#(and (= (+ (* (- 1) x4) x3) 0) (= x1 (* 2 x2)))] [2022-03-15 20:59:33,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 20:59:33,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:59:33,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 20:59:33,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:59:33,973 INFO L87 Difference]: Start difference. First operand 180313 states and 1078484 transitions. Second operand has 27 states, 26 states have (on average 7.3076923076923075) internal successors, (190), 26 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have 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:59:40,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:59:40,647 INFO L93 Difference]: Finished difference Result 253540 states and 1470393 transitions. [2022-03-15 20:59:40,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 20:59:40,648 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 7.3076923076923075) internal successors, (190), 26 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 20:59:40,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:59:43,601 INFO L225 Difference]: With dead ends: 253540 [2022-03-15 20:59:43,601 INFO L226 Difference]: Without dead ends: 253444 [2022-03-15 20:59:43,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 162 SyntacticMatches, 265 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:59:43,602 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 125 mSDsluCounter, 2882 mSDsCounter, 0 mSdLazyCounter, 8422 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 8422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:59:43,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 1 Invalid, 8422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8422 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-03-15 20:59:44,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253444 states. [2022-03-15 20:59:55,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253444 to 220130. [2022-03-15 20:59:56,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220130 states, 220129 states have (on average 6.0074956048498835) internal successors, (1322424), 220129 states have internal predecessors, (1322424), 0 states have call successors, (0), 0 states have 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:59:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220130 states to 220130 states and 1322424 transitions. [2022-03-15 20:59:59,834 INFO L78 Accepts]: Start accepts. Automaton has 220130 states and 1322424 transitions. Word has length 22 [2022-03-15 20:59:59,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:59:59,835 INFO L470 AbstractCegarLoop]: Abstraction has 220130 states and 1322424 transitions. [2022-03-15 20:59:59,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 7.3076923076923075) internal successors, (190), 26 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have 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:59:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 220130 states and 1322424 transitions. [2022-03-15 21:00:01,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:00:01,250 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:00:01,250 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:00:01,272 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 21:00:01,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:00:01,463 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:00:01,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:00:01,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1786547803, now seen corresponding path program 6 times [2022-03-15 21:00:01,465 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:00:01,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335128820] [2022-03-15 21:00:01,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:00:01,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:00:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:00:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:00:01,636 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:00:01,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335128820] [2022-03-15 21:00:01,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335128820] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:00:01,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412454902] [2022-03-15 21:00:01,637 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:00:01,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:00:01,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:00:01,638 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:00:01,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 21:00:01,681 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:00:01,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:00:01,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 21:00:01,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:00:02,077 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:00:02,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:00:02,236 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:00:02,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412454902] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:00:02,237 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:00:02,237 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 12 [2022-03-15 21:00:02,237 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [334307878] [2022-03-15 21:00:02,237 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:00:02,238 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:00:02,280 INFO L252 McrAutomatonBuilder]: Finished intersection with 391 states and 1150 transitions. [2022-03-15 21:00:02,280 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:00:14,132 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [4882219#(and (= (+ (* (- 1) x4) x3) 0) (= x1 (* 2 x2))), 4882226#(and (= (* 2 x1) x2) (= (* 2 x3) x4)), 4882225#(and (= (* x3 4) x4) (= x1 (* 2 x2))), 4882224#(and (= (+ (* (- 1) x4) (* x3 4)) 0) (= x2 x1)), 4882229#(and (= (* x3 8) x4) (= x2 x1)), 4882220#(and (= x1 (* 2 x2)) (= (* 2 x4) x3)), 4882222#(and (= (+ (* (- 1) x4) (* 2 x3)) 0) (= x2 x1)), 4882228#(and (= x3 (* x4 8)) (= x1 (* 2 x2))), 4882230#(and (= (* 2 x1) x2) (= (* x3 8) x4)), 4882223#(and (= (* 2 x3) x4) (= x1 (* 2 x2))), 4882231#(and (= (* x3 8) x4) (= x1 (* 2 x2))), 4882227#(and (= (* 2 x1) x2) (= (* x3 4) x4)), 4882221#(and (= x3 (* x4 4)) (= x1 (* 2 x2)))] [2022-03-15 21:00:14,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:00:14,133 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:00:14,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:00:14,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2022-03-15 21:00:14,134 INFO L87 Difference]: Start difference. First operand 220130 states and 1322424 transitions. Second operand has 23 states, 22 states have (on average 7.363636363636363) internal successors, (162), 22 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:00:20,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:00:20,625 INFO L93 Difference]: Finished difference Result 258056 states and 1508598 transitions. [2022-03-15 21:00:20,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 21:00:20,625 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 7.363636363636363) internal successors, (162), 22 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 21:00:20,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:00:25,253 INFO L225 Difference]: With dead ends: 258056 [2022-03-15 21:00:25,253 INFO L226 Difference]: Without dead ends: 258009 [2022-03-15 21:00:25,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 163 SyntacticMatches, 231 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2022-03-15 21:00:25,254 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 110 mSDsluCounter, 2042 mSDsCounter, 0 mSdLazyCounter, 6154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 6154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:00:25,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 1 Invalid, 6154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6154 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 21:00:25,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258009 states. [2022-03-15 21:00:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258009 to 239974. [2022-03-15 21:00:39,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239974 states, 239973 states have (on average 5.96964658524084) internal successors, (1432554), 239973 states have internal predecessors, (1432554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:00:42,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239974 states to 239974 states and 1432554 transitions. [2022-03-15 21:00:42,761 INFO L78 Accepts]: Start accepts. Automaton has 239974 states and 1432554 transitions. Word has length 22 [2022-03-15 21:00:42,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:00:42,762 INFO L470 AbstractCegarLoop]: Abstraction has 239974 states and 1432554 transitions. [2022-03-15 21:00:42,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 7.363636363636363) internal successors, (162), 22 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:00:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 239974 states and 1432554 transitions. [2022-03-15 21:00:43,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:00:43,647 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:00:43,647 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:00:43,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-15 21:00:43,848 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,SelfDestructingSolverStorable32 [2022-03-15 21:00:43,848 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:00:43,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:00:43,848 INFO L85 PathProgramCache]: Analyzing trace with hash -703791189, now seen corresponding path program 13 times [2022-03-15 21:00:43,849 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:00:43,849 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197914729] [2022-03-15 21:00:43,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:00:43,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:00:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:00:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:00:43,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:00:43,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197914729] [2022-03-15 21:00:43,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197914729] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:00:43,920 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229550003] [2022-03-15 21:00:43,920 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:00:43,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:00:43,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:00:43,921 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:00:43,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 21:00:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:00:43,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:00:43,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:00:44,473 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:00:44,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:00:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:00:44,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229550003] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:00:44,596 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:00:44,596 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2022-03-15 21:00:44,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1526344962] [2022-03-15 21:00:44,596 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:00:44,598 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:00:44,619 INFO L252 McrAutomatonBuilder]: Finished intersection with 288 states and 790 transitions. [2022-03-15 21:00:44,620 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:00:51,032 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 50 new interpolants: [5620397#(or (< (* x1 4) n) (not (< (* 2 x1) n)) (<= (+ n 8) x2)), 5620394#(or (< (* x1 4) n) (< (* 2 x2) n) (<= n x2) (<= n (* 2 x1))), 5620427#(or (not (< (* x1 4) n)) (< (* x1 8) n) (<= (+ n 8) x2)), 5620421#(or (<= n (* 16 x2)) (< (* 32 x2) n)), 5620413#(or (< (* 16 x2) n) (< x1 n) (<= n (* x2 8))), 5620404#(or (<= n (* x2 4)) (< x1 n) (< (* x2 8) n)), 5620423#(or (not (< x1 n)) (<= n (* 16 x2)) (< (* 32 x2) n) (< (* 2 x1) n)), 5620387#(or (< x1 n) (< x2 n)), 5620411#(or (< (* x1 4) n) (not (< (* 2 x1) n)) (<= (+ n 8) (* x2 4))), 5620429#(or (<= n (* x2 4)) (< (* x1 8) n) (<= n (* x1 4)) (< (* x2 8) n)), 5620419#(or (< (* x1 8) n) (<= n (* x1 4))), 5620405#(or (<= n (* x2 4)) (<= n x1) (< (* 2 x1) n) (< (* x2 8) n)), 5620388#(or (not (< x1 n)) (< x2 n) (< (* 2 x1) n)), 5620422#(or (< x1 n) (<= n (* 16 x2)) (< (* 32 x2) n)), 5620432#(or (not (< (* x1 4) n)) (< (* x1 8) n) (<= (+ n 8) (* x2 8))), 5620406#(or (< x1 n) (<= (+ n 8) (* x2 4))), 5620389#(or (< (* x1 4) n) (<= n (* 2 x1))), 5620396#(or (not (< x1 n)) (< (* 2 x1) n) (<= (+ n 8) x2)), 5620425#(or (< (* 2 x2) n) (< (* x1 8) n) (<= n (* x1 4)) (<= n x2)), 5620399#(or (< x1 n) (< (* x2 4) n) (<= n (* 2 x2))), 5620416#(or (not (< x1 n)) (< (* 2 x1) n) (<= (+ n 8) (* x2 8))), 5620412#(or (< (* 16 x2) n) (<= n (* x2 8))), 5620393#(or (not (< x1 n)) (< (* 2 x2) n) (not (< x2 n)) (< (* 2 x1) n)), 5620426#(or (< (* x1 8) n) (<= n (* x1 4)) (< (* x2 4) n) (<= n (* 2 x2))), 5620391#(or (< (* 2 x2) n) (not (< x2 n))), 5620386#(< x2 n), 5620385#(or (not (< x1 n)) (< (* 2 x1) n)), 5620431#(or (< (* 16 x2) n) (< (* x1 8) n) (<= n (* x1 4)) (<= n (* x2 8))), 5620417#(or (< (* 16 x2) n) (< (* x1 4) n) (<= n (* 2 x1)) (<= n (* x2 8))), 5620414#(or (< x1 n) (<= (+ n 8) (* x2 8))), 5620390#(or (< (* x1 4) n) (< x2 n) (<= n (* 2 x1))), 5620392#(or (< (* 2 x2) n) (< x1 n) (not (< x2 n))), 5620408#(or (< (* x1 4) n) (< (* x2 4) n) (<= n (* 2 x1)) (<= n (* 2 x2))), 5620420#(or (< (* x1 8) n) (<= n (* x1 4)) (< x2 n)), 5620400#(or (<= (+ n 8) (* 2 x2)) (< x1 n)), 5620424#(or (< (* x1 4) n) (<= n (* 16 x2)) (<= n (* 2 x1)) (< (* 32 x2) n)), 5620433#(or (< (* x1 8) n) (<= n (* x1 4)) (<= n (* 16 x2)) (< (* 32 x2) n)), 5620401#(or (<= n x1) (< (* x2 4) n) (< (* 2 x1) n) (<= n (* 2 x2))), 5620398#(or (< (* x2 4) n) (<= n (* 2 x2))), 5620415#(or (< (* 16 x2) n) (not (< x1 n)) (< (* 2 x1) n) (<= n (* x2 8))), 5620407#(or (not (< x1 n)) (<= (+ n 8) (* x2 4)) (< (* 2 x1) n)), 5620418#(or (< (* x1 4) n) (not (< (* 2 x1) n)) (<= (+ n 8) (* x2 8))), 5620430#(or (< (* x1 8) n) (<= n (* x1 4)) (<= (+ n 8) (* x2 4))), 5620395#(or (< x1 n) (<= (+ n 8) x2)), 5620410#(or (<= n (* x2 4)) (< (* x1 4) n) (<= n (* 2 x1)) (< (* x2 8) n)), 5620403#(or (<= n (* x2 4)) (< (* x2 8) n)), 5620384#(< x1 n), 5620409#(or (<= (+ n 8) (* 2 x2)) (< (* x1 4) n) (not (< (* 2 x1) n))), 5620428#(or (<= (+ n 8) (* 2 x2)) (not (< (* x1 4) n)) (< (* x1 8) n)), 5620402#(or (<= (+ n 8) (* 2 x2)) (not (< x1 n)) (< (* 2 x1) n))] [2022-03-15 21:00:51,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 21:00:51,032 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:00:51,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 21:00:51,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=626, Invalid=4486, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 21:00:51,033 INFO L87 Difference]: Start difference. First operand 239974 states and 1432554 transitions. Second operand has 61 states, 61 states have (on average 5.262295081967213) internal successors, (321), 60 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:01:43,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:01:43,189 INFO L93 Difference]: Finished difference Result 832914 states and 4409440 transitions. [2022-03-15 21:01:43,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 442 states. [2022-03-15 21:01:43,189 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 5.262295081967213) internal successors, (321), 60 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 21:01:43,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:01:54,303 INFO L225 Difference]: With dead ends: 832914 [2022-03-15 21:01:54,304 INFO L226 Difference]: Without dead ends: 824360 [2022-03-15 21:01:54,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 747 GetRequests, 223 SyntacticMatches, 24 SemanticMatches, 500 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103945 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=34878, Invalid=216624, Unknown=0, NotChecked=0, Total=251502 [2022-03-15 21:01:54,313 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 6432 mSDsluCounter, 3264 mSDsCounter, 0 mSdLazyCounter, 12327 mSolverCounterSat, 900 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6432 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 13227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 900 IncrementalHoareTripleChecker+Valid, 12327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:01:54,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6432 Valid, 1 Invalid, 13227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [900 Valid, 12327 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-03-15 21:01:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824360 states.