/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/unroll-2.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:43:16,407 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:43:16,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:43:16,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:43:16,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:43:16,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:43:16,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:43:16,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:43:16,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:43:16,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:43:16,491 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:43:16,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:43:16,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:43:16,493 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:43:16,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:43:16,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:43:16,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:43:16,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:43:16,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:43:16,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:43:16,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:43:16,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:43:16,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:43:16,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:43:16,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:43:16,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:43:16,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:43:16,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:43:16,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:43:16,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:43:16,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:43:16,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:43:16,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:43:16,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:43:16,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:43:16,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:43:16,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:43:16,515 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:43:16,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:43:16,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:43:16,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:43:16,517 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:43:16,543 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:43:16,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:43:16,543 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:43:16,543 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:43:16,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:43:16,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:43:16,544 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:43:16,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:43:16,544 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:43:16,544 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:43:16,544 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:43:16,544 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:43:16,544 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:43:16,545 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:43:16,545 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:43:16,545 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:43:16,545 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:43:16,545 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:43:16,545 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:43:16,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:43:16,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:43:16,545 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:43:16,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:43:16,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:43:16,546 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:43:16,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:43:16,546 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:43:16,546 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:43:16,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:43:16,546 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:43:16,546 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:43:16,546 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:43:16,546 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:43:16,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:43:16,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:43:16,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:43:16,761 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 20:43:16,761 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 20:43:16,762 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/unroll-2.wvr.bpl [2022-03-15 20:43:16,762 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/unroll-2.wvr.bpl' [2022-03-15 20:43:16,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:43:16,786 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 20:43:16,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:43:16,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:43:16,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:43:16,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "unroll-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:43:16" (1/1) ... [2022-03-15 20:43:16,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "unroll-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:43:16" (1/1) ... [2022-03-15 20:43:16,805 INFO L137 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 20:43:16,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:43:16,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:43:16,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:43:16,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:43:16,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "unroll-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:43:16" (1/1) ... [2022-03-15 20:43:16,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "unroll-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:43:16" (1/1) ... [2022-03-15 20:43:16,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "unroll-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:43:16" (1/1) ... [2022-03-15 20:43:16,813 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "unroll-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:43:16" (1/1) ... [2022-03-15 20:43:16,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "unroll-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:43:16" (1/1) ... [2022-03-15 20:43:16,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "unroll-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:43:16" (1/1) ... [2022-03-15 20:43:16,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "unroll-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:43:16" (1/1) ... [2022-03-15 20:43:16,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:43:16,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:43:16,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:43:16,817 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:43:16,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "unroll-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:43:16" (1/1) ... [2022-03-15 20:43:16,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:43:16,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:16,856 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:43:16,873 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:43:16,885 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 20:43:16,885 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 20:43:16,885 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 20:43:16,886 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 20:43:16,886 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 20:43:16,886 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 20:43:16,886 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 20:43:16,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:43:16,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:43:16,887 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:43:16,917 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:43:16,918 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:43:17,017 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:43:17,038 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:43:17,038 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 20:43:17,038 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread1EXIT is neither atomic block end nor error location. [2022-03-15 20:43:17,038 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread2EXIT is neither atomic block end nor error location. [2022-03-15 20:43:17,042 INFO L202 PluginConnector]: Adding new model unroll-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:43:17 BoogieIcfgContainer [2022-03-15 20:43:17,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:43:17,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:43:17,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:43:17,048 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:43:17,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "unroll-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:43:16" (1/2) ... [2022-03-15 20:43:17,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac26ef and model type unroll-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:43:17, skipping insertion in model container [2022-03-15 20:43:17,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "unroll-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:43:17" (2/2) ... [2022-03-15 20:43:17,053 INFO L111 eAbstractionObserver]: Analyzing ICFG unroll-2.wvr.bpl [2022-03-15 20:43:17,056 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:43:17,056 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:43:17,056 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 20:43:17,056 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:43:17,090 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 20:43:17,125 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:43:17,133 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:43:17,133 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 20:43:17,140 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:43:17,151 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 15 transitions, 46 flow [2022-03-15 20:43:17,153 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 15 transitions, 46 flow [2022-03-15 20:43:17,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 20 places, 15 transitions, 46 flow [2022-03-15 20:43:17,170 INFO L129 PetriNetUnfolder]: 2/13 cut-off events. [2022-03-15 20:43:17,170 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 20:43:17,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22 conditions, 13 events. 2/13 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 5 event pairs, 0 based on Foata normal form. 0/10 useless extension candidates. Maximal degree in co-relation 8. Up to 2 conditions per place. [2022-03-15 20:43:17,175 INFO L116 LiptonReduction]: Number of co-enabled transitions 16 [2022-03-15 20:43:17,232 INFO L131 LiptonReduction]: Checked pairs total: 18 [2022-03-15 20:43:17,232 INFO L133 LiptonReduction]: Total number of compositions: 3 [2022-03-15 20:43:17,238 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 13 transitions, 42 flow [2022-03-15 20:43:17,257 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:17,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:17,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-03-15 20:43:17,262 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:17,262 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:17,262 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:17,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:17,265 INFO L85 PathProgramCache]: Analyzing trace with hash 280958049, now seen corresponding path program 1 times [2022-03-15 20:43:17,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:17,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291442301] [2022-03-15 20:43:17,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:17,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:17,372 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:43:17,372 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:17,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291442301] [2022-03-15 20:43:17,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291442301] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:43:17,373 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:43:17,373 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 20:43:17,374 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [878179941] [2022-03-15 20:43:17,374 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:17,376 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:17,392 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 14 transitions. [2022-03-15 20:43:17,392 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:17,492 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:43:17,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:43:17,494 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:17,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:43:17,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:43:17,513 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:17,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:17,532 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2022-03-15 20:43:17,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:43:17,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-03-15 20:43:17,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:17,544 INFO L225 Difference]: With dead ends: 21 [2022-03-15 20:43:17,544 INFO L226 Difference]: Without dead ends: 18 [2022-03-15 20:43:17,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:43:17,549 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:17,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:43:17,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-03-15 20:43:17,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-03-15 20:43:17,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-03-15 20:43:17,571 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 32 transitions. Word has length 8 [2022-03-15 20:43:17,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:17,571 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 32 transitions. [2022-03-15 20:43:17,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 32 transitions. [2022-03-15 20:43:17,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 20:43:17,572 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:17,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:17,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:43:17,572 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:17,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:17,574 INFO L85 PathProgramCache]: Analyzing trace with hash 120508768, now seen corresponding path program 1 times [2022-03-15 20:43:17,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:17,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164919956] [2022-03-15 20:43:17,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:17,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:17,620 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:43:17,620 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:17,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164919956] [2022-03-15 20:43:17,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164919956] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:43:17,621 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:43:17,621 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:43:17,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1433277968] [2022-03-15 20:43:17,621 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:17,622 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:17,627 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2022-03-15 20:43:17,627 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:17,713 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [111#(< i2 (* 2 n)), 113#(< i1 (* 2 n)), 112#(or (< (+ 2 i2) (* 2 n)) (<= (* 2 n) i2)), 114#(or (< i1 (* 2 n)) (<= (* 2 n) i2))] [2022-03-15 20:43:17,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:43:17,717 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:17,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:43:17,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:43:17,718 INFO L87 Difference]: Start difference. First operand 18 states and 32 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:17,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:17,812 INFO L93 Difference]: Finished difference Result 23 states and 39 transitions. [2022-03-15 20:43:17,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 20:43:17,813 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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 9 [2022-03-15 20:43:17,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:17,813 INFO L225 Difference]: With dead ends: 23 [2022-03-15 20:43:17,814 INFO L226 Difference]: Without dead ends: 19 [2022-03-15 20:43:17,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:43:17,815 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 29 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:17,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 1 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:43:17,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-03-15 20:43:17,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-03-15 20:43:17,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. [2022-03-15 20:43:17,820 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 34 transitions. Word has length 9 [2022-03-15 20:43:17,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:17,821 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 34 transitions. [2022-03-15 20:43:17,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:17,821 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 34 transitions. [2022-03-15 20:43:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:43:17,822 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:17,823 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:17,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 20:43:17,824 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:17,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:17,825 INFO L85 PathProgramCache]: Analyzing trace with hash -618683179, now seen corresponding path program 1 times [2022-03-15 20:43:17,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:17,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953244576] [2022-03-15 20:43:17,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:17,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:17,883 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:43:17,883 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:17,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953244576] [2022-03-15 20:43:17,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953244576] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:17,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564210249] [2022-03-15 20:43:17,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:17,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:17,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:17,886 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:43:17,892 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:43:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:17,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 20:43:17,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:17,959 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:43:17,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:18,006 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:43:18,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564210249] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:18,006 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:18,007 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-03-15 20:43:18,007 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [299494164] [2022-03-15 20:43:18,007 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:18,007 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:18,009 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 26 transitions. [2022-03-15 20:43:18,010 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:18,107 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [240#(or (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 232#(< i1 (* 2 n))] [2022-03-15 20:43:18,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:43:18,108 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:18,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:43:18,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-15 20:43:18,112 INFO L87 Difference]: Start difference. First operand 19 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:18,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:18,146 INFO L93 Difference]: Finished difference Result 23 states and 42 transitions. [2022-03-15 20:43:18,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 20:43:18,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 10 [2022-03-15 20:43:18,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:18,147 INFO L225 Difference]: With dead ends: 23 [2022-03-15 20:43:18,147 INFO L226 Difference]: Without dead ends: 23 [2022-03-15 20:43:18,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-15 20:43:18,150 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 11 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:18,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 1 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:43:18,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-03-15 20:43:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-03-15 20:43:18,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:18,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 42 transitions. [2022-03-15 20:43:18,158 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 42 transitions. Word has length 10 [2022-03-15 20:43:18,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:18,159 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 42 transitions. [2022-03-15 20:43:18,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:18,159 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 42 transitions. [2022-03-15 20:43:18,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:43:18,159 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:18,159 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:18,176 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:43:18,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:18,375 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:18,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:18,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2058797056, now seen corresponding path program 2 times [2022-03-15 20:43:18,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:18,378 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499576917] [2022-03-15 20:43:18,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:18,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:18,420 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:43:18,421 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:18,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499576917] [2022-03-15 20:43:18,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499576917] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:18,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369872315] [2022-03-15 20:43:18,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:43:18,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:18,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:18,423 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:43:18,429 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:43:18,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:43:18,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:18,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:43:18,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:18,533 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:43:18,534 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 [2022-03-15 20:43:18,546 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:43:18,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:18,597 INFO L353 Elim1Store]: treesize reduction 10, result has 79.6 percent of original size [2022-03-15 20:43:18,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 11 treesize of output 50 [2022-03-15 20:43:18,658 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:43:18,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369872315] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:18,658 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:18,659 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 7 [2022-03-15 20:43:18,659 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2083874832] [2022-03-15 20:43:18,659 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:18,659 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:18,661 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 33 transitions. [2022-03-15 20:43:18,661 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:18,770 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [381#(= (select f (select f x2)) (select f (select f x1))), 372#(= (select f (select f x2)) (select f x1)), 380#(= (select f (select f x1)) x2), 379#(= (select f x1) x2)] [2022-03-15 20:43:18,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:43:18,770 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:18,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:43:18,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:43:18,771 INFO L87 Difference]: Start difference. First operand 23 states and 42 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:18,845 INFO L93 Difference]: Finished difference Result 71 states and 129 transitions. [2022-03-15 20:43:18,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:43:18,845 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 20:43:18,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:18,846 INFO L225 Difference]: With dead ends: 71 [2022-03-15 20:43:18,846 INFO L226 Difference]: Without dead ends: 68 [2022-03-15 20:43:18,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:43:18,847 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:18,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 1 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:43:18,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-03-15 20:43:18,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 40. [2022-03-15 20:43:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.2564102564102564) internal successors, (88), 39 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:18,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 88 transitions. [2022-03-15 20:43:18,851 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 88 transitions. Word has length 11 [2022-03-15 20:43:18,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:18,851 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 88 transitions. [2022-03-15 20:43:18,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:18,851 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 88 transitions. [2022-03-15 20:43:18,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:43:18,852 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:18,852 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:18,870 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:43:19,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-15 20:43:19,071 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:19,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:19,074 INFO L85 PathProgramCache]: Analyzing trace with hash 602544545, now seen corresponding path program 3 times [2022-03-15 20:43:19,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:19,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712187212] [2022-03-15 20:43:19,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:19,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:19,108 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:19,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712187212] [2022-03-15 20:43:19,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712187212] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:19,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053240944] [2022-03-15 20:43:19,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:43:19,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:19,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:19,109 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:43:19,110 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:43:19,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 20:43:19,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:19,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:43:19,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:19,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:19,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:19,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053240944] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:19,209 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:19,209 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-03-15 20:43:19,209 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1204572185] [2022-03-15 20:43:19,209 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:19,210 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:19,212 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 42 transitions. [2022-03-15 20:43:19,212 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:19,486 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [620#(or (< (+ 2 i2) (* 2 n)) (<= (* 2 n) i2)), 614#(or (<= (* 2 n) i2) (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 617#(or (<= (* 2 n) (+ 2 i2)) (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 612#(or (< i1 (* 2 n)) (<= (* 2 n) i2)), 619#(< i2 (* 2 n)), 618#(or (<= (* 2 n) (+ 2 i2)) (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n))), 610#(< i1 (* 2 n)), 611#(or (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 615#(or (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n))), 613#(or (< i1 (* 2 n)) (<= (* 2 n) (+ 2 i2))), 621#(or (<= (* 2 n) (+ 2 i2)) (< (+ i2 4) (* 2 n))), 616#(or (<= (* 2 n) (+ i1 1)) (<= (* 2 n) i2) (< (+ 2 i1) (* 2 n)))] [2022-03-15 20:43:19,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 20:43:19,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:19,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 20:43:19,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:43:19,487 INFO L87 Difference]: Start difference. First operand 40 states and 88 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:20,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:20,159 INFO L93 Difference]: Finished difference Result 113 states and 249 transitions. [2022-03-15 20:43:20,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 20:43:20,160 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 20:43:20,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:20,161 INFO L225 Difference]: With dead ends: 113 [2022-03-15 20:43:20,161 INFO L226 Difference]: Without dead ends: 104 [2022-03-15 20:43:20,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=644, Invalid=2008, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 20:43:20,162 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 132 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:20,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 1 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:43:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-03-15 20:43:20,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 69. [2022-03-15 20:43:20,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 2.661764705882353) internal successors, (181), 68 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:20,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 181 transitions. [2022-03-15 20:43:20,168 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 181 transitions. Word has length 12 [2022-03-15 20:43:20,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:20,168 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 181 transitions. [2022-03-15 20:43:20,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:20,168 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 181 transitions. [2022-03-15 20:43:20,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:43:20,169 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:20,169 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:20,194 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:43:20,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:20,394 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:20,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:20,394 INFO L85 PathProgramCache]: Analyzing trace with hash 542313013, now seen corresponding path program 4 times [2022-03-15 20:43:20,396 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:20,396 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091163506] [2022-03-15 20:43:20,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:20,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:20,463 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:20,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091163506] [2022-03-15 20:43:20,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091163506] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:20,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181044613] [2022-03-15 20:43:20,463 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:43:20,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:20,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:20,484 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:43:20,484 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:43:20,503 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:43:20,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:20,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:43:20,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:20,539 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:43:20,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:20,587 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:43:20,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181044613] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:20,588 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:20,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-03-15 20:43:20,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1020837327] [2022-03-15 20:43:20,588 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:20,589 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:20,590 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 40 transitions. [2022-03-15 20:43:20,590 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:20,858 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [1020#(or (<= (* 2 n) i2) (<= (+ 3 i2) (* 2 n))), 1011#(or (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 1018#(or (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n)) (<= (+ 3 i2) (* 2 n))), 1014#(or (<= (+ i2 1) (* 2 n)) (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 1016#(or (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n)) (< i2 (* 2 n))), 1008#(< i1 (* 2 n)), 1009#(or (< i1 (* 2 n)) (<= (+ i2 1) (* 2 n))), 1015#(or (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n)) (< i2 (* 2 n))), 1012#(or (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n))), 1010#(or (< i1 (* 2 n)) (<= (+ 3 i2) (* 2 n))), 1013#(or (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n))), 1017#(or (<= (+ 3 i2) (* 2 n)) (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 1019#(or (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n)) (<= (+ 3 i2) (* 2 n)))] [2022-03-15 20:43:20,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 20:43:20,858 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:20,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 20:43:20,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:43:20,859 INFO L87 Difference]: Start difference. First operand 69 states and 181 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:21,658 INFO L93 Difference]: Finished difference Result 156 states and 377 transitions. [2022-03-15 20:43:21,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-15 20:43:21,658 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 20:43:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:21,659 INFO L225 Difference]: With dead ends: 156 [2022-03-15 20:43:21,659 INFO L226 Difference]: Without dead ends: 154 [2022-03-15 20:43:21,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=664, Invalid=3118, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 20:43:21,661 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 131 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:21,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 1 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:43:21,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-03-15 20:43:21,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 101. [2022-03-15 20:43:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 2.69) internal successors, (269), 100 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 269 transitions. [2022-03-15 20:43:21,667 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 269 transitions. Word has length 12 [2022-03-15 20:43:21,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:21,667 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 269 transitions. [2022-03-15 20:43:21,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 269 transitions. [2022-03-15 20:43:21,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:43:21,668 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:21,668 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:21,688 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:43:21,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:21,885 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:21,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:21,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1995471464, now seen corresponding path program 5 times [2022-03-15 20:43:21,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:21,889 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604810791] [2022-03-15 20:43:21,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:21,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:21,928 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:21,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:21,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604810791] [2022-03-15 20:43:21,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604810791] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:21,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530917330] [2022-03-15 20:43:21,929 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:43:21,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:21,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:21,930 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:43:21,931 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:43:21,951 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:43:21,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:21,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:43:21,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:43:21,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:22,041 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:43:22,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530917330] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:22,041 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:22,041 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2022-03-15 20:43:22,041 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1530287218] [2022-03-15 20:43:22,041 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:22,042 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:22,044 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 47 transitions. [2022-03-15 20:43:22,044 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:22,277 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [1484#(< i2 (* 2 n)), 1547#(or (< (+ i1 4) (* 2 n)) (<= (* 2 n) (+ 3 i1))), 1548#(or (<= (* 2 n) i2) (<= (+ i2 1) i1)), 1539#(or (< (+ 2 i2) (* 2 n)) (<= (* 2 n) i2)), 1544#(or (<= (* 2 n) i2) (<= (+ i2 4) (* 2 n))), 1542#(or (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n))), 1546#(or (<= (* 2 n) i2) (<= (+ 2 i2) i1)), 1543#(or (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n))), 1545#(or (<= (* 2 n) i2) (<= (+ 3 i2) i1)), 1540#(< i1 (* 2 n)), 1541#(or (<= (* 2 n) i1) (< (+ i1 1) (* 2 n)))] [2022-03-15 20:43:22,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 20:43:22,278 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:22,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 20:43:22,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-03-15 20:43:22,278 INFO L87 Difference]: Start difference. First operand 101 states and 269 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:23,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:23,598 INFO L93 Difference]: Finished difference Result 233 states and 480 transitions. [2022-03-15 20:43:23,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-15 20:43:23,599 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:43:23,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:23,600 INFO L225 Difference]: With dead ends: 233 [2022-03-15 20:43:23,600 INFO L226 Difference]: Without dead ends: 233 [2022-03-15 20:43:23,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1022, Invalid=4234, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 20:43:23,602 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 195 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:23,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 1 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:43:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-03-15 20:43:23,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 94. [2022-03-15 20:43:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 2.5376344086021505) internal successors, (236), 93 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:23,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 236 transitions. [2022-03-15 20:43:23,608 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 236 transitions. Word has length 13 [2022-03-15 20:43:23,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:23,608 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 236 transitions. [2022-03-15 20:43:23,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 236 transitions. [2022-03-15 20:43:23,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:43:23,609 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:23,609 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:23,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-15 20:43:23,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:23,824 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:23,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:23,824 INFO L85 PathProgramCache]: Analyzing trace with hash -371611903, now seen corresponding path program 6 times [2022-03-15 20:43:23,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:23,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87329803] [2022-03-15 20:43:23,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:23,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:23,878 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:43:23,878 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:23,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87329803] [2022-03-15 20:43:23,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87329803] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:23,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227032152] [2022-03-15 20:43:23,878 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:43:23,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:23,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:23,880 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:43:23,882 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:43:23,910 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 20:43:23,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:23,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 20:43:23,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:23,993 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:43:23,993 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 23 treesize of output 64 [2022-03-15 20:43:24,049 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:43:24,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:24,261 INFO L353 Elim1Store]: treesize reduction 20, result has 91.1 percent of original size [2022-03-15 20:43:24,261 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 19 treesize of output 232 [2022-03-15 20:43:27,088 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:43:27,088 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227032152] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:27,088 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:27,088 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 14 [2022-03-15 20:43:27,089 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1822177047] [2022-03-15 20:43:27,089 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:27,091 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:27,094 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 60 transitions. [2022-03-15 20:43:27,094 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:27,392 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [2173#(= (select f (select f (select f (select f x1)))) (select f (select f x2))), 2174#(= (select f (select f (select f (select f x1)))) (select f (select f (select f (select f x2))))), 2167#(= (select f (select f x1)) x2), 2155#(= (select f (select f (select f (select f x2)))) (select f (select f x1))), 2170#(= (select f (select f x2)) (select f x1)), 2171#(= (select f (select f x2)) (select f (select f x1))), 2166#(= (select f x1) x2), 2168#(= (select f (select f (select f x1))) x2), 2151#(= (select f (select f (select f (select f x2)))) (select f x1)), 2169#(= (select f (select f (select f (select f x1)))) x2), 2172#(= (select f (select f x2)) (select f (select f (select f x1)))), 2159#(= (select f (select f (select f (select f x2)))) (select f (select f (select f x1))))] [2022-03-15 20:43:27,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 20:43:27,392 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:27,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 20:43:27,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:43:27,393 INFO L87 Difference]: Start difference. First operand 94 states and 236 transitions. Second operand has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 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:43:27,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:27,671 INFO L93 Difference]: Finished difference Result 280 states and 609 transitions. [2022-03-15 20:43:27,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:43:27,671 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 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 14 [2022-03-15 20:43:27,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:27,672 INFO L225 Difference]: With dead ends: 280 [2022-03-15 20:43:27,672 INFO L226 Difference]: Without dead ends: 277 [2022-03-15 20:43:27,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:43:27,673 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 55 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:27,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 1 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:43:27,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-03-15 20:43:27,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 158. [2022-03-15 20:43:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.694267515923567) internal successors, (423), 157 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 423 transitions. [2022-03-15 20:43:27,680 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 423 transitions. Word has length 14 [2022-03-15 20:43:27,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:27,680 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 423 transitions. [2022-03-15 20:43:27,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 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:43:27,680 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 423 transitions. [2022-03-15 20:43:27,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:43:27,681 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:27,681 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:27,715 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:43:27,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:27,882 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:27,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:27,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1561026103, now seen corresponding path program 7 times [2022-03-15 20:43:27,883 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:27,883 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127277601] [2022-03-15 20:43:27,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:27,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:27,935 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:27,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127277601] [2022-03-15 20:43:27,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127277601] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:27,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124436331] [2022-03-15 20:43:27,935 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:43:27,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:27,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:27,937 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:43:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:27,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:43:27,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:27,952 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:43:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:43:27,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:28,044 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:43:28,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124436331] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:28,044 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:28,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 11 [2022-03-15 20:43:28,045 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1570893203] [2022-03-15 20:43:28,045 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:28,045 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:28,047 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 54 transitions. [2022-03-15 20:43:28,047 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:28,322 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [2861#(< i2 (* 2 n)), 2869#(or (<= (* 2 n) (+ i1 1)) (< i2 (* 2 n))), 2863#(or (< i2 (* 2 n)) (<= (+ (* 2 n) 2) i1)), 2864#(or (< (+ 2 i2) (* 2 n)) (<= (* 2 n) i2) (<= (+ (* 2 n) 2) i1)), 2867#(or (< i2 (* 2 n)) (<= (* 2 n) i1)), 2870#(or (< (+ 2 i2) (* 2 n)) (<= (* 2 n) (+ i1 1)) (<= (* 2 n) i2)), 2865#(or (< i2 (* 2 n)) (<= (+ (* 2 n) 1) i1)), 2868#(or (< (+ 2 i2) (* 2 n)) (<= (* 2 n) i2) (<= (* 2 n) i1)), 2866#(or (< (+ 2 i2) (* 2 n)) (<= (* 2 n) i2) (<= (+ (* 2 n) 1) i1)), 2862#(or (< (+ 2 i2) (* 2 n)) (<= (* 2 n) i2))] [2022-03-15 20:43:28,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 20:43:28,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:28,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 20:43:28,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-03-15 20:43:28,323 INFO L87 Difference]: Start difference. First operand 158 states and 423 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:28,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:28,562 INFO L93 Difference]: Finished difference Result 206 states and 508 transitions. [2022-03-15 20:43:28,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:43:28,563 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 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:43:28,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:28,564 INFO L225 Difference]: With dead ends: 206 [2022-03-15 20:43:28,564 INFO L226 Difference]: Without dead ends: 197 [2022-03-15 20:43:28,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=319, Invalid=941, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:43:28,565 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 61 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:28,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 1 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:43:28,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-03-15 20:43:28,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 158. [2022-03-15 20:43:28,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.656050955414013) internal successors, (417), 157 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:28,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 417 transitions. [2022-03-15 20:43:28,571 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 417 transitions. Word has length 14 [2022-03-15 20:43:28,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:28,571 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 417 transitions. [2022-03-15 20:43:28,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:28,571 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 417 transitions. [2022-03-15 20:43:28,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:43:28,572 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:28,572 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:28,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 20:43:28,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:28,784 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:28,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:28,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1365676736, now seen corresponding path program 8 times [2022-03-15 20:43:28,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:28,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145375861] [2022-03-15 20:43:28,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:28,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:28,846 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:28,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145375861] [2022-03-15 20:43:28,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145375861] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:28,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705834115] [2022-03-15 20:43:28,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:43:28,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:28,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:28,848 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:43:28,849 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:43:28,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:43:28,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:28,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:43:28,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:28,893 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:28,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:28,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705834115] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:28,977 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:28,977 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-03-15 20:43:28,977 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1739223336] [2022-03-15 20:43:28,977 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:28,978 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:28,981 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 73 transitions. [2022-03-15 20:43:28,981 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:29,406 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [3530#(or (<= (* 2 n) (+ 2 i2)) (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 3531#(or (<= (* 2 n) (+ 2 i2)) (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n))), 3540#(or (< (+ i1 4) (* 2 n)) (<= (* 2 n) (+ i2 4)) (<= (* 2 n) (+ 3 i1))), 3543#(or (<= (* 2 n) (+ 2 i2)) (< (+ i2 4) (* 2 n))), 3544#(or (<= (* 2 n) (+ i2 4)) (< (+ 6 i2) (* 2 n))), 3525#(or (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n))), 3541#(< i2 (* 2 n)), 3524#(or (<= (* 2 n) i2) (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 3536#(or (< i1 (* 2 n)) (<= (* 2 n) (+ i2 4))), 3529#(or (< i1 (* 2 n)) (<= (* 2 n) (+ 2 i2))), 3533#(or (< (+ i1 4) (* 2 n)) (<= (* 2 n) (+ 3 i1))), 3522#(or (< i1 (* 2 n)) (<= (* 2 n) i2)), 3528#(or (<= (* 2 n) i2) (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n))), 3538#(or (<= (* 2 n) (+ i2 4)) (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n))), 3537#(or (<= (* 2 n) (+ i2 4)) (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 3539#(or (<= (* 2 n) (+ i2 4)) (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n))), 3534#(or (< (+ i1 4) (* 2 n)) (<= (* 2 n) (+ 3 i1)) (<= (* 2 n) i2)), 3523#(or (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 3535#(or (< (+ i1 4) (* 2 n)) (<= (* 2 n) (+ 2 i2)) (<= (* 2 n) (+ 3 i1))), 3521#(< i1 (* 2 n)), 3532#(or (<= (* 2 n) (+ 2 i2)) (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n))), 3526#(or (<= (* 2 n) (+ i1 1)) (<= (* 2 n) i2) (< (+ 2 i1) (* 2 n))), 3527#(or (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n))), 3542#(or (< (+ 2 i2) (* 2 n)) (<= (* 2 n) i2))] [2022-03-15 20:43:29,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 20:43:29,413 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:29,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 20:43:29,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1306, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 20:43:29,414 INFO L87 Difference]: Start difference. First operand 158 states and 417 transitions. Second operand has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:33,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:33,235 INFO L93 Difference]: Finished difference Result 774 states and 2213 transitions. [2022-03-15 20:43:33,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-03-15 20:43:33,235 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:43:33,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:33,238 INFO L225 Difference]: With dead ends: 774 [2022-03-15 20:43:33,238 INFO L226 Difference]: Without dead ends: 747 [2022-03-15 20:43:33,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9025 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6113, Invalid=18067, Unknown=0, NotChecked=0, Total=24180 [2022-03-15 20:43:33,242 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 292 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:33,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 1 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:43:33,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-03-15 20:43:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 502. [2022-03-15 20:43:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 3.1956087824351296) internal successors, (1601), 501 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:33,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1601 transitions. [2022-03-15 20:43:33,260 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 1601 transitions. Word has length 15 [2022-03-15 20:43:33,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:33,260 INFO L470 AbstractCegarLoop]: Abstraction has 502 states and 1601 transitions. [2022-03-15 20:43:33,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:33,260 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 1601 transitions. [2022-03-15 20:43:33,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:43:33,262 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:33,263 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:33,278 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:43:33,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 20:43:33,474 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:33,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:33,474 INFO L85 PathProgramCache]: Analyzing trace with hash -501500756, now seen corresponding path program 9 times [2022-03-15 20:43:33,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:33,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001307895] [2022-03-15 20:43:33,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:33,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:33,534 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:33,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001307895] [2022-03-15 20:43:33,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001307895] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:33,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303520514] [2022-03-15 20:43:33,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:43:33,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:33,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:33,536 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:43:33,536 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:43:33,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 20:43:33,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:33,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:43:33,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:33,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:33,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303520514] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:33,673 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:33,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-03-15 20:43:33,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1884123468] [2022-03-15 20:43:33,673 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:33,674 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:33,676 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 69 transitions. [2022-03-15 20:43:33,676 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:34,303 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [5656#(or (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 5666#(or (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n)) (<= (+ 3 i2) (* 2 n))), 5672#(or (< (+ i1 4) (* 2 n)) (<= (* 2 n) (+ 3 i1)) (< i2 (* 2 n))), 5662#(or (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n)) (< i2 (* 2 n))), 5667#(or (< i1 (* 2 n)) (<= (+ 5 i2) (* 2 n))), 5677#(or (< i2 (* 2 n)) (<= (* 2 n) (+ i1 4)) (< (+ 5 i1) (* 2 n))), 5668#(or (<= (+ 5 i2) (* 2 n)) (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 5660#(or (<= (+ i2 1) (* 2 n)) (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 5659#(or (< i1 (* 2 n)) (<= (+ i2 1) (* 2 n))), 5665#(or (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n)) (<= (+ 3 i2) (* 2 n))), 5678#(or (<= (* 2 n) (+ i1 4)) (< (+ 5 i1) (* 2 n)) (<= (+ 3 i2) (* 2 n))), 5657#(or (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n))), 5664#(or (<= (+ 3 i2) (* 2 n)) (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 5669#(or (<= (+ 5 i2) (* 2 n)) (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n))), 5676#(or (<= (* 2 n) (+ i1 4)) (< (+ 5 i1) (* 2 n))), 5674#(or (<= (+ 5 i2) (* 2 n)) (< (+ i1 4) (* 2 n)) (<= (* 2 n) (+ 3 i1))), 5675#(or (<= (* 2 n) i2) (<= (+ 3 i2) (* 2 n))), 5670#(or (<= (+ 5 i2) (* 2 n)) (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n))), 5680#(or (<= (+ 5 i2) (* 2 n)) (<= (* 2 n) (+ 2 i2))), 5658#(or (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n))), 5673#(or (< (+ i1 4) (* 2 n)) (<= (* 2 n) (+ 3 i1)) (<= (+ 3 i2) (* 2 n))), 5671#(or (< (+ i1 4) (* 2 n)) (<= (* 2 n) (+ 3 i1))), 5655#(< i1 (* 2 n)), 5661#(or (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n)) (< i2 (* 2 n))), 5679#(or (<= (+ 5 i2) (* 2 n)) (<= (* 2 n) (+ i1 4)) (< (+ 5 i1) (* 2 n))), 5663#(or (< i1 (* 2 n)) (<= (+ 3 i2) (* 2 n)))] [2022-03-15 20:43:34,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 20:43:34,303 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:34,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 20:43:34,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1383, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:43:34,304 INFO L87 Difference]: Start difference. First operand 502 states and 1601 transitions. Second operand has 36 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 35 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:38,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:38,020 INFO L93 Difference]: Finished difference Result 1159 states and 3246 transitions. [2022-03-15 20:43:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2022-03-15 20:43:38,020 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 35 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:43:38,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:38,025 INFO L225 Difference]: With dead ends: 1159 [2022-03-15 20:43:38,025 INFO L226 Difference]: Without dead ends: 1157 [2022-03-15 20:43:38,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12190 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4546, Invalid=26960, Unknown=0, NotChecked=0, Total=31506 [2022-03-15 20:43:38,031 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 262 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:38,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 1 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:43:38,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2022-03-15 20:43:38,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 714. [2022-03-15 20:43:38,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 713 states have (on average 3.1402524544179524) internal successors, (2239), 713 states have internal predecessors, (2239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:38,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 2239 transitions. [2022-03-15 20:43:38,046 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 2239 transitions. Word has length 15 [2022-03-15 20:43:38,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:38,046 INFO L470 AbstractCegarLoop]: Abstraction has 714 states and 2239 transitions. [2022-03-15 20:43:38,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 35 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:38,046 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 2239 transitions. [2022-03-15 20:43:38,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:43:38,047 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:38,047 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:38,065 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:43:38,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:38,263 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:38,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:38,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1795512887, now seen corresponding path program 10 times [2022-03-15 20:43:38,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:38,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452124253] [2022-03-15 20:43:38,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:38,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:43:38,329 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:38,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452124253] [2022-03-15 20:43:38,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452124253] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:38,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14227433] [2022-03-15 20:43:38,329 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:43:38,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:38,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:38,330 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:43:38,331 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:43:38,353 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:43:38,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:38,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:43:38,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:38,380 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:43:38,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:43:38,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14227433] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:38,469 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:38,469 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-03-15 20:43:38,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [560681270] [2022-03-15 20:43:38,470 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:38,470 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:38,475 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 78 transitions. [2022-03-15 20:43:38,475 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:38,973 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [8660#(or (<= (* 2 n) (+ 2 i2)) (<= (+ 2 i2) i1)), 8664#(or (<= i2 (+ i1 4)) (<= (* 2 n) i1)), 8662#(or (<= (* 2 n) (+ i1 4)) (< (+ 5 i1) (* 2 n))), 8651#(or (<= (* 2 n) i2) (<= (+ 3 i2) i1)), 8646#(or (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 8661#(or (< (+ i1 4) (* 2 n)) (<= (* 2 n) (+ 3 i1))), 8648#(or (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n))), 8658#(or (<= (* 2 n) i2) (<= i2 i1)), 8654#(or (<= (* 2 n) (+ 2 i2)) (<= (+ 5 i2) i1)), 8606#(< i2 (* 2 n)), 8647#(or (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n))), 8655#(or (<= (* 2 n) i2) (<= (+ 2 i2) i1)), 8657#(or (<= (* 2 n) i2) (<= (+ i2 1) i1)), 8656#(or (<= (+ i2 4) i1) (<= (* 2 n) (+ 2 i2))), 8652#(or (<= (* 2 n) (+ 2 i2)) (< (+ i2 4) (* 2 n))), 8649#(or (< (+ 2 i2) (* 2 n)) (<= (* 2 n) i2)), 8653#(or (<= (* 2 n) (+ 2 i2)) (<= (+ 6 i2) (* 2 n))), 8663#(or (< (+ 6 i1) (* 2 n)) (<= (* 2 n) (+ 5 i1))), 8650#(or (<= (* 2 n) i2) (<= (+ i2 4) (* 2 n))), 8659#(or (<= (* 2 n) (+ 2 i2)) (<= (+ 3 i2) i1)), 8645#(< i1 (* 2 n))] [2022-03-15 20:43:38,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 20:43:38,973 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:38,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 20:43:38,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 20:43:38,973 INFO L87 Difference]: Start difference. First operand 714 states and 2239 transitions. Second operand has 30 states, 30 states have (on average 2.2) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:41,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:41,999 INFO L93 Difference]: Finished difference Result 1180 states and 3099 transitions. [2022-03-15 20:43:41,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-03-15 20:43:42,000 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:43:42,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:42,004 INFO L225 Difference]: With dead ends: 1180 [2022-03-15 20:43:42,004 INFO L226 Difference]: Without dead ends: 1180 [2022-03-15 20:43:42,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6401 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3492, Invalid=15968, Unknown=0, NotChecked=0, Total=19460 [2022-03-15 20:43:42,006 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 390 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:42,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [390 Valid, 1 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:43:42,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2022-03-15 20:43:42,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 520. [2022-03-15 20:43:42,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 519 states have (on average 3.02504816955684) internal successors, (1570), 519 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:42,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1570 transitions. [2022-03-15 20:43:42,018 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1570 transitions. Word has length 16 [2022-03-15 20:43:42,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:42,018 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 1570 transitions. [2022-03-15 20:43:42,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.2) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:42,019 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1570 transitions. [2022-03-15 20:43:42,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:43:42,020 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:42,020 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:42,036 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:43:42,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 20:43:42,227 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:42,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:42,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1364953440, now seen corresponding path program 11 times [2022-03-15 20:43:42,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:42,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760526835] [2022-03-15 20:43:42,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:42,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:42,279 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:42,279 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:42,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760526835] [2022-03-15 20:43:42,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760526835] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:42,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697725051] [2022-03-15 20:43:42,280 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:43:42,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:42,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:42,281 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:43:42,282 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:43:42,302 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:43:42,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:42,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 20:43:42,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:42,475 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:43:42,475 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 31 treesize of output 142 [2022-03-15 20:43:42,933 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:42,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:43,556 INFO L353 Elim1Store]: treesize reduction 30, result has 94.3 percent of original size [2022-03-15 20:43:43,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 22 new quantified variables, introduced 66 case distinctions, treesize of input 27 treesize of output 542 [2022-03-15 20:44:41,557 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:41,557 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697725051] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:41,557 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:41,557 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 21 [2022-03-15 20:44:41,557 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [238426152] [2022-03-15 20:44:41,557 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:41,558 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:41,562 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 95 transitions. [2022-03-15 20:44:41,562 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:42,175 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [11222#(= (select f (select f (select f (select f x1)))) (select f (select f x2))), 11219#(= (select f (select f x2)) (select f x1)), 11220#(= (select f (select f x2)) (select f (select f x1))), 11223#(= (select f (select f x2)) (select f (select f (select f (select f (select f x1)))))), 11230#(= (select f (select f (select f (select f x2)))) (select f (select f (select f (select f (select f x1)))))), 11195#(= (select f (select f x1)) (select f (select f (select f (select f (select f (select f x2))))))), 11217#(= (select f (select f (select f (select f x1)))) x2), 11231#(= (select f (select f (select f (select f x2)))) (select f (select f (select f (select f (select f (select f x1))))))), 11218#(= (select f (select f (select f (select f (select f x1))))) x2), 11229#(= (select f (select f (select f (select f x1)))) (select f (select f (select f (select f x2))))), 11203#(= (select f (select f (select f (select f x1)))) (select f (select f (select f (select f (select f (select f x2))))))), 11232#(= (select f (select f (select f (select f (select f (select f x2)))))) (select f (select f (select f (select f (select f (select f x1))))))), 11199#(= (select f (select f (select f x1))) (select f (select f (select f (select f (select f (select f x2))))))), 11225#(= (select f (select f x2)) (select f (select f (select f (select f (select f (select f x1))))))), 11216#(= (select f (select f (select f x1))) x2), 11228#(= (select f (select f (select f (select f x2)))) (select f (select f (select f x1)))), 11226#(= (select f (select f (select f (select f x2)))) (select f x1)), 11215#(= (select f (select f x1)) x2), 11214#(= (select f x1) x2), 11227#(= (select f (select f (select f (select f x2)))) (select f (select f x1))), 11221#(= (select f (select f x2)) (select f (select f (select f x1)))), 11191#(= (select f x1) (select f (select f (select f (select f (select f (select f x2))))))), 11224#(= x2 (select f (select f (select f (select f (select f (select f x1))))))), 11207#(= (select f (select f (select f (select f (select f (select f x2)))))) (select f (select f (select f (select f (select f x1))))))] [2022-03-15 20:44:42,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 20:44:42,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:42,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 20:44:42,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1589, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:44:42,176 INFO L87 Difference]: Start difference. First operand 520 states and 1570 transitions. Second operand has 33 states, 32 states have (on average 2.40625) internal successors, (77), 32 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:42,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:42,800 INFO L93 Difference]: Finished difference Result 1016 states and 2780 transitions. [2022-03-15 20:44:42,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:44:42,800 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.40625) internal successors, (77), 32 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:44:42,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:42,804 INFO L225 Difference]: With dead ends: 1016 [2022-03-15 20:44:42,804 INFO L226 Difference]: Without dead ends: 1013 [2022-03-15 20:44:42,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=1589, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:44:42,804 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 103 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 2019 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:42,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 1 Invalid, 2029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2019 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 20:44:42,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2022-03-15 20:44:42,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 787. [2022-03-15 20:44:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 3.072519083969466) internal successors, (2415), 786 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:42,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 2415 transitions. [2022-03-15 20:44:42,823 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 2415 transitions. Word has length 17 [2022-03-15 20:44:42,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:42,824 INFO L470 AbstractCegarLoop]: Abstraction has 787 states and 2415 transitions. [2022-03-15 20:44:42,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.40625) internal successors, (77), 32 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:42,825 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 2415 transitions. [2022-03-15 20:44:42,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:44:42,826 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:42,826 INFO L514 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:42,842 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:44:43,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 20:44:43,029 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:44:43,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:43,030 INFO L85 PathProgramCache]: Analyzing trace with hash -862097716, now seen corresponding path program 12 times [2022-03-15 20:44:43,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:43,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491606603] [2022-03-15 20:44:43,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:43,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:43,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:43,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491606603] [2022-03-15 20:44:43,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491606603] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:43,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092026985] [2022-03-15 20:44:43,114 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:44:43,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:43,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:43,115 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:44:43,116 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:44:43,141 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 20:44:43,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:43,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:44:43,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:44:43,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:44:43,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092026985] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:43,250 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:43,250 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 15 [2022-03-15 20:44:43,250 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2022347163] [2022-03-15 20:44:43,250 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:43,251 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:43,255 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 87 transitions. [2022-03-15 20:44:43,255 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:43,706 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [13941#(or (<= (* 2 n) (+ i1 1)) (< i2 (* 2 n))), 13943#(or (< (+ 2 i2) (* 2 n)) (<= (* 2 n) i2) (<= (* 2 n) i1)), 13940#(or (< i2 (* 2 n)) (<= (* 2 n) i1)), 13936#(or (< i2 (* 2 n)) (<= (+ (* 2 n) 2) i1)), 13947#(or (<= (* 2 n) (+ 2 i2)) (<= (+ (* 2 n) 1) i1) (< (+ i2 4) (* 2 n))), 13952#(or (<= (* 2 n) (+ 2 i2)) (<= (* 2 n) (+ 2 i1)) (< (+ i2 4) (* 2 n))), 13945#(or (<= (* 2 n) (+ 2 i2)) (< (+ i2 4) (* 2 n))), 13944#(or (< (+ 2 i2) (* 2 n)) (<= (* 2 n) (+ i1 1)) (<= (* 2 n) i2)), 13939#(or (< i2 (* 2 n)) (<= (+ (* 2 n) 1) i1)), 13949#(or (<= (* 2 n) (+ 2 i2)) (<= (* 2 n) (+ i1 1)) (< (+ i2 4) (* 2 n))), 13942#(or (< (+ 2 i2) (* 2 n)) (<= (* 2 n) i2) (<= (+ (* 2 n) 1) i1)), 13951#(or (< (+ 2 i2) (* 2 n)) (<= (* 2 n) i2) (<= (* 2 n) (+ 2 i1))), 13937#(or (< (+ 2 i2) (* 2 n)) (<= (* 2 n) i2)), 13955#(or (<= (* 2 n) (+ 2 i2)) (<= (* 2 n) (+ 3 i1)) (< (+ i2 4) (* 2 n))), 13946#(or (<= (* 2 n) (+ 2 i2)) (<= (+ (* 2 n) 2) i1) (< (+ i2 4) (* 2 n))), 13950#(or (<= (* 2 n) (+ 2 i1)) (< i2 (* 2 n))), 13954#(or (< (+ 2 i2) (* 2 n)) (<= (* 2 n) (+ 3 i1)) (<= (* 2 n) i2)), 13938#(or (< (+ 2 i2) (* 2 n)) (<= (* 2 n) i2) (<= (+ (* 2 n) 2) i1)), 13935#(< i2 (* 2 n)), 13948#(or (<= (* 2 n) (+ 2 i2)) (<= (* 2 n) i1) (< (+ i2 4) (* 2 n))), 13953#(or (<= (* 2 n) (+ 3 i1)) (< i2 (* 2 n)))] [2022-03-15 20:44:43,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 20:44:43,707 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:43,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 20:44:43,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1071, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 20:44:43,708 INFO L87 Difference]: Start difference. First operand 787 states and 2415 transitions. Second operand has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:44,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:44,344 INFO L93 Difference]: Finished difference Result 913 states and 2665 transitions. [2022-03-15 20:44:44,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 20:44:44,344 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:44:44,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:44,349 INFO L225 Difference]: With dead ends: 913 [2022-03-15 20:44:44,349 INFO L226 Difference]: Without dead ends: 888 [2022-03-15 20:44:44,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1255, Invalid=3857, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 20:44:44,358 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 135 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:44,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 1 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:44:44,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2022-03-15 20:44:44,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 787. [2022-03-15 20:44:44,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 3.0419847328244276) internal successors, (2391), 786 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:44,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 2391 transitions. [2022-03-15 20:44:44,388 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 2391 transitions. Word has length 17 [2022-03-15 20:44:44,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:44,389 INFO L470 AbstractCegarLoop]: Abstraction has 787 states and 2391 transitions. [2022-03-15 20:44:44,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:44,389 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 2391 transitions. [2022-03-15 20:44:44,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:44:44,390 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:44,390 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:44,416 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:44:44,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 20:44:44,617 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:44:44,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:44,618 INFO L85 PathProgramCache]: Analyzing trace with hash -635372479, now seen corresponding path program 13 times [2022-03-15 20:44:44,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:44,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498426905] [2022-03-15 20:44:44,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:44,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:44,721 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:44,721 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498426905] [2022-03-15 20:44:44,721 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498426905] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:44,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299836086] [2022-03-15 20:44:44,722 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:44:44,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:44,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:44,723 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:44:44,756 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:44:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:44,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 20:44:44,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:44,791 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:44,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:44,899 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:44,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299836086] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:44,899 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:44,899 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 20 [2022-03-15 20:44:44,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1605840095] [2022-03-15 20:44:44,899 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:44,900 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:44,905 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 112 transitions. [2022-03-15 20:44:44,905 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:46,077 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [16659#(or (<= (* 2 n) (+ i2 4)) (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n))), 16649#(or (< i1 (* 2 n)) (<= (* 2 n) (+ 2 i2))), 16650#(or (< i1 (* 2 n)) (<= (* 2 n) (+ i2 4))), 16636#(< i1 (* 2 n)), 16645#(or (<= (* 2 n) i2) (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n))), 16665#(or (< (+ 6 i1) (* 2 n)) (<= (* 2 n) (+ 2 i2)) (<= (* 2 n) (+ 5 i1))), 16647#(or (<= (* 2 n) i2) (<= (* 2 n) (+ i1 4)) (< (+ 5 i1) (* 2 n))), 16669#(or (< (+ i1 4) (* 2 n)) (<= (* 2 n) (+ 3 i1)) (<= (* 2 n) (+ 6 i2))), 16652#(or (<= (* 2 n) (+ 2 i2)) (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 16670#(or (<= (* 2 n) (+ 6 i2)) (<= (* 2 n) (+ i1 4)) (< (+ 5 i1) (* 2 n))), 16661#(or (< (+ i1 4) (* 2 n)) (<= (* 2 n) (+ i2 4)) (<= (* 2 n) (+ 3 i1))), 16651#(< i2 (* 2 n)), 16662#(or (<= (* 2 n) (+ 2 i2)) (<= (* 2 n) (+ i1 4)) (< (+ 5 i1) (* 2 n))), 16637#(or (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 16654#(or (<= (* 2 n) (+ 2 i2)) (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n))), 16671#(or (< (+ 6 i1) (* 2 n)) (<= (* 2 n) (+ 6 i2)) (<= (* 2 n) (+ 5 i1))), 16658#(or (<= (* 2 n) (+ 2 i2)) (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n))), 16667#(or (<= (* 2 n) (+ i1 1)) (<= (* 2 n) (+ 6 i2)) (< (+ 2 i1) (* 2 n))), 16664#(or (< (+ 6 i1) (* 2 n)) (<= (* 2 n) i2) (<= (* 2 n) (+ 5 i1))), 16648#(or (< (+ 6 i1) (* 2 n)) (<= (* 2 n) (+ 5 i1))), 16675#(or (< (+ i2 8) (* 2 n)) (<= (* 2 n) (+ 6 i2))), 16644#(or (<= (* 2 n) (+ i1 1)) (<= (* 2 n) i2) (< (+ 2 i1) (* 2 n))), 16638#(or (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n))), 16643#(or (<= (* 2 n) i2) (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 16656#(or (< i1 (* 2 n)) (<= (* 2 n) (+ 6 i2))), 16663#(or (<= (* 2 n) (+ i2 4)) (<= (* 2 n) (+ i1 4)) (< (+ 5 i1) (* 2 n))), 16640#(or (< (+ i1 4) (* 2 n)) (<= (* 2 n) (+ 3 i1))), 16657#(or (<= (* 2 n) (+ 6 i2)) (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 16641#(or (<= (* 2 n) (+ i1 4)) (< (+ 5 i1) (* 2 n))), 16666#(or (<= (* 2 n) (+ i2 4)) (< (+ 6 i1) (* 2 n)) (<= (* 2 n) (+ 5 i1))), 16674#(or (<= (* 2 n) (+ i2 4)) (< (+ 6 i2) (* 2 n))), 16642#(or (< i1 (* 2 n)) (<= (* 2 n) i2)), 16668#(or (<= (* 2 n) (+ 2 i1)) (<= (* 2 n) (+ 6 i2)) (< (+ 3 i1) (* 2 n))), 16672#(or (< (+ 2 i2) (* 2 n)) (<= (* 2 n) i2)), 16646#(or (< (+ i1 4) (* 2 n)) (<= (* 2 n) (+ 3 i1)) (<= (* 2 n) i2)), 16673#(or (<= (* 2 n) (+ 2 i2)) (< (+ i2 4) (* 2 n))), 16653#(or (<= (* 2 n) (+ i2 4)) (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 16655#(or (<= (* 2 n) (+ i2 4)) (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n))), 16639#(or (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n))), 16660#(or (< (+ i1 4) (* 2 n)) (<= (* 2 n) (+ 2 i2)) (<= (* 2 n) (+ 3 i1)))] [2022-03-15 20:44:46,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-03-15 20:44:46,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:46,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-03-15 20:44:46,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=3164, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 20:44:46,078 INFO L87 Difference]: Start difference. First operand 787 states and 2391 transitions. Second operand has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:04,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:04,548 INFO L93 Difference]: Finished difference Result 4058 states and 12644 transitions. [2022-03-15 20:45:04,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 412 states. [2022-03-15 20:45:04,548 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 20:45:04,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:04,564 INFO L225 Difference]: With dead ends: 4058 [2022-03-15 20:45:04,565 INFO L226 Difference]: Without dead ends: 3995 [2022-03-15 20:45:04,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 456 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104697 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=58441, Invalid=150865, Unknown=0, NotChecked=0, Total=209306 [2022-03-15 20:45:04,574 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 602 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:04,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [602 Valid, 1 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:45:04,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3995 states. [2022-03-15 20:45:04,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3995 to 2138. [2022-03-15 20:45:04,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2138 states, 2137 states have (on average 3.237716424894712) internal successors, (6919), 2137 states have internal predecessors, (6919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 6919 transitions. [2022-03-15 20:45:04,659 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 6919 transitions. Word has length 18 [2022-03-15 20:45:04,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:04,659 INFO L470 AbstractCegarLoop]: Abstraction has 2138 states and 6919 transitions. [2022-03-15 20:45:04,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:04,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 6919 transitions. [2022-03-15 20:45:04,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:45:04,662 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:04,662 INFO L514 BasicCegarLoop]: trace histogram [7, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:04,703 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:45:04,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 20:45:04,876 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:45:04,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:04,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1611667413, now seen corresponding path program 14 times [2022-03-15 20:45:04,877 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:04,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842170736] [2022-03-15 20:45:04,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:04,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:04,967 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:04,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842170736] [2022-03-15 20:45:04,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842170736] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:04,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002318882] [2022-03-15 20:45:04,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:45:04,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:04,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:04,968 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:45:04,969 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:45:04,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:45:04,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:45:04,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 20:45:04,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:05,040 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:05,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:05,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002318882] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:05,154 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:45:05,154 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 20 [2022-03-15 20:45:05,154 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [670912483] [2022-03-15 20:45:05,155 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:05,156 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:05,161 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 106 transitions. [2022-03-15 20:45:05,161 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:06,418 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 43 new interpolants: [25959#(or (<= (* 2 n) (+ i1 1)) (<= (+ 7 i2) (* 2 n)) (< (+ 2 i1) (* 2 n))), 25938#(or (<= (+ 3 i2) (* 2 n)) (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 25944#(or (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n)) (<= (+ 3 i2) (* 2 n))), 25947#(or (< (+ i1 4) (* 2 n)) (<= (* 2 n) (+ 3 i1)) (<= (+ 3 i2) (* 2 n))), 25943#(or (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n)) (< i2 (* 2 n))), 25951#(or (<= (+ 5 i2) (* 2 n)) (<= (* 2 n) (+ i1 4)) (< (+ 5 i1) (* 2 n))), 25967#(or (<= (+ 5 i2) (* 2 n)) (< (+ 7 i1) (* 2 n)) (<= (* 2 n) (+ 6 i1))), 25960#(or (<= (+ 7 i2) (* 2 n)) (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n))), 25963#(or (< (+ 6 i1) (* 2 n)) (<= (+ 7 i2) (* 2 n)) (<= (* 2 n) (+ 5 i1))), 25966#(or (< (+ 7 i1) (* 2 n)) (<= (+ 3 i2) (* 2 n)) (<= (* 2 n) (+ 6 i1))), 25961#(or (< (+ i1 4) (* 2 n)) (<= (* 2 n) (+ 3 i1)) (<= (+ 7 i2) (* 2 n))), 25934#(or (< i1 (* 2 n)) (<= (+ i2 1) (* 2 n))), 25928#(or (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 25936#(or (< i1 (* 2 n)) (<= (+ 5 i2) (* 2 n))), 25968#(or (< (+ 7 i1) (* 2 n)) (<= (+ 7 i2) (* 2 n)) (<= (* 2 n) (+ 6 i1))), 25930#(or (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n))), 25955#(or (<= (* 2 n) i2) (<= (+ 3 i2) (* 2 n))), 25941#(or (<= (+ 5 i2) (* 2 n)) (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 25948#(or (<= (+ 5 i2) (* 2 n)) (< (+ i1 4) (* 2 n)) (<= (* 2 n) (+ 3 i1))), 25964#(or (< (+ 7 i1) (* 2 n)) (<= (* 2 n) (+ 6 i1))), 25962#(or (<= (+ 7 i2) (* 2 n)) (<= (* 2 n) (+ i1 4)) (< (+ 5 i1) (* 2 n))), 25965#(or (< (+ 7 i1) (* 2 n)) (< i2 (* 2 n)) (<= (* 2 n) (+ 6 i1))), 25937#(or (<= (+ i2 1) (* 2 n)) (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 25942#(or (<= (+ 5 i2) (* 2 n)) (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n))), 25969#(or (<= (* 2 n) (+ i2 4)) (<= (+ 7 i2) (* 2 n))), 25931#(or (< (+ i1 4) (* 2 n)) (<= (* 2 n) (+ 3 i1))), 25953#(or (< (+ 6 i1) (* 2 n)) (<= (* 2 n) (+ 5 i1)) (<= (+ 3 i2) (* 2 n))), 25932#(or (<= (* 2 n) (+ i1 4)) (< (+ 5 i1) (* 2 n))), 25952#(or (< (+ 6 i1) (* 2 n)) (< i2 (* 2 n)) (<= (* 2 n) (+ 5 i1))), 25939#(or (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n)) (< i2 (* 2 n))), 25945#(or (<= (+ 5 i2) (* 2 n)) (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n))), 25950#(or (<= (* 2 n) (+ i1 4)) (< (+ 5 i1) (* 2 n)) (<= (+ 3 i2) (* 2 n))), 25954#(or (<= (+ 5 i2) (* 2 n)) (< (+ 6 i1) (* 2 n)) (<= (* 2 n) (+ 5 i1))), 25940#(or (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n)) (<= (+ 3 i2) (* 2 n))), 25933#(or (< (+ 6 i1) (* 2 n)) (<= (* 2 n) (+ 5 i1))), 25935#(or (< i1 (* 2 n)) (<= (+ 3 i2) (* 2 n))), 25956#(or (< i1 (* 2 n)) (<= (+ 7 i2) (* 2 n))), 25957#(or (<= (+ 5 i2) (* 2 n)) (<= (* 2 n) (+ 2 i2))), 25946#(or (< (+ i1 4) (* 2 n)) (<= (* 2 n) (+ 3 i1)) (< i2 (* 2 n))), 25927#(< i1 (* 2 n)), 25958#(or (<= (+ 7 i2) (* 2 n)) (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 25929#(or (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n))), 25949#(or (< i2 (* 2 n)) (<= (* 2 n) (+ i1 4)) (< (+ 5 i1) (* 2 n)))] [2022-03-15 20:45:06,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-15 20:45:06,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:06,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-15 20:45:06,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=730, Invalid=3302, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 20:45:06,419 INFO L87 Difference]: Start difference. First operand 2138 states and 6919 transitions. Second operand has 56 states, 56 states have (on average 1.875) internal successors, (105), 55 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:16,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:16,160 INFO L93 Difference]: Finished difference Result 4640 states and 13562 transitions. [2022-03-15 20:45:16,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 299 states. [2022-03-15 20:45:16,161 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.875) internal successors, (105), 55 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 20:45:16,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:16,183 INFO L225 Difference]: With dead ends: 4640 [2022-03-15 20:45:16,183 INFO L226 Difference]: Without dead ends: 4638 [2022-03-15 20:45:16,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50768 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=14526, Invalid=105536, Unknown=0, NotChecked=0, Total=120062 [2022-03-15 20:45:16,188 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 486 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 1045 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1045 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:16,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [486 Valid, 1 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1045 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:45:16,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4638 states. [2022-03-15 20:45:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4638 to 2704. [2022-03-15 20:45:16,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2703 states have (on average 3.1838697743248243) internal successors, (8606), 2703 states have internal predecessors, (8606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 8606 transitions. [2022-03-15 20:45:16,254 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 8606 transitions. Word has length 18 [2022-03-15 20:45:16,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:16,254 INFO L470 AbstractCegarLoop]: Abstraction has 2704 states and 8606 transitions. [2022-03-15 20:45:16,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.875) internal successors, (105), 55 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 8606 transitions. [2022-03-15 20:45:16,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:45:16,259 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:16,259 INFO L514 BasicCegarLoop]: trace histogram [8, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:16,291 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:45:16,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:16,492 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:45:16,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:16,492 INFO L85 PathProgramCache]: Analyzing trace with hash 661314440, now seen corresponding path program 15 times [2022-03-15 20:45:16,493 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:16,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468331697] [2022-03-15 20:45:16,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:16,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:45:16,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:16,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468331697] [2022-03-15 20:45:16,540 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468331697] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:16,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929239152] [2022-03-15 20:45:16,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:45:16,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:16,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:16,541 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:45:16,542 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:45:16,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 20:45:16,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:45:16,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:45:16,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:45:16,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:45:16,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929239152] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:16,720 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:45:16,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-03-15 20:45:16,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1227212450] [2022-03-15 20:45:16,721 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:16,722 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:16,727 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 117 transitions. [2022-03-15 20:45:16,728 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:17,588 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [36735#(or (<= (* 2 n) (+ i1 4)) (< (+ 5 i1) (* 2 n))), 36739#(or (<= i2 (+ 6 i1)) (<= (* 2 n) i1)), 36745#(or (<= i2 (+ i1 4)) (<= (* 2 n) i1)), 36733#(or (<= (* 2 n) (+ 2 i1)) (< (+ 3 i1) (* 2 n))), 36737#(or (< (+ 7 i1) (* 2 n)) (<= (* 2 n) (+ 6 i1))), 36744#(or (<= (* 2 n) (+ i2 4)) (<= (+ 2 i2) i1)), 36721#(or (<= (+ i2 4) i1) (<= (* 2 n) (+ 2 i2))), 36725#(or (<= (* 2 n) (+ i2 4)) (< (+ 6 i2) (* 2 n))), 36720#(or (<= (* 2 n) (+ 2 i2)) (<= (+ 5 i2) i1)), 36718#(or (<= (* 2 n) (+ 2 i2)) (< (+ i2 4) (* 2 n))), 36727#(or (<= (+ 7 i2) i1) (<= (* 2 n) (+ i2 4))), 36741#(or (<= (* 2 n) (+ i2 4)) (<= (+ 3 i2) i1)), 36661#(< i2 (* 2 n)), 36712#(or (<= (* 2 n) i2) (<= (+ i2 4) (* 2 n))), 36714#(or (<= (* 2 n) i2) (<= (+ 2 i2) i1)), 36743#(or (<= (* 2 n) (+ 2 i2)) (<= i2 i1)), 36713#(or (<= (* 2 n) i2) (<= (+ 3 i2) i1)), 36724#(or (<= (* 2 n) (+ 2 i2)) (<= (+ i2 1) i1)), 36738#(or (< (+ i1 8) (* 2 n)) (<= (* 2 n) (+ 7 i1))), 36722#(or (<= (* 2 n) (+ 2 i2)) (<= (+ 3 i2) i1)), 36742#(or (<= (* 2 n) i2) (<= i2 (+ 2 i1))), 36717#(or (<= i2 (+ i1 1)) (<= (* 2 n) i2)), 36740#(or (<= (* 2 n) (+ i2 4)) (<= (+ i2 4) i1)), 36726#(or (<= (* 2 n) (+ i2 4)) (<= (+ i2 8) (* 2 n))), 36723#(or (<= (* 2 n) (+ 2 i2)) (<= (+ 2 i2) i1)), 36730#(< i1 (* 2 n)), 36719#(or (<= (* 2 n) (+ 2 i2)) (<= (+ 6 i2) (* 2 n))), 36734#(or (< (+ i1 4) (* 2 n)) (<= (* 2 n) (+ 3 i1))), 36736#(or (< (+ 6 i1) (* 2 n)) (<= (* 2 n) (+ 5 i1))), 36716#(or (<= (* 2 n) i2) (<= i2 i1)), 36732#(or (<= (* 2 n) (+ i1 1)) (< (+ 2 i1) (* 2 n))), 36729#(or (<= (* 2 n) (+ i2 4)) (<= (+ 5 i2) i1)), 36711#(or (< (+ 2 i2) (* 2 n)) (<= (* 2 n) i2)), 36731#(or (<= (* 2 n) i1) (< (+ i1 1) (* 2 n))), 36715#(or (<= (* 2 n) i2) (<= (+ i2 1) i1)), 36728#(or (<= (* 2 n) (+ i2 4)) (<= (+ 6 i2) i1))] [2022-03-15 20:45:17,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 20:45:17,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:17,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 20:45:17,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=2535, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 20:45:17,590 INFO L87 Difference]: Start difference. First operand 2704 states and 8606 transitions. Second operand has 47 states, 47 states have (on average 2.1702127659574466) internal successors, (102), 46 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:26,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:26,302 INFO L93 Difference]: Finished difference Result 4327 states and 12313 transitions. [2022-03-15 20:45:26,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2022-03-15 20:45:26,303 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.1702127659574466) internal successors, (102), 46 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 20:45:26,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:26,322 INFO L225 Difference]: With dead ends: 4327 [2022-03-15 20:45:26,322 INFO L226 Difference]: Without dead ends: 4327 [2022-03-15 20:45:26,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19373 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=9680, Invalid=46252, Unknown=0, NotChecked=0, Total=55932 [2022-03-15 20:45:26,325 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 751 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 783 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 783 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:26,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [751 Valid, 1 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [783 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 20:45:26,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4327 states. [2022-03-15 20:45:26,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4327 to 2007. [2022-03-15 20:45:26,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2007 states, 2006 states have (on average 3.1021934197407774) internal successors, (6223), 2006 states have internal predecessors, (6223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:26,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 6223 transitions. [2022-03-15 20:45:26,375 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 6223 transitions. Word has length 19 [2022-03-15 20:45:26,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:26,375 INFO L470 AbstractCegarLoop]: Abstraction has 2007 states and 6223 transitions. [2022-03-15 20:45:26,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.1702127659574466) internal successors, (102), 46 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:26,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 6223 transitions. [2022-03-15 20:45:26,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:45:26,381 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:26,381 INFO L514 BasicCegarLoop]: trace histogram [8, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:26,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 20:45:26,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 20:45:26,597 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:45:26,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:26,598 INFO L85 PathProgramCache]: Analyzing trace with hash -708247135, now seen corresponding path program 16 times [2022-03-15 20:45:26,598 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:26,598 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122684728] [2022-03-15 20:45:26,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:26,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:26,665 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:26,665 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:26,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122684728] [2022-03-15 20:45:26,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122684728] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:26,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178135072] [2022-03-15 20:45:26,665 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:45:26,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:26,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:26,666 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:45:26,668 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:45:26,689 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:45:26,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:45:26,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 20:45:26,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:26,963 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:45:26,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 15 new quantified variables, introduced 28 case distinctions, treesize of input 39 treesize of output 252 [2022-03-15 20:45:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:28,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:29,917 INFO L353 Elim1Store]: treesize reduction 40, result has 95.8 percent of original size [2022-03-15 20:45:29,917 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 30 new quantified variables, introduced 120 case distinctions, treesize of input 35 treesize of output 980 Received shutdown request... [2022-03-15 20:57:38,997 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2022-03-15 20:57:39,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-15 20:57:39,021 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 20:57:39,021 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 20:57:39,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 20:57:39,201 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-6-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-68-19-2-18-2-21-2-22-3-34-2-28-3-18-2-19-2-19-2-18-2-13-2-14-2-13-2-13-2-2-1 context. [2022-03-15 20:57:39,203 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 20:57:39,203 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 20:57:39,204 INFO L732 BasicCegarLoop]: Path program histogram: [16, 1, 1] [2022-03-15 20:57:39,206 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 20:57:39,206 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:57:39,207 INFO L202 PluginConnector]: Adding new model unroll-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:57:39 BasicIcfg [2022-03-15 20:57:39,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:57:39,207 INFO L158 Benchmark]: Toolchain (without parser) took 862421.09ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 864.0MB). Free memory was 133.3MB in the beginning and 655.8MB in the end (delta: -522.5MB). Peak memory consumption was 675.5MB. Max. memory is 8.0GB. [2022-03-15 20:57:39,207 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 134.4MB in the end (delta: 73.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:57:39,208 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.28ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 131.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 20:57:39,208 INFO L158 Benchmark]: Boogie Preprocessor took 9.62ms. Allocated memory is still 167.8MB. Free memory was 131.7MB in the beginning and 130.8MB in the end (delta: 938.9kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 20:57:39,208 INFO L158 Benchmark]: RCFGBuilder took 226.61ms. Allocated memory is still 167.8MB. Free memory was 130.7MB in the beginning and 120.7MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-15 20:57:39,208 INFO L158 Benchmark]: TraceAbstraction took 862161.14ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 864.0MB). Free memory was 120.2MB in the beginning and 655.8MB in the end (delta: -535.6MB). Peak memory consumption was 661.8MB. Max. memory is 8.0GB. [2022-03-15 20:57:39,209 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.09ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 134.4MB in the end (delta: 73.2kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.28ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 131.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 9.62ms. Allocated memory is still 167.8MB. Free memory was 131.7MB in the beginning and 130.8MB in the end (delta: 938.9kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 226.61ms. Allocated memory is still 167.8MB. Free memory was 130.7MB in the beginning and 120.7MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 862161.14ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 864.0MB). Free memory was 120.2MB in the beginning and 655.8MB in the end (delta: -535.6MB). Peak memory consumption was 661.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 20 PlacesBefore, 18 PlacesAfterwards, 15 TransitionsBefore, 13 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 18 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 18, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 53]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-6-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-68-19-2-18-2-21-2-22-3-34-2-28-3-18-2-19-2-19-2-18-2-13-2-14-2-13-2-13-2-2-1 context. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-6-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-68-19-2-18-2-21-2-22-3-34-2-28-3-18-2-19-2-19-2-18-2-13-2-14-2-13-2-13-2-2-1 context. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-6-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-68-19-2-18-2-21-2-22-3-34-2-28-3-18-2-19-2-19-2-18-2-13-2-14-2-13-2-13-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 20 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 862.1s, OverallIterations: 18, TraceHistogramMax: 8, PathProgramHistogramMax: 16, EmptinessCheckTime: 0.0s, AutomataDifference: 52.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3663 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3663 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3061 mSDsCounter, 3987 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9383 IncrementalHoareTripleChecker+Invalid, 13370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3987 mSolverCounterUnsat, 17 mSDtfsCounter, 9383 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2350 GetRequests, 451 SyntacticMatches, 23 SemanticMatches, 1876 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207830 ImplicationChecksByTransitivity, 50.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2704occurred in iteration=16, InterpolantAutomatonStates: 1557, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 8199 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 64.8s InterpolantComputationTime, 459 NumberOfCodeBlocks, 459 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 633 ConstructedInterpolants, 0 QuantifiedInterpolants, 3903 SizeOfPredicates, 28 NumberOfNonLiveVariables, 880 ConjunctsInSsa, 160 ConjunctsInUnsatCore, 47 InterpolantComputations, 2 PerfectInterpolantSequences, 411/847 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown