/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-4.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:45:34,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:45:34,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:45:34,917 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:45:34,918 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:45:34,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:45:34,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:45:34,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:45:34,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:45:34,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:45:34,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:45:34,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:45:34,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:45:34,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:45:34,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:45:34,935 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:45:34,936 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:45:34,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:45:34,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:45:34,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:45:34,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:45:34,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:45:34,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:45:34,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:45:34,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:45:34,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:45:34,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:45:34,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:45:34,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:45:34,948 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:45:34,948 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:45:34,949 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:45:34,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:45:34,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:45:34,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:45:34,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:45:34,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:45:34,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:45:34,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:45:34,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:45:34,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:45:34,952 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:45:34,966 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:45:34,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:45:34,967 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:45:34,967 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:45:34,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:45:34,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:45:34,968 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:45:34,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:45:34,968 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:45:34,968 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:45:34,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:45:34,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:45:34,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:45:34,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:45:34,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:45:34,969 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:45:34,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:45:34,969 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:45:34,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:45:34,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:45:34,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:45:34,970 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:45:34,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:45:34,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:45:34,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:45:34,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:45:34,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:45:34,970 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:45:34,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:45:34,971 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:45:34,971 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:45:34,971 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:45:34,971 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:45:35,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:45:35,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:45:35,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:45:35,166 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 20:45:35,171 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 20:45:35,172 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/unroll-4.wvr.bpl [2022-03-15 20:45:35,172 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/unroll-4.wvr.bpl' [2022-03-15 20:45:35,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:45:35,188 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 20:45:35,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:45:35,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:45:35,189 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:45:35,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "unroll-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:45:35" (1/1) ... [2022-03-15 20:45:35,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "unroll-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:45:35" (1/1) ... [2022-03-15 20:45:35,205 INFO L137 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 20:45:35,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:45:35,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:45:35,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:45:35,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:45:35,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "unroll-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:45:35" (1/1) ... [2022-03-15 20:45:35,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "unroll-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:45:35" (1/1) ... [2022-03-15 20:45:35,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "unroll-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:45:35" (1/1) ... [2022-03-15 20:45:35,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "unroll-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:45:35" (1/1) ... [2022-03-15 20:45:35,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "unroll-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:45:35" (1/1) ... [2022-03-15 20:45:35,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "unroll-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:45:35" (1/1) ... [2022-03-15 20:45:35,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "unroll-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:45:35" (1/1) ... [2022-03-15 20:45:35,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:45:35,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:45:35,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:45:35,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:45:35,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "unroll-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:45:35" (1/1) ... [2022-03-15 20:45:35,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:45:35,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:35,252 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:45:35,279 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:45:35,292 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 20:45:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 20:45:35,292 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 20:45:35,292 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 20:45:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 20:45:35,293 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 20:45:35,293 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 20:45:35,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:45:35,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:45:35,293 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:45:35,326 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:45:35,327 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:45:35,392 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:45:35,420 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:45:35,420 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 20:45:35,421 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread1EXIT is neither atomic block end nor error location. [2022-03-15 20:45:35,421 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread2EXIT is neither atomic block end nor error location. [2022-03-15 20:45:35,422 INFO L202 PluginConnector]: Adding new model unroll-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:45:35 BoogieIcfgContainer [2022-03-15 20:45:35,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:45:35,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:45:35,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:45:35,427 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:45:35,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "unroll-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:45:35" (1/2) ... [2022-03-15 20:45:35,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73eba429 and model type unroll-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:45:35, skipping insertion in model container [2022-03-15 20:45:35,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "unroll-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:45:35" (2/2) ... [2022-03-15 20:45:35,436 INFO L111 eAbstractionObserver]: Analyzing ICFG unroll-4.wvr.bpl [2022-03-15 20:45:35,439 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:45:35,439 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:45:35,439 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 20:45:35,439 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:45:35,460 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 20:45:35,491 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:45:35,495 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:45:35,496 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 20:45:35,502 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:45:35,511 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 15 transitions, 46 flow [2022-03-15 20:45:35,513 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 15 transitions, 46 flow [2022-03-15 20:45:35,514 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 20 places, 15 transitions, 46 flow [2022-03-15 20:45:35,547 INFO L129 PetriNetUnfolder]: 2/13 cut-off events. [2022-03-15 20:45:35,547 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 20:45:35,549 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:45:35,549 INFO L116 LiptonReduction]: Number of co-enabled transitions 16 [2022-03-15 20:45:35,574 INFO L131 LiptonReduction]: Checked pairs total: 18 [2022-03-15 20:45:35,575 INFO L133 LiptonReduction]: Total number of compositions: 3 [2022-03-15 20:45:35,580 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 13 transitions, 42 flow [2022-03-15 20:45:35,587 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:45:35,588 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:45:35,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-03-15 20:45:35,591 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:35,591 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:35,592 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:45:35,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:35,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1828284660, now seen corresponding path program 1 times [2022-03-15 20:45:35,606 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:35,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828626067] [2022-03-15 20:45:35,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:35,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:35,710 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:45:35,710 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:35,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828626067] [2022-03-15 20:45:35,710 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828626067] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:45:35,711 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:45:35,711 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 20:45:35,712 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1747223440] [2022-03-15 20:45:35,713 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:35,716 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:35,731 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 14 transitions. [2022-03-15 20:45:35,732 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:35,801 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:45:35,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:45:35,802 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:35,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:45:35,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:45:35,823 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:45:35,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:35,841 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2022-03-15 20:45:35,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:45:35,843 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:45:35,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:35,848 INFO L225 Difference]: With dead ends: 21 [2022-03-15 20:45:35,848 INFO L226 Difference]: Without dead ends: 18 [2022-03-15 20:45:35,849 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:45:35,851 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:45:35,852 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:45:35,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-03-15 20:45:35,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-03-15 20:45:35,870 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:45:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-03-15 20:45:35,872 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 32 transitions. Word has length 8 [2022-03-15 20:45:35,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:35,872 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 32 transitions. [2022-03-15 20:45:35,873 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:45:35,873 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 32 transitions. [2022-03-15 20:45:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 20:45:35,873 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:35,873 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:35,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:45:35,874 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:45:35,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:35,874 INFO L85 PathProgramCache]: Analyzing trace with hash 842272711, now seen corresponding path program 1 times [2022-03-15 20:45:35,875 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:35,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28009972] [2022-03-15 20:45:35,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:35,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:35,913 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:45:35,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:35,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28009972] [2022-03-15 20:45:35,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28009972] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:45:35,917 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:45:35,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:45:35,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [261475802] [2022-03-15 20:45:35,917 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:35,918 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:35,920 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2022-03-15 20:45:35,920 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:35,993 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [111#(< i1 (* n 4)), 112#(or (< i1 (* n 4)) (<= (* n 4) i2))] [2022-03-15 20:45:35,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:45:35,994 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:35,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:45:35,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:45:35,995 INFO L87 Difference]: Start difference. First operand 18 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call 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:36,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:36,064 INFO L93 Difference]: Finished difference Result 20 states and 33 transitions. [2022-03-15 20:45:36,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:45:36,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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:45:36,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:36,067 INFO L225 Difference]: With dead ends: 20 [2022-03-15 20:45:36,067 INFO L226 Difference]: Without dead ends: 16 [2022-03-15 20:45:36,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:45:36,069 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 17 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:36,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 1 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:45:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-03-15 20:45:36,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-03-15 20:45:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2022-03-15 20:45:36,076 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 28 transitions. Word has length 9 [2022-03-15 20:45:36,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:36,077 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 28 transitions. [2022-03-15 20:45:36,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call 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:36,077 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 28 transitions. [2022-03-15 20:45:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 20:45:36,077 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:36,077 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:36,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 20:45:36,078 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:45:36,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:36,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1528597769, now seen corresponding path program 1 times [2022-03-15 20:45:36,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:36,081 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714570696] [2022-03-15 20:45:36,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:36,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:36,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:36,116 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:36,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714570696] [2022-03-15 20:45:36,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714570696] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:36,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147707056] [2022-03-15 20:45:36,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:36,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:36,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:36,122 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:45:36,126 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:45:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:36,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 20:45:36,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:36,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:36,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:36,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147707056] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:36,239 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:45:36,239 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-03-15 20:45:36,239 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1656521795] [2022-03-15 20:45:36,240 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:36,240 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:36,246 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2022-03-15 20:45:36,246 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:36,347 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [225#(or (< i1 (* n 4)) (<= (+ i2 1) (* n 4))), 224#(or (< (+ i1 1) (* n 4)) (<= (* n 4) i1)), 226#(or (< (+ i1 1) (* n 4)) (< i2 (* n 4)) (<= (* n 4) i1)), 223#(< i1 (* n 4))] [2022-03-15 20:45:36,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:45:36,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:36,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:45:36,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:45:36,351 INFO L87 Difference]: Start difference. First operand 16 states and 28 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:45:36,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:36,438 INFO L93 Difference]: Finished difference Result 23 states and 42 transitions. [2022-03-15 20:45:36,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 20:45:36,439 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:45:36,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:36,440 INFO L225 Difference]: With dead ends: 23 [2022-03-15 20:45:36,440 INFO L226 Difference]: Without dead ends: 23 [2022-03-15 20:45:36,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:45:36,443 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 24 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:36,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 1 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:45:36,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-03-15 20:45:36,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-03-15 20:45:36,450 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:45:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 42 transitions. [2022-03-15 20:45:36,452 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 42 transitions. Word has length 9 [2022-03-15 20:45:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:36,452 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 42 transitions. [2022-03-15 20:45:36,453 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:45:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 42 transitions. [2022-03-15 20:45:36,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:45:36,453 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:36,453 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:36,469 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:45:36,659 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:45:36,660 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:45:36,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:36,660 INFO L85 PathProgramCache]: Analyzing trace with hash -94379737, now seen corresponding path program 1 times [2022-03-15 20:45:36,661 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:36,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804577577] [2022-03-15 20:45:36,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:36,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:45:36,733 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:36,733 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804577577] [2022-03-15 20:45:36,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804577577] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:36,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551970499] [2022-03-15 20:45:36,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:36,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:36,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:36,735 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:45:36,736 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:45:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:36,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:45:36,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:45:36,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:36,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:45:36,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551970499] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:36,828 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:45:36,828 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-03-15 20:45:36,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1368662255] [2022-03-15 20:45:36,829 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:36,829 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:36,831 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 33 transitions. [2022-03-15 20:45:36,831 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:36,947 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [361#(< i1 (* n 4)), 373#(or (< (+ i1 1) (* n 4)) (<= (* n 4) i1)), 374#(or (<= (* n 4) (+ i1 1)) (< (+ 2 i1) (* n 4)))] [2022-03-15 20:45:36,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:45:36,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:36,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:45:36,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:45:36,948 INFO L87 Difference]: Start difference. First operand 23 states and 42 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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:45:36,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:36,998 INFO L93 Difference]: Finished difference Result 31 states and 58 transitions. [2022-03-15 20:45:36,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:45:36,999 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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:45:36,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:36,999 INFO L225 Difference]: With dead ends: 31 [2022-03-15 20:45:36,999 INFO L226 Difference]: Without dead ends: 31 [2022-03-15 20:45:36,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:45:37,000 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 25 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:37,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 1 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:45:37,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-03-15 20:45:37,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-03-15 20:45:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 30 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call 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:37,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 58 transitions. [2022-03-15 20:45:37,003 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 58 transitions. Word has length 11 [2022-03-15 20:45:37,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:37,003 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 58 transitions. [2022-03-15 20:45:37,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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:45:37,003 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 58 transitions. [2022-03-15 20:45:37,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:45:37,004 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:37,004 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:37,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-15 20:45:37,219 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:45:37,220 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:45:37,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:37,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1725749895, now seen corresponding path program 2 times [2022-03-15 20:45:37,221 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:37,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575012887] [2022-03-15 20:45:37,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:37,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:37,265 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:37,266 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:37,266 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575012887] [2022-03-15 20:45:37,266 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575012887] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:37,266 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176796782] [2022-03-15 20:45:37,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:45:37,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:37,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:37,267 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:45:37,268 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:45:37,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:45:37,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:45:37,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 20:45:37,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:37,405 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:45:37,406 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:45:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:37,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:37,677 INFO L353 Elim1Store]: treesize reduction 20, result has 91.1 percent of original size [2022-03-15 20:45:37,677 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:45:44,986 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:44,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176796782] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:44,986 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:45:44,986 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 13 [2022-03-15 20:45:44,986 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1481930570] [2022-03-15 20:45:44,987 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:44,987 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:44,990 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 47 transitions. [2022-03-15 20:45:44,990 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:45,187 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [560#(= (select f (select f (select f x1))) x2), 543#(= (select f (select f (select f (select f x2)))) (select f x1)), 559#(= (select f (select f x1)) x2), 561#(= (select f (select f (select f (select f x1)))) x2), 551#(= (select f (select f (select f (select f x2)))) (select f (select f (select f x1)))), 558#(= (select f x1) x2), 547#(= (select f (select f (select f (select f x2)))) (select f (select f x1))), 562#(= (select f (select f (select f (select f x1)))) (select f (select f (select f (select f x2)))))] [2022-03-15 20:45:45,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:45:45,187 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:45,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:45:45,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:45:45,188 INFO L87 Difference]: Start difference. First operand 31 states and 58 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:45,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:45,460 INFO L93 Difference]: Finished difference Result 115 states and 209 transitions. [2022-03-15 20:45:45,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:45:45,460 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:45:45,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:45,461 INFO L225 Difference]: With dead ends: 115 [2022-03-15 20:45:45,461 INFO L226 Difference]: Without dead ends: 112 [2022-03-15 20:45:45,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:45:45,462 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 53 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:45,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 1 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:45:45,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-03-15 20:45:45,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 56. [2022-03-15 20:45:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 2.3636363636363638) internal successors, (130), 55 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call 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:45,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2022-03-15 20:45:45,468 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 130 transitions. Word has length 13 [2022-03-15 20:45:45,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:45,468 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 130 transitions. [2022-03-15 20:45:45,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:45,469 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 130 transitions. [2022-03-15 20:45:45,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:45:45,469 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:45,469 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:45,487 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:45:45,671 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:45:45,672 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:45:45,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:45,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1958662292, now seen corresponding path program 3 times [2022-03-15 20:45:45,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:45,674 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744853410] [2022-03-15 20:45:45,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:45,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:45,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:45,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744853410] [2022-03-15 20:45:45,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744853410] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:45,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979368624] [2022-03-15 20:45:45,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:45:45,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:45,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:45,725 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:45:45,726 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:45:45,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 20:45:45,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:45:45,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 20:45:45,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:45,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:45,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979368624] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:45,881 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:45:45,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-03-15 20:45:45,881 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [89188998] [2022-03-15 20:45:45,881 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:45,882 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:45,885 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 60 transitions. [2022-03-15 20:45:45,885 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:46,248 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [888#(or (<= (* n 4) (+ 2 i1)) (< (+ 3 i1) (* n 4))), 896#(or (<= (* n 4) (+ 2 i1)) (<= (* n 4) (+ i2 4)) (< (+ 3 i1) (* n 4))), 897#(or (< (+ i1 4) (* n 4)) (<= (* n 4) (+ i2 4)) (<= (* n 4) (+ 3 i1))), 895#(or (<= (* n 4) (+ i2 4)) (<= (* n 4) (+ i1 1)) (< (+ 2 i1) (* n 4))), 890#(or (< (+ i1 1) (* n 4)) (<= (* n 4) (+ i2 4)) (<= (* n 4) i1)), 893#(or (<= (* n 4) (+ 2 i1)) (<= (* n 4) i2) (< (+ 3 i1) (* n 4))), 884#(or (< (+ i1 1) (* n 4)) (<= (* n 4) i1)), 892#(or (<= (* n 4) i2) (<= (* n 4) (+ i1 1)) (< (+ 2 i1) (* n 4))), 894#(or (< (+ i1 4) (* n 4)) (<= (* n 4) i2) (<= (* n 4) (+ 3 i1))), 889#(or (< i1 (* n 4)) (<= (* n 4) (+ i2 4))), 887#(or (<= (* n 4) (+ i1 1)) (< (+ 2 i1) (* n 4))), 891#(or (< (+ i1 4) (* n 4)) (<= (* n 4) (+ 3 i1))), 885#(or (< i1 (* n 4)) (<= (* n 4) i2)), 886#(or (< (+ i1 1) (* n 4)) (<= (* n 4) i2) (<= (* n 4) i1)), 883#(< i1 (* n 4))] [2022-03-15 20:45:46,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 20:45:46,249 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:46,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 20:45:46,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:45:46,250 INFO L87 Difference]: Start difference. First operand 56 states and 130 transitions. Second operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:48,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:48,175 INFO L93 Difference]: Finished difference Result 280 states and 721 transitions. [2022-03-15 20:45:48,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-03-15 20:45:48,176 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:45:48,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:48,178 INFO L225 Difference]: With dead ends: 280 [2022-03-15 20:45:48,179 INFO L226 Difference]: Without dead ends: 267 [2022-03-15 20:45:48,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3593 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2828, Invalid=7474, Unknown=0, NotChecked=0, Total=10302 [2022-03-15 20:45:48,183 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 150 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:48,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 1 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:45:48,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-03-15 20:45:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 163. [2022-03-15 20:45:48,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 3.1049382716049383) internal successors, (503), 162 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call 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:48,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 503 transitions. [2022-03-15 20:45:48,210 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 503 transitions. Word has length 14 [2022-03-15 20:45:48,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:48,211 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 503 transitions. [2022-03-15 20:45:48,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:48,211 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 503 transitions. [2022-03-15 20:45:48,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:45:48,214 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:48,214 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:48,237 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:45:48,431 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:45:48,431 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:45:48,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:48,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1759902610, now seen corresponding path program 4 times [2022-03-15 20:45:48,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:48,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645554244] [2022-03-15 20:45:48,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:48,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:48,483 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:45:48,484 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:48,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645554244] [2022-03-15 20:45:48,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645554244] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:48,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362196719] [2022-03-15 20:45:48,484 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:45:48,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:48,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:48,485 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:45:48,485 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:45:48,504 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:45:48,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:45:48,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 20:45:48,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:48,532 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:48,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:48,611 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:48,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362196719] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:48,611 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:45:48,611 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-03-15 20:45:48,611 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2019067722] [2022-03-15 20:45:48,611 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:48,612 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:48,614 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 54 transitions. [2022-03-15 20:45:48,614 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:49,054 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [1750#(or (<= (* n 4) (+ 2 i1)) (< (+ 3 i1) (* n 4))), 1758#(or (<= (+ 5 i2) (* n 4)) (<= (* n 4) (+ i1 4)) (< (+ 5 i1) (* n 4))), 1753#(or (< (+ i1 4) (* n 4)) (<= (* n 4) (+ 3 i1))), 1754#(or (< (+ i1 4) (* n 4)) (<= (* n 4) (+ 3 i1)) (< i2 (* n 4))), 1757#(or (<= (* n 4) (+ i1 4)) (< (+ 5 i1) (* n 4)) (< i2 (* n 4))), 1746#(or (< (+ i1 1) (* n 4)) (<= (+ 5 i2) (* n 4)) (<= (* n 4) i1)), 1744#(or (< (+ i1 1) (* n 4)) (<= (* n 4) i1)), 1742#(or (< i1 (* n 4)) (<= (+ i2 1) (* n 4))), 1747#(or (<= (* n 4) (+ i1 1)) (< (+ 2 i1) (* n 4))), 1755#(or (< (+ i1 4) (* n 4)) (<= (+ 5 i2) (* n 4)) (<= (* n 4) (+ 3 i1))), 1749#(or (<= (+ 5 i2) (* n 4)) (<= (* n 4) (+ i1 1)) (< (+ 2 i1) (* n 4))), 1756#(or (<= (* n 4) (+ i1 4)) (< (+ 5 i1) (* n 4))), 1741#(< i1 (* n 4)), 1752#(or (<= (* n 4) (+ 2 i1)) (<= (+ 5 i2) (* n 4)) (< (+ 3 i1) (* n 4))), 1743#(or (< i1 (* n 4)) (<= (+ 5 i2) (* n 4))), 1748#(or (<= (* n 4) (+ i1 1)) (< (+ 2 i1) (* n 4)) (< i2 (* n 4))), 1745#(or (< (+ i1 1) (* n 4)) (< i2 (* n 4)) (<= (* n 4) i1)), 1751#(or (<= (* n 4) (+ 2 i1)) (< (+ 3 i1) (* n 4)) (< i2 (* n 4)))] [2022-03-15 20:45:49,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 20:45:49,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:49,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 20:45:49,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=830, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:45:49,055 INFO L87 Difference]: Start difference. First operand 163 states and 503 transitions. Second operand has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:50,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:50,621 INFO L93 Difference]: Finished difference Result 386 states and 1072 transitions. [2022-03-15 20:45:50,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-03-15 20:45:50,622 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:45:50,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:50,623 INFO L225 Difference]: With dead ends: 386 [2022-03-15 20:45:50,624 INFO L226 Difference]: Without dead ends: 384 [2022-03-15 20:45:50,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2587 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1456, Invalid=7100, Unknown=0, NotChecked=0, Total=8556 [2022-03-15 20:45:50,626 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 208 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:50,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 1 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:45:50,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-03-15 20:45:50,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 224. [2022-03-15 20:45:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 3.0358744394618835) internal successors, (677), 223 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call 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:50,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 677 transitions. [2022-03-15 20:45:50,633 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 677 transitions. Word has length 14 [2022-03-15 20:45:50,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:50,633 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 677 transitions. [2022-03-15 20:45:50,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:50,633 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 677 transitions. [2022-03-15 20:45:50,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:45:50,634 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:50,634 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:50,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 20:45:50,843 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:45:50,844 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:45:50,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:50,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2024873733, now seen corresponding path program 5 times [2022-03-15 20:45:50,845 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:50,845 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106136868] [2022-03-15 20:45:50,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:50,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:50,892 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:50,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106136868] [2022-03-15 20:45:50,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106136868] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:50,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759167825] [2022-03-15 20:45:50,892 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:45:50,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:50,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:50,893 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:45:50,899 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:45:50,918 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 20:45:50,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:45:50,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:45:50,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:50,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:51,061 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:51,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759167825] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:51,061 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:45:51,061 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-03-15 20:45:51,062 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1675227628] [2022-03-15 20:45:51,062 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:51,062 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:51,065 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 61 transitions. [2022-03-15 20:45:51,065 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:51,410 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [2816#(or (<= (* n 4) (+ i1 1)) (< (+ 2 i1) (* n 4))), 2825#(or (<= (* n 4) i2) (<= (+ i2 1) i1)), 2819#(or (<= (* n 4) (+ i1 4)) (< (+ 5 i1) (* n 4))), 2826#(or (< (+ 6 i1) (* n 4)) (<= (* n 4) (+ 5 i1))), 2820#(or (<= (* n 4) i2) (<= (+ 6 i2) (* n 4))), 2818#(or (< (+ i1 4) (* n 4)) (<= (* n 4) (+ 3 i1))), 2815#(or (< (+ i1 1) (* n 4)) (<= (* n 4) i1)), 2814#(< i1 (* n 4)), 2821#(or (<= (* n 4) i2) (<= (+ 5 i2) i1)), 2823#(or (<= (* n 4) i2) (<= (+ 3 i2) i1)), 2822#(or (<= (+ i2 4) i1) (<= (* n 4) i2)), 2817#(or (<= (* n 4) (+ 2 i1)) (< (+ 3 i1) (* n 4))), 2824#(or (<= (* n 4) i2) (<= (+ 2 i2) i1))] [2022-03-15 20:45:51,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 20:45:51,410 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:51,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 20:45:51,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:45:51,411 INFO L87 Difference]: Start difference. First operand 224 states and 677 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call 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:54,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:54,668 INFO L93 Difference]: Finished difference Result 614 states and 1428 transitions. [2022-03-15 20:45:54,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-03-15 20:45:54,668 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 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:45:54,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:54,672 INFO L225 Difference]: With dead ends: 614 [2022-03-15 20:45:54,672 INFO L226 Difference]: Without dead ends: 614 [2022-03-15 20:45:54,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5610 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2891, Invalid=13879, Unknown=0, NotChecked=0, Total=16770 [2022-03-15 20:45:54,676 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 294 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:54,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 1 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:45:54,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-03-15 20:45:54,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 244. [2022-03-15 20:45:54,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 2.843621399176955) internal successors, (691), 243 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call 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:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 691 transitions. [2022-03-15 20:45:54,696 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 691 transitions. Word has length 15 [2022-03-15 20:45:54,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:54,697 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 691 transitions. [2022-03-15 20:45:54,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call 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:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 691 transitions. [2022-03-15 20:45:54,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:45:54,700 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:54,700 INFO L514 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:54,719 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:45:54,918 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:45:54,918 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:45:54,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:54,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1502237002, now seen corresponding path program 6 times [2022-03-15 20:45:54,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:54,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590626935] [2022-03-15 20:45:54,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:54,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:54,987 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:54,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:54,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590626935] [2022-03-15 20:45:54,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590626935] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:54,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261777020] [2022-03-15 20:45:54,988 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:45:54,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:54,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:54,989 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:45:54,990 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:45:55,010 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 20:45:55,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:45:55,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 20:45:55,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:55,047 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:45:55,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:45:55,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261777020] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:55,090 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:45:55,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 13 [2022-03-15 20:45:55,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [936435162] [2022-03-15 20:45:55,090 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:55,091 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:55,094 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 68 transitions. [2022-03-15 20:45:55,094 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:55,484 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [4233#(< i2 (* n 4)), 4242#(or (<= (* n 4) i2) (< (+ i2 4) (* n 4)) (<= (+ (* n 4) 1) i1)), 4238#(or (<= (* n 4) (+ 2 i1)) (< i2 (* n 4))), 4246#(or (<= (* n 4) i2) (<= (* n 4) (+ 3 i1)) (< (+ i2 4) (* n 4))), 4243#(or (<= (* n 4) i2) (< (+ i2 4) (* n 4)) (<= (* n 4) i1)), 4244#(or (<= (* n 4) i2) (<= (* n 4) (+ i1 1)) (< (+ i2 4) (* n 4))), 4237#(or (<= (* n 4) (+ i1 1)) (< i2 (* n 4))), 4245#(or (<= (* n 4) (+ 2 i1)) (<= (* n 4) i2) (< (+ i2 4) (* n 4))), 4234#(or (<= (+ (* n 4) 2) i1) (< i2 (* n 4))), 4240#(or (<= (* n 4) i2) (< (+ i2 4) (* n 4))), 4236#(or (< i2 (* n 4)) (<= (* n 4) i1)), 4239#(or (<= (* n 4) (+ 3 i1)) (< i2 (* n 4))), 4241#(or (<= (+ (* n 4) 2) i1) (<= (* n 4) i2) (< (+ i2 4) (* n 4))), 4235#(or (<= (+ (* n 4) 1) i1) (< i2 (* n 4)))] [2022-03-15 20:45:55,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:45:55,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:55,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:45:55,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=576, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:45:55,485 INFO L87 Difference]: Start difference. First operand 244 states and 691 transitions. Second operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:55,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:55,879 INFO L93 Difference]: Finished difference Result 303 states and 779 transitions. [2022-03-15 20:45:55,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 20:45:55,880 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:45:55,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:55,881 INFO L225 Difference]: With dead ends: 303 [2022-03-15 20:45:55,881 INFO L226 Difference]: Without dead ends: 278 [2022-03-15 20:45:55,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=622, Invalid=1828, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 20:45:55,882 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 82 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:55,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 1 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:45:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-03-15 20:45:55,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 244. [2022-03-15 20:45:55,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 2.7818930041152266) internal successors, (676), 243 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call 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:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 676 transitions. [2022-03-15 20:45:55,888 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 676 transitions. Word has length 16 [2022-03-15 20:45:55,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:55,888 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 676 transitions. [2022-03-15 20:45:55,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:55,888 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 676 transitions. [2022-03-15 20:45:55,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:45:55,889 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:55,889 INFO L514 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:55,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-15 20:45:56,095 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:45:56,095 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:45:56,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:56,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1014700617, now seen corresponding path program 7 times [2022-03-15 20:45:56,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:56,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156063048] [2022-03-15 20:45:56,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:56,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:45:56,223 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:56,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156063048] [2022-03-15 20:45:56,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156063048] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:56,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700674067] [2022-03-15 20:45:56,223 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:45:56,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:56,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:56,224 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:45:56,225 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:45:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:56,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 20:45:56,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:56,315 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:45:56,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:56,404 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 20:45:56,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700674067] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:56,404 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:45:56,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 20 [2022-03-15 20:45:56,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [994616292] [2022-03-15 20:45:56,404 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:56,405 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:56,409 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 87 transitions. [2022-03-15 20:45:56,409 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:56,779 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [5201#(or (<= (* n 4) (+ 2 i1)) (< (+ 3 i1) (* n 4))), 5200#(or (<= (* n 4) (+ i1 1)) (< (+ 2 i1) (* n 4))), 5170#(< i1 (* n 4)), 5204#(or (< (+ 6 i1) (* n 4)) (<= (* n 4) (+ 5 i1))), 5203#(or (<= (* n 4) (+ i1 4)) (< (+ 5 i1) (* n 4))), 5205#(or (< (+ 7 i1) (* n 4)) (<= (* n 4) (+ 6 i1))), 5199#(or (< (+ i1 1) (* n 4)) (<= (* n 4) i1)), 5202#(or (< (+ i1 4) (* n 4)) (<= (* n 4) (+ 3 i1)))] [2022-03-15 20:45:56,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 20:45:56,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:56,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 20:45:56,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:45:56,780 INFO L87 Difference]: Start difference. First operand 244 states and 676 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:57,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:57,028 INFO L93 Difference]: Finished difference Result 411 states and 1097 transitions. [2022-03-15 20:45:57,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:45:57,028 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:45:57,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:57,030 INFO L225 Difference]: With dead ends: 411 [2022-03-15 20:45:57,030 INFO L226 Difference]: Without dead ends: 411 [2022-03-15 20:45:57,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=934, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 20:45:57,031 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 81 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:57,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 1 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:45:57,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-03-15 20:45:57,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 258. [2022-03-15 20:45:57,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 2.7431906614785992) internal successors, (705), 257 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:57,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 705 transitions. [2022-03-15 20:45:57,036 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 705 transitions. Word has length 17 [2022-03-15 20:45:57,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:57,036 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 705 transitions. [2022-03-15 20:45:57,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:57,037 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 705 transitions. [2022-03-15 20:45:57,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:45:57,037 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:57,037 INFO L514 BasicCegarLoop]: trace histogram [8, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:57,055 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:45:57,252 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:45:57,253 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:45:57,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:57,253 INFO L85 PathProgramCache]: Analyzing trace with hash -475611692, now seen corresponding path program 8 times [2022-03-15 20:45:57,254 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:57,254 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865103993] [2022-03-15 20:45:57,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:57,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:57,338 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:57,338 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865103993] [2022-03-15 20:45:57,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865103993] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:57,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105004037] [2022-03-15 20:45:57,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:45:57,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:57,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:57,340 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:45:57,341 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:45:57,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:45:57,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:45:57,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 20:45:57,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:57,583 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:45:57,584 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:46:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:01,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:46:02,825 INFO L353 Elim1Store]: treesize reduction 40, result has 95.8 percent of original size [2022-03-15 20:46:02,826 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:59:42,943 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2022-03-15 20:59:42,962 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:59:42,962 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 20:59:42,963 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:59:43,151 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:59:43,152 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 19 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-14-2-8-2-15-2-5-2-4-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 15 xjuncts wrt. a ∨-3-2-5-2-4-2-2-1 context. [2022-03-15 20:59:43,153 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 20:59:43,153 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 20:59:43,155 INFO L732 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1] [2022-03-15 20:59:43,156 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 20:59:43,156 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:59:43,158 INFO L202 PluginConnector]: Adding new model unroll-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:59:43 BasicIcfg [2022-03-15 20:59:43,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:59:43,158 INFO L158 Benchmark]: Toolchain (without parser) took 847970.33ms. Allocated memory was 255.9MB in the beginning and 977.3MB in the end (delta: 721.4MB). Free memory was 216.5MB in the beginning and 629.2MB in the end (delta: -412.7MB). Peak memory consumption was 588.7MB. Max. memory is 8.0GB. [2022-03-15 20:59:43,158 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 255.9MB. Free memory is still 217.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:59:43,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.44ms. Allocated memory is still 255.9MB. Free memory was 216.5MB in the beginning and 215.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 20:59:43,159 INFO L158 Benchmark]: Boogie Preprocessor took 11.57ms. Allocated memory is still 255.9MB. Free memory was 214.9MB in the beginning and 214.0MB in the end (delta: 914.3kB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 20:59:43,159 INFO L158 Benchmark]: RCFGBuilder took 203.61ms. Allocated memory is still 255.9MB. Free memory was 214.0MB in the beginning and 203.7MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-15 20:59:43,159 INFO L158 Benchmark]: TraceAbstraction took 847733.66ms. Allocated memory was 255.9MB in the beginning and 977.3MB in the end (delta: 721.4MB). Free memory was 203.1MB in the beginning and 629.2MB in the end (delta: -426.1MB). Peak memory consumption was 575.1MB. Max. memory is 8.0GB. [2022-03-15 20:59:43,160 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 255.9MB. Free memory is still 217.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.44ms. Allocated memory is still 255.9MB. Free memory was 216.5MB in the beginning and 215.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 11.57ms. Allocated memory is still 255.9MB. Free memory was 214.9MB in the beginning and 214.0MB in the end (delta: 914.3kB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 203.61ms. Allocated memory is still 255.9MB. Free memory was 214.0MB in the beginning and 203.7MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 847733.66ms. Allocated memory was 255.9MB in the beginning and 977.3MB in the end (delta: 721.4MB). Free memory was 203.1MB in the beginning and 629.2MB in the end (delta: -426.1MB). Peak memory consumption was 575.1MB. 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: 57]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 19 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-14-2-8-2-15-2-5-2-4-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 15 xjuncts wrt. a ∨-3-2-5-2-4-2-2-1 context. - TimeoutResultAtElement [Line: 52]: 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 19 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-14-2-8-2-15-2-5-2-4-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 15 xjuncts wrt. a ∨-3-2-5-2-4-2-2-1 context. - TimeoutResultAtElement [Line: 52]: 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 19 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-14-2-8-2-15-2-5-2-4-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 15 xjuncts wrt. a ∨-3-2-5-2-4-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: 847.7s, OverallIterations: 11, TraceHistogramMax: 8, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 934 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 934 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 894 mSDsCounter, 664 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2846 IncrementalHoareTripleChecker+Invalid, 3510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 664 mSolverCounterUnsat, 10 mSDtfsCounter, 2846 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 701 GetRequests, 242 SyntacticMatches, 13 SemanticMatches, 446 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12653 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=10, InterpolantAutomatonStates: 345, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 877 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 1907 SizeOfPredicates, 16 NumberOfNonLiveVariables, 425 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 180/382 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