/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-cond-4.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:47:33,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:47:33,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:47:33,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:47:33,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:47:33,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:47:33,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:47:33,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:47:33,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:47:33,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:47:33,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:47:33,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:47:33,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:47:33,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:47:33,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:47:33,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:47:33,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:47:33,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:47:33,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:47:33,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:47:33,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:47:33,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:47:33,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:47:33,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:47:33,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:47:33,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:47:33,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:47:33,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:47:33,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:47:33,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:47:33,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:47:33,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:47:33,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:47:33,692 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:47:33,693 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:47:33,693 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:47:33,693 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:47:33,693 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:47:33,694 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:47:33,694 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:47:33,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:47:33,695 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:47:33,726 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:47:33,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:47:33,727 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:47:33,727 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:47:33,727 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:47:33,727 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:47:33,728 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:47:33,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:47:33,728 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:47:33,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:47:33,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:47:33,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:47:33,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:47:33,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:47:33,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:47:33,729 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:47:33,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:47:33,729 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:47:33,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:47:33,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:47:33,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:47:33,729 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:47:33,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:47:33,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:47:33,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:47:33,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:47:33,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:47:33,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:47:33,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:47:33,731 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:47:33,731 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:47:33,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:47:33,731 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:47:33,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:47:33,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:47:33,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:47:33,939 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 20:47:33,940 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 20:47:33,941 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/unroll-cond-4.wvr.bpl [2022-03-15 20:47:33,942 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/unroll-cond-4.wvr.bpl' [2022-03-15 20:47:33,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:47:33,969 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 20:47:33,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:47:33,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:47:33,971 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:47:33,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:33" (1/1) ... [2022-03-15 20:47:33,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:33" (1/1) ... [2022-03-15 20:47:34,002 INFO L137 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 20:47:34,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:47:34,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:47:34,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:47:34,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:47:34,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:33" (1/1) ... [2022-03-15 20:47:34,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:33" (1/1) ... [2022-03-15 20:47:34,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:33" (1/1) ... [2022-03-15 20:47:34,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:33" (1/1) ... [2022-03-15 20:47:34,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:33" (1/1) ... [2022-03-15 20:47:34,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:33" (1/1) ... [2022-03-15 20:47:34,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:33" (1/1) ... [2022-03-15 20:47:34,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:47:34,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:47:34,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:47:34,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:47:34,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:33" (1/1) ... [2022-03-15 20:47:34,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:47:34,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:34,042 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:47:34,059 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:47:34,086 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 20:47:34,086 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 20:47:34,086 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 20:47:34,087 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 20:47:34,087 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 20:47:34,087 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 20:47:34,087 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 20:47:34,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:47:34,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:47:34,088 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:47:34,125 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:47:34,126 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:47:34,258 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:47:34,307 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:47:34,307 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 20:47:34,308 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread1EXIT is neither atomic block end nor error location. [2022-03-15 20:47:34,309 INFO L202 PluginConnector]: Adding new model unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:47:34 BoogieIcfgContainer [2022-03-15 20:47:34,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:47:34,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:47:34,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:47:34,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:47:34,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:33" (1/2) ... [2022-03-15 20:47:34,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0417a0 and model type unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:47:34, skipping insertion in model container [2022-03-15 20:47:34,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:47:34" (2/2) ... [2022-03-15 20:47:34,326 INFO L111 eAbstractionObserver]: Analyzing ICFG unroll-cond-4.wvr.bpl [2022-03-15 20:47:34,331 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:47:34,331 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:47:34,332 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 20:47:34,332 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:47:34,363 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 20:47:34,405 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:47:34,417 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:47:34,417 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 20:47:34,424 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:47:34,430 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 16 transitions, 48 flow [2022-03-15 20:47:34,439 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 16 transitions, 48 flow [2022-03-15 20:47:34,440 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 21 places, 16 transitions, 48 flow [2022-03-15 20:47:34,464 INFO L129 PetriNetUnfolder]: 2/14 cut-off events. [2022-03-15 20:47:34,465 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 20:47:34,469 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 14 events. 2/14 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 7 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 9. Up to 2 conditions per place. [2022-03-15 20:47:34,470 INFO L116 LiptonReduction]: Number of co-enabled transitions 22 [2022-03-15 20:47:34,573 INFO L131 LiptonReduction]: Checked pairs total: 19 [2022-03-15 20:47:34,573 INFO L133 LiptonReduction]: Total number of compositions: 4 [2022-03-15 20:47:34,578 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 13 transitions, 42 flow [2022-03-15 20:47:34,586 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:47:34,587 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:47:34,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-03-15 20:47:34,591 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:34,591 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:34,592 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:34,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:34,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1085128257, now seen corresponding path program 1 times [2022-03-15 20:47:34,611 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:34,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449042070] [2022-03-15 20:47:34,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:34,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:34,823 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:47:34,824 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:34,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449042070] [2022-03-15 20:47:34,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449042070] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:47:34,825 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:47:34,825 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:47:34,826 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1910247167] [2022-03-15 20:47:34,826 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:34,831 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:34,841 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 14 transitions. [2022-03-15 20:47:34,841 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:35,965 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [53#(or (< i1 n) (= x2 x1)), 54#(and (or (< i1 n) (= x2 x1)) (or (< i1 n) (<= n i2)))] [2022-03-15 20:47:35,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 20:47:35,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:35,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 20:47:35,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-03-15 20:47:35,986 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 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:36,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:36,037 INFO L93 Difference]: Finished difference Result 27 states and 44 transitions. [2022-03-15 20:47:36,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:47:36,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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:47:36,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:36,044 INFO L225 Difference]: With dead ends: 27 [2022-03-15 20:47:36,044 INFO L226 Difference]: Without dead ends: 16 [2022-03-15 20:47:36,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:47:36,048 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 16 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:36,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 1 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:47:36,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-03-15 20:47:36,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-03-15 20:47:36,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 26 transitions. [2022-03-15 20:47:36,070 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 26 transitions. Word has length 8 [2022-03-15 20:47:36,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:36,070 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 26 transitions. [2022-03-15 20:47:36,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:36,070 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 26 transitions. [2022-03-15 20:47:36,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 20:47:36,070 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:36,071 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:36,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:47:36,071 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:36,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:36,072 INFO L85 PathProgramCache]: Analyzing trace with hash -63274052, now seen corresponding path program 1 times [2022-03-15 20:47:36,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:36,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909992609] [2022-03-15 20:47:36,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:36,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:36,244 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:47:36,244 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:36,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909992609] [2022-03-15 20:47:36,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909992609] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:36,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48047454] [2022-03-15 20:47:36,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:36,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:36,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:36,260 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:47:36,261 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:47:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:36,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 20:47:36,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:37,202 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:47:37,206 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:47:37,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:37,880 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:47:37,881 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 107 [2022-03-15 20:47:38,511 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:47:38,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48047454] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:38,511 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:38,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-03-15 20:47:38,512 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2053810074] [2022-03-15 20:47:38,512 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:38,513 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:38,514 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2022-03-15 20:47:38,515 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:39,747 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [175#(or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n))), 173#(or (< i1 n) (= x2 x1)), 176#(and (or (= (select f x1) (select f x2)) (< (+ i1 1) n) (not (< i1 n))) (or (< (+ i1 1) n) (not (< i1 n)) (<= (+ i2 1) n)) (or (<= n (+ i2 1)) (< (+ i1 1) n) (not (< i1 n)))), 174#(and (or (< i1 n) (<= (+ i2 1) n)) (or (< i1 n) (= x1 (select f x2))) (or (< i1 n) (<= n (+ i2 1))))] [2022-03-15 20:47:39,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:47:39,748 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:39,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:47:39,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:47:39,749 INFO L87 Difference]: Start difference. First operand 15 states and 26 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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:47:40,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:40,121 INFO L93 Difference]: Finished difference Result 37 states and 62 transitions. [2022-03-15 20:47:40,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 20:47:40,122 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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:47:40,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:40,122 INFO L225 Difference]: With dead ends: 37 [2022-03-15 20:47:40,122 INFO L226 Difference]: Without dead ends: 26 [2022-03-15 20:47:40,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:47:40,124 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:40,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:47:40,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-03-15 20:47:40,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2022-03-15 20:47:40,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 38 transitions. [2022-03-15 20:47:40,127 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 38 transitions. Word has length 9 [2022-03-15 20:47:40,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:40,127 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 38 transitions. [2022-03-15 20:47:40,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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:47:40,127 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 38 transitions. [2022-03-15 20:47:40,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:47:40,128 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:40,128 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:40,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 20:47:40,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:40,347 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:40,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:40,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1304007263, now seen corresponding path program 2 times [2022-03-15 20:47:40,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:40,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80402254] [2022-03-15 20:47:40,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:40,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:40,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:40,480 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:40,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80402254] [2022-03-15 20:47:40,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80402254] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:40,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318762140] [2022-03-15 20:47:40,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:47:40,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:40,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:40,488 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:47:40,489 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:47:40,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:47:40,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:40,515 WARN L261 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 20:47:40,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:41,133 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:47:41,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 [2022-03-15 20:47:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:41,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:41,842 INFO L353 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2022-03-15 20:47:41,843 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 13 treesize of output 86 [2022-03-15 20:47:42,254 INFO L353 Elim1Store]: treesize reduction 10, result has 79.6 percent of original size [2022-03-15 20:47:42,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 11 treesize of output 50 [2022-03-15 20:47:42,324 INFO L353 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-03-15 20:47:42,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 9 treesize of output 27 [2022-03-15 20:47:42,368 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:47:42,369 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 7 treesize of output 16 [2022-03-15 20:47:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:42,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318762140] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:42,383 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:42,383 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-03-15 20:47:42,383 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1039926352] [2022-03-15 20:47:42,384 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:42,384 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:42,385 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2022-03-15 20:47:42,385 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:43,977 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [338#(or (< i1 n) (= x2 x1)), 339#(and (or (< i1 n) (<= (+ 2 i2) n)) (or (<= n (+ 2 i2)) (< i1 n)) (or (< i1 n) (= (select f (select f x2)) x1))), 341#(or (= (select f (select f x1)) x2) (< (+ 2 i1) n) (<= n (+ i1 1))), 343#(and (or (= (select f (select f x2)) (select f (select f x1))) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (not (< (+ i1 1) n)) (<= (+ 2 i2) n) (< (+ 2 i1) n)) (or (<= n (+ 2 i2)) (not (< (+ i1 1) n)) (< (+ 2 i1) n))), 340#(or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n))), 342#(and (or (< (+ i1 1) n) (not (< i1 n)) (<= (+ 2 i2) n)) (or (= (select f (select f x2)) (select f x1)) (< (+ i1 1) n) (not (< i1 n))) (or (<= n (+ 2 i2)) (< (+ i1 1) n) (not (< i1 n))))] [2022-03-15 20:47:43,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:47:43,978 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:43,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:47:43,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:47:43,978 INFO L87 Difference]: Start difference. First operand 20 states and 38 transitions. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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:47:44,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:44,582 INFO L93 Difference]: Finished difference Result 42 states and 72 transitions. [2022-03-15 20:47:44,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 20:47:44,584 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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 10 [2022-03-15 20:47:44,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:44,585 INFO L225 Difference]: With dead ends: 42 [2022-03-15 20:47:44,585 INFO L226 Difference]: Without dead ends: 31 [2022-03-15 20:47:44,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:47:44,586 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 49 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:44,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 1 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:47:44,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-03-15 20:47:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2022-03-15 20:47:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 47 transitions. [2022-03-15 20:47:44,589 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 47 transitions. Word has length 10 [2022-03-15 20:47:44,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:44,589 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 47 transitions. [2022-03-15 20:47:44,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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:47:44,590 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 47 transitions. [2022-03-15 20:47:44,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:47:44,590 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:44,590 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:44,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 20:47:44,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-03-15 20:47:44,804 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:44,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:44,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1112031140, now seen corresponding path program 3 times [2022-03-15 20:47:44,806 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:44,806 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213572821] [2022-03-15 20:47:44,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:44,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:44,918 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:44,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213572821] [2022-03-15 20:47:44,920 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213572821] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:44,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509251353] [2022-03-15 20:47:44,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:47:44,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:44,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:44,922 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:47:44,923 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:47:44,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 20:47:44,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:44,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 20:47:44,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:46,026 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:47:46,026 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 84 [2022-03-15 20:47:46,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:46,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:46,690 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:47:46,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 65 treesize of output 166 [2022-03-15 20:47:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:48,336 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509251353] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:48,336 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:48,336 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-03-15 20:47:48,336 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1244460412] [2022-03-15 20:47:48,336 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:48,337 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:48,338 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 29 transitions. [2022-03-15 20:47:48,338 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:50,398 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [533#(or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n))), 535#(or (= (select f (select f x1)) x2) (< (+ 2 i1) n) (<= n (+ i1 1))), 536#(and (or (<= (+ 3 i2) n) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (not (< (+ i1 1) n)) (< (+ 2 i1) n) (= (select f (select f x1)) (select f (select f (select f x2)))))), 537#(or (<= n (+ 2 i1)) (< (+ 3 i1) n) (= (select f (select f (select f x1))) x2)), 534#(and (or (= (select f x1) (select f (select f (select f x2)))) (< (+ i1 1) n) (not (< i1 n))) (or (<= (+ 3 i2) n) (< (+ i1 1) n) (not (< i1 n)))), 538#(and (or (<= (+ 3 i2) n) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (= (select f (select f (select f x1))) (select f (select f (select f x2)))) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 532#(and (or (< i1 n) (<= (+ 3 i2) n)) (or (< i1 n) (= x1 (select f (select f (select f x2)))))), 531#(or (< i1 n) (= x2 x1))] [2022-03-15 20:47:50,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:47:50,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:50,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:47:50,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:47:50,400 INFO L87 Difference]: Start difference. First operand 24 states and 47 transitions. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 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:47:51,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:51,418 INFO L93 Difference]: Finished difference Result 75 states and 140 transitions. [2022-03-15 20:47:51,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 20:47:51,418 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 20:47:51,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:51,419 INFO L225 Difference]: With dead ends: 75 [2022-03-15 20:47:51,419 INFO L226 Difference]: Without dead ends: 66 [2022-03-15 20:47:51,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=287, Invalid=1435, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:47:51,420 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 61 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:51,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 1 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:47:51,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-03-15 20:47:51,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 33. [2022-03-15 20:47:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 68 transitions. [2022-03-15 20:47:51,431 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 68 transitions. Word has length 11 [2022-03-15 20:47:51,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:51,432 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 68 transitions. [2022-03-15 20:47:51,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 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:47:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 68 transitions. [2022-03-15 20:47:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:47:51,432 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:51,432 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:51,452 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:47:51,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:51,633 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:51,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:51,633 INFO L85 PathProgramCache]: Analyzing trace with hash -118826701, now seen corresponding path program 1 times [2022-03-15 20:47:51,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:51,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507997679] [2022-03-15 20:47:51,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:51,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:51,669 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:51,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507997679] [2022-03-15 20:47:51,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507997679] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:51,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953074229] [2022-03-15 20:47:51,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:51,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:51,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:51,670 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:47:51,671 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:47:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:51,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:47:51,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:51,714 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:51,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:51,738 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:51,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953074229] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:51,738 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:51,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-03-15 20:47:51,739 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [632008404] [2022-03-15 20:47:51,739 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:51,740 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:51,742 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 40 transitions. [2022-03-15 20:47:51,742 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:53,011 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [795#(or (<= n (+ 3 i2)) (< i1 n)), 793#(or (< (+ i1 1) n) (<= n i1)), 798#(or (<= n (+ 2 i1)) (< (+ 3 i1) n)), 792#(< i1 n), 794#(or (< (+ 2 i1) n) (<= n (+ i1 1))), 799#(or (<= n (+ 3 i2)) (<= n (+ 2 i1)) (< (+ 3 i1) n)), 796#(or (<= n (+ 3 i2)) (< (+ i1 1) n) (<= n i1)), 797#(or (<= n (+ 3 i2)) (< (+ 2 i1) n) (<= n (+ i1 1)))] [2022-03-15 20:47:53,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:47:53,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:53,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:47:53,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:47:53,012 INFO L87 Difference]: Start difference. First operand 33 states and 68 transitions. Second operand has 15 states, 15 states have (on average 2.2) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:53,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:53,454 INFO L93 Difference]: Finished difference Result 93 states and 184 transitions. [2022-03-15 20:47:53,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 20:47:53,454 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 20:47:53,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:53,455 INFO L225 Difference]: With dead ends: 93 [2022-03-15 20:47:53,455 INFO L226 Difference]: Without dead ends: 90 [2022-03-15 20:47:53,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=431, Invalid=1051, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 20:47:53,456 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 50 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:53,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 1 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:47:53,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-03-15 20:47:53,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 39. [2022-03-15 20:47:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 38 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 89 transitions. [2022-03-15 20:47:53,461 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 89 transitions. Word has length 12 [2022-03-15 20:47:53,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:53,461 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 89 transitions. [2022-03-15 20:47:53,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:53,461 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 89 transitions. [2022-03-15 20:47:53,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:47:53,462 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:53,462 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:53,478 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:47:53,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:53,672 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:53,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:53,672 INFO L85 PathProgramCache]: Analyzing trace with hash 544261377, now seen corresponding path program 4 times [2022-03-15 20:47:53,673 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:53,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433196106] [2022-03-15 20:47:53,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:53,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:53,706 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:53,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433196106] [2022-03-15 20:47:53,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433196106] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:53,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910113449] [2022-03-15 20:47:53,706 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:47:53,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:53,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:53,709 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:47:53,710 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:47:53,728 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:47:53,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:53,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:47:53,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:53,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:53,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:53,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910113449] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:53,787 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:53,787 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-03-15 20:47:53,787 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [179211942] [2022-03-15 20:47:53,787 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:53,788 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:53,792 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 34 transitions. [2022-03-15 20:47:53,792 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:55,327 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [1091#(< i1 n), 1099#(or (< (+ i1 4) n) (<= n (+ 3 i1))), 1098#(or (< (+ 3 i2) n) (<= n (+ 2 i1)) (< (+ 3 i1) n)), 1100#(or (< (+ 3 i2) n) (< (+ i1 4) n) (<= n (+ 3 i1))), 1092#(or (< (+ 3 i2) n) (< i1 n)), 1094#(or (< (+ 2 i1) n) (<= n (+ i1 1))), 1093#(or (< (+ i1 1) n) (<= n i1)), 1097#(or (<= n (+ 2 i1)) (< (+ 3 i1) n)), 1096#(or (< (+ 3 i2) n) (< (+ 2 i1) n) (<= n (+ i1 1))), 1095#(or (< (+ 3 i2) n) (< (+ i1 1) n) (<= n i1))] [2022-03-15 20:47:55,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 20:47:55,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:55,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 20:47:55,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:47:55,328 INFO L87 Difference]: Start difference. First operand 39 states and 89 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:55,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:55,582 INFO L93 Difference]: Finished difference Result 87 states and 178 transitions. [2022-03-15 20:47:55,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 20:47:55,582 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 20:47:55,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:55,583 INFO L225 Difference]: With dead ends: 87 [2022-03-15 20:47:55,583 INFO L226 Difference]: Without dead ends: 87 [2022-03-15 20:47:55,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:47:55,584 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 64 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:55,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 1 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:47:55,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-03-15 20:47:55,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 43. [2022-03-15 20:47:55,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 2.2857142857142856) internal successors, (96), 42 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 96 transitions. [2022-03-15 20:47:55,588 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 96 transitions. Word has length 12 [2022-03-15 20:47:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:55,589 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 96 transitions. [2022-03-15 20:47:55,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:55,590 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 96 transitions. [2022-03-15 20:47:55,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:47:55,590 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:55,590 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:55,608 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:47:55,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:55,792 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:55,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:55,792 INFO L85 PathProgramCache]: Analyzing trace with hash -313366226, now seen corresponding path program 2 times [2022-03-15 20:47:55,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:55,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256794723] [2022-03-15 20:47:55,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:55,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:55,880 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:47:55,880 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:55,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256794723] [2022-03-15 20:47:55,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256794723] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:55,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522326964] [2022-03-15 20:47:55,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:47:55,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:55,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:55,881 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:47:55,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 20:47:55,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:47:55,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:55,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 20:47:55,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:48:05,212 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:48:05,213 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 13 new quantified variables, introduced 21 case distinctions, treesize of input 106 treesize of output 240 [2022-03-15 20:48:06,047 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:48:06,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:48:06,738 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:48:06,739 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 16 new quantified variables, introduced 36 case distinctions, treesize of input 47 treesize of output 330 [2022-03-15 20:48:14,446 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:48:14,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522326964] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:48:14,446 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:48:14,446 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-03-15 20:48:14,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1788118392] [2022-03-15 20:48:14,447 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:48:14,447 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:48:14,450 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 47 transitions. [2022-03-15 20:48:14,450 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:48:17,153 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [1405#(and (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (= (select f (select f (select f (select f x1)))) x2)) (or (< (+ i1 4) n) (<= n i2) (not (< (+ 3 i1) n)))), 1407#(and (or (< (+ i1 4) n) (<= n (+ i2 4)) (not (< (+ 3 i1) n))) (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (= (select f (select f (select f (select f x1)))) (select f (select f (select f (select f x2))))))), 1406#(and (or (= (select f (select f (select f (select f x2)))) (select f (select f (select f x1)))) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (<= n (+ i2 4)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 1393#(or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n))), 1400#(and (or (< i1 n) (<= n (+ i2 4))) (or (< i1 n) (= (select f (select f (select f (select f x2)))) x1))), 1396#(and (or (<= n i2) (< (+ i1 1) n) (not (< i1 n))) (or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n)))), 1398#(or (<= n (+ 2 i1)) (< (+ 3 i1) n) (= (select f (select f (select f x1))) x2)), 1403#(and (<= n (+ i2 4)) (or (= (select f (select f (select f (select f x2)))) x1) (not (< (+ 3 i2) n)))), 1392#(or (< i1 n) (= x2 x1)), 1395#(and (or (< i1 n) (= x2 x1)) (or (< i1 n) (<= n i2))), 1399#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (= (select f (select f (select f (select f x1)))) x2)), 1404#(and (or (not (< (+ 2 i1) n)) (< (+ 3 i1) n) (= (select f (select f (select f x1))) x2)) (or (<= n i2) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 1394#(or (= (select f (select f x1)) x2) (< (+ 2 i1) n) (<= n (+ i1 1))), 1401#(and (or (<= n (+ i2 4)) (< (+ i1 1) n) (not (< i1 n))) (or (< (+ i1 1) n) (not (< i1 n)) (= (select f (select f (select f (select f x2)))) (select f x1)))), 1402#(and (or (<= n (+ i2 4)) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (= (select f (select f (select f (select f x2)))) (select f (select f x1))) (not (< (+ i1 1) n)) (< (+ 2 i1) n))), 1397#(and (or (<= n i2) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (= (select f (select f x1)) x2) (not (< (+ i1 1) n)) (< (+ 2 i1) n)))] [2022-03-15 20:48:17,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 20:48:17,154 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:48:17,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 20:48:17,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1423, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 20:48:17,154 INFO L87 Difference]: Start difference. First operand 43 states and 96 transitions. Second operand has 26 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:20,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:48:20,682 INFO L93 Difference]: Finished difference Result 181 states and 393 transitions. [2022-03-15 20:48:20,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-15 20:48:20,682 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:48:20,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:48:20,683 INFO L225 Difference]: With dead ends: 181 [2022-03-15 20:48:20,683 INFO L226 Difference]: Without dead ends: 164 [2022-03-15 20:48:20,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1858 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=949, Invalid=5857, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 20:48:20,685 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 116 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:48:20,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 1 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:48:20,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-03-15 20:48:20,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 59. [2022-03-15 20:48:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 2.4482758620689653) internal successors, (142), 58 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 142 transitions. [2022-03-15 20:48:20,696 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 142 transitions. Word has length 13 [2022-03-15 20:48:20,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:48:20,696 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 142 transitions. [2022-03-15 20:48:20,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:20,696 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 142 transitions. [2022-03-15 20:48:20,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:48:20,697 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:48:20,697 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:48:20,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 20:48:20,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:48:20,913 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:48:20,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:48:20,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1287276360, now seen corresponding path program 5 times [2022-03-15 20:48:20,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:48:20,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529582568] [2022-03-15 20:48:20,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:48:20,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:48:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:48:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:20,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:48:20,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529582568] [2022-03-15 20:48:20,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529582568] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:48:20,988 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:48:20,988 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 20:48:20,989 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [827132276] [2022-03-15 20:48:20,989 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:48:20,989 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:48:20,991 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 39 transitions. [2022-03-15 20:48:20,991 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:48:22,842 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [1801#(< (+ 3 i2) n), 1802#(or (< (+ 3 i2) n) (<= (+ n 1) i1)), 1804#(or (< (+ 3 i2) n) (<= n (+ i1 1))), 1805#(or (< (+ 3 i2) n) (<= n (+ 2 i1))), 1803#(or (< (+ 3 i2) n) (<= n i1))] [2022-03-15 20:48:22,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:48:22,842 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:48:22,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:48:22,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:48:22,843 INFO L87 Difference]: Start difference. First operand 59 states and 142 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:22,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:48:22,915 INFO L93 Difference]: Finished difference Result 69 states and 148 transitions. [2022-03-15 20:48:22,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 20:48:22,915 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:48:22,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:48:22,916 INFO L225 Difference]: With dead ends: 69 [2022-03-15 20:48:22,916 INFO L226 Difference]: Without dead ends: 59 [2022-03-15 20:48:22,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:48:22,917 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:48:22,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 1 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:48:22,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-03-15 20:48:22,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-03-15 20:48:22,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 2.3793103448275863) internal successors, (138), 58 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:22,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 138 transitions. [2022-03-15 20:48:22,920 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 138 transitions. Word has length 13 [2022-03-15 20:48:22,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:48:22,920 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 138 transitions. [2022-03-15 20:48:22,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:22,920 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 138 transitions. [2022-03-15 20:48:22,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:48:22,921 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:48:22,921 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:48:22,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 20:48:22,921 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:48:22,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:48:22,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2049124205, now seen corresponding path program 3 times [2022-03-15 20:48:22,939 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:48:22,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663424935] [2022-03-15 20:48:22,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:48:22,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:48:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:48:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:23,079 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:48:23,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663424935] [2022-03-15 20:48:23,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663424935] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:48:23,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419265480] [2022-03-15 20:48:23,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:48:23,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:48:23,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:48:23,081 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:48:23,081 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:48:23,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 20:48:23,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:48:23,108 WARN L261 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 20:48:23,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:48:27,059 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:48:27,060 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 27 treesize of output 99 [2022-03-15 20:48:27,205 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:27,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:48:28,243 INFO L353 Elim1Store]: treesize reduction 25, result has 93.1 percent of original size [2022-03-15 20:48:28,243 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 23 treesize of output 371 [2022-03-15 20:49:00,524 INFO L353 Elim1Store]: treesize reduction 25, result has 94.3 percent of original size [2022-03-15 20:49:00,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 20 new quantified variables, introduced 55 case distinctions, treesize of input 25 treesize of output 455 [2022-03-15 20:50:48,424 INFO L353 Elim1Store]: treesize reduction 20, result has 93.1 percent of original size [2022-03-15 20:50:48,425 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 16 new quantified variables, introduced 36 case distinctions, treesize of input 21 treesize of output 300 [2022-03-15 20:51:04,897 INFO L353 Elim1Store]: treesize reduction 25, result has 95.3 percent of original size [2022-03-15 20:51:04,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 22 new quantified variables, introduced 66 case distinctions, treesize of input 27 treesize of output 547 [2022-03-15 20:53:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:41,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419265480] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:53:41,326 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:53:41,326 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 20:53:41,326 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1840874946] [2022-03-15 20:53:41,327 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:53:41,327 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:53:41,330 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 54 transitions. [2022-03-15 20:53:41,330 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:53:44,761 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [2110#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (= (select f (select f (select f (select f x1)))) x2)), 2114#(and (or (<= (+ 5 i2) n) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (not (< (+ i1 1) n)) (= (select f (select f x1)) (select f (select f (select f (select f (select f x2)))))) (< (+ 2 i1) n)) (or (<= n (+ 5 i2)) (not (< (+ i1 1) n)) (< (+ 2 i1) n))), 2102#(or (<= n (+ 2 i1)) (< (+ 3 i1) n) (= (select f (select f (select f x1))) x2)), 2105#(and (or (not (< (+ i1 1) n)) (< (+ 2 i1) n) (<= (+ i2 1) n)) (or (not (< (+ i1 1) n)) (< (+ 2 i1) n) (= (select f (select f x1)) (select f x2))) (or (<= n (+ i2 1)) (not (< (+ i1 1) n)) (< (+ 2 i1) n))), 2112#(and (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (= (select f (select f (select f (select f x1)))) (select f x2))) (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (<= (+ i2 1) n)) (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (<= n (+ i2 1)))), 2116#(and (or (<= (+ 5 i2) n) (< (+ i1 4) n) (not (< (+ 3 i1) n))) (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (<= n (+ 5 i2))) (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (= (select f (select f (select f (select f x1)))) (select f (select f (select f (select f (select f x2)))))))), 2108#(and (or (<= (+ 5 i2) n) (< (+ i1 1) n) (not (< i1 n))) (or (= (select f x1) (select f (select f (select f (select f (select f x2)))))) (< (+ i1 1) n) (not (< i1 n))) (or (<= n (+ 5 i2)) (< (+ i1 1) n) (not (< i1 n)))), 2100#(or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n))), 2117#(and (or (<= (+ 5 i2) n) (not (< (+ i1 4) n)) (< (+ 5 i1) n)) (or (not (< (+ i1 4) n)) (= (select f (select f (select f (select f (select f x1))))) (select f (select f (select f (select f (select f x2)))))) (< (+ 5 i1) n)) (or (not (< (+ i1 4) n)) (<= n (+ 5 i2)) (< (+ 5 i1) n))), 2106#(and (or (<= n (+ i2 1)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (not (< (+ 2 i1) n)) (< (+ 3 i1) n) (<= (+ i2 1) n)) (or (= (select f (select f (select f x1))) (select f x2)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 2115#(and (or (= (select f (select f (select f x1))) (select f (select f (select f (select f (select f x2)))))) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (<= (+ 5 i2) n) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (<= n (+ 5 i2)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 2104#(and (or (= (select f x1) (select f x2)) (< (+ i1 1) n) (not (< i1 n))) (or (< (+ i1 1) n) (not (< i1 n)) (<= (+ i2 1) n)) (or (<= n (+ i2 1)) (< (+ i1 1) n) (not (< i1 n)))), 2109#(and (or (= (select f (select f (select f (select f (select f x2))))) x1) (not (< (+ 3 i2) n))) (or (<= (+ 5 i2) n) (not (< (+ 3 i2) n))) (<= n (+ 5 i2))), 2113#(and (or (not (< (+ i1 4) n)) (<= n (+ i2 1)) (< (+ 5 i1) n)) (or (not (< (+ i1 4) n)) (<= (+ i2 1) n) (< (+ 5 i1) n)) (or (not (< (+ i1 4) n)) (= (select f (select f (select f (select f (select f x1))))) (select f x2)) (< (+ 5 i1) n))), 2099#(or (< i1 n) (= x2 x1)), 2111#(or (<= n (+ i1 4)) (= (select f (select f (select f (select f (select f x1))))) x2) (< (+ 5 i1) n)), 2101#(or (= (select f (select f x1)) x2) (< (+ 2 i1) n) (<= n (+ i1 1))), 2107#(and (or (= (select f (select f (select f (select f (select f x2))))) x1) (< i1 n)) (or (<= (+ 5 i2) n) (< i1 n)) (or (< i1 n) (<= n (+ 5 i2)))), 2103#(and (or (< i1 n) (<= (+ i2 1) n)) (or (< i1 n) (= x1 (select f x2))) (or (< i1 n) (<= n (+ i2 1))))] [2022-03-15 20:53:44,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 20:53:44,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:53:44,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 20:53:44,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1820, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 20:53:44,763 INFO L87 Difference]: Start difference. First operand 59 states and 138 transitions. Second operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:53:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:53:49,699 INFO L93 Difference]: Finished difference Result 262 states and 525 transitions. [2022-03-15 20:53:49,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 20:53:49,700 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:53:49,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:53:49,701 INFO L225 Difference]: With dead ends: 262 [2022-03-15 20:53:49,702 INFO L226 Difference]: Without dead ends: 240 [2022-03-15 20:53:49,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2361 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1335, Invalid=8367, Unknown=0, NotChecked=0, Total=9702 [2022-03-15 20:53:49,705 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 297 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:53:49,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 1 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:53:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-03-15 20:53:49,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 81. [2022-03-15 20:53:49,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 2.425) internal successors, (194), 80 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:53:49,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 194 transitions. [2022-03-15 20:53:49,712 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 194 transitions. Word has length 14 [2022-03-15 20:53:49,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:53:49,712 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 194 transitions. [2022-03-15 20:53:49,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:53:49,712 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 194 transitions. [2022-03-15 20:53:49,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:53:49,713 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:53:49,713 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:53:49,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 20:53:49,919 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:53:49,919 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:53:49,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:53:49,920 INFO L85 PathProgramCache]: Analyzing trace with hash -23046706, now seen corresponding path program 4 times [2022-03-15 20:53:49,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:53:49,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763460454] [2022-03-15 20:53:49,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:53:49,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:53:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:53:50,076 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:50,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:53:50,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763460454] [2022-03-15 20:53:50,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763460454] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:53:50,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123064108] [2022-03-15 20:53:50,077 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:53:50,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:50,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:53:50,078 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:53:50,078 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:53:50,105 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:53:50,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:53:50,106 WARN L261 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-15 20:53:50,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:53:50,393 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:53:50,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 31 treesize of output 142 [2022-03-15 20:53:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:50,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:53:52,177 INFO L353 Elim1Store]: treesize reduction 25, result has 94.3 percent of original size [2022-03-15 20:53:52,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 20 new quantified variables, introduced 55 case distinctions, treesize of input 25 treesize of output 455 [2022-03-15 20:54:47,609 INFO L353 Elim1Store]: treesize reduction 30, result has 94.3 percent of original size [2022-03-15 20:54:47,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 22 new quantified variables, introduced 66 case distinctions, treesize of input 27 treesize of output 542 [2022-03-15 20:58:04,301 INFO L353 Elim1Store]: treesize reduction 20, result has 94.5 percent of original size [2022-03-15 20:58:04,302 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 23 treesize of output 376 [2022-03-15 20:58:35,537 INFO L353 Elim1Store]: treesize reduction 30, result has 95.2 percent of original size [2022-03-15 20:58:35,537 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 24 new quantified variables, introduced 78 case distinctions, treesize of input 29 treesize of output 642 Received shutdown request... [2022-03-15 21:01:20,239 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 21:01:20,240 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2022-03-15 21:01:20,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-15 21:01:20,263 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 21:01:20,263 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 21:01:20,442 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 21:01:20,444 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 16 with TraceHistMax 6,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 19ms.. [2022-03-15 21:01:20,446 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 21:01:20,446 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 21:01:20,447 INFO L732 BasicCegarLoop]: Path program histogram: [5, 4, 1] [2022-03-15 21:01:20,449 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 21:01:20,449 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 21:01:20,450 INFO L202 PluginConnector]: Adding new model unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 09:01:20 BasicIcfg [2022-03-15 21:01:20,450 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 21:01:20,451 INFO L158 Benchmark]: Toolchain (without parser) took 826481.89ms. Allocated memory was 166.7MB in the beginning and 860.9MB in the end (delta: 694.2MB). Free memory was 127.3MB in the beginning and 394.9MB in the end (delta: -267.6MB). Peak memory consumption was 523.7MB. Max. memory is 8.0GB. [2022-03-15 21:01:20,451 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.52ms. Allocated memory is still 166.7MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 21:01:20,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.91ms. Allocated memory is still 166.7MB. Free memory was 127.2MB in the beginning and 125.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:01:20,451 INFO L158 Benchmark]: Boogie Preprocessor took 11.97ms. Allocated memory is still 166.7MB. Free memory was 125.7MB in the beginning and 124.8MB in the end (delta: 894.8kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:01:20,451 INFO L158 Benchmark]: RCFGBuilder took 293.07ms. Allocated memory is still 166.7MB. Free memory was 124.7MB in the beginning and 113.2MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-15 21:01:20,451 INFO L158 Benchmark]: TraceAbstraction took 826139.27ms. Allocated memory was 166.7MB in the beginning and 860.9MB in the end (delta: 694.2MB). Free memory was 112.7MB in the beginning and 394.9MB in the end (delta: -282.2MB). Peak memory consumption was 509.1MB. Max. memory is 8.0GB. [2022-03-15 21:01:20,452 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.52ms. Allocated memory is still 166.7MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.91ms. Allocated memory is still 166.7MB. Free memory was 127.2MB in the beginning and 125.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 11.97ms. Allocated memory is still 166.7MB. Free memory was 125.7MB in the beginning and 124.8MB in the end (delta: 894.8kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 293.07ms. Allocated memory is still 166.7MB. Free memory was 124.7MB in the beginning and 113.2MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 826139.27ms. Allocated memory was 166.7MB in the beginning and 860.9MB in the end (delta: 694.2MB). Free memory was 112.7MB in the beginning and 394.9MB in the end (delta: -282.2MB). Peak memory consumption was 509.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, 21 PlacesBefore, 18 PlacesAfterwards, 16 TransitionsBefore, 13 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 19 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19, positive: 19, positive conditional: 0, positive unconditional: 19, 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: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 19, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , 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: 65]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 16 with TraceHistMax 6,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 19ms.. - TimeoutResultAtElement [Line: 60]: 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 16 with TraceHistMax 6,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 19ms.. - TimeoutResultAtElement [Line: 60]: 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 16 with TraceHistMax 6,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 19ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 22 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 826.0s, OverallIterations: 10, TraceHistogramMax: 6, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 691 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 691 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 751 mSDsCounter, 671 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3603 IncrementalHoareTripleChecker+Invalid, 4274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 671 mSolverCounterUnsat, 9 mSDtfsCounter, 3603 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 471 GetRequests, 115 SyntacticMatches, 6 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5393 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=9, InterpolantAutomatonStates: 258, 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, 9 MinimizatonAttempts, 406 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 345.2s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 241 ConstructedInterpolants, 0 QuantifiedInterpolants, 4217 SizeOfPredicates, 27 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 33/177 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