/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/chl/name-comparator-symm.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:03:08,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:03:08,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:03:08,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:03:08,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:03:08,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:03:08,828 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:03:08,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:03:08,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:03:08,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:03:08,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:03:08,837 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:03:08,837 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:03:08,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:03:08,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:03:08,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:03:08,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:03:08,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:03:08,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:03:08,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:03:08,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:03:08,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:03:08,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:03:08,856 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:03:08,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:03:08,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:03:08,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:03:08,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:03:08,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:03:08,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:03:08,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:03:08,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:03:08,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:03:08,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:03:08,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:03:08,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:03:08,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:03:08,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:03:08,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:03:08,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:03:08,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:03:08,871 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 21:03:08,900 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:03:08,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:03:08,902 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:03:08,902 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:03:08,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:03:08,902 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:03:08,903 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:03:08,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:03:08,903 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:03:08,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:03:08,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:03:08,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:03:08,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:03:08,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:03:08,904 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:03:08,904 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:03:08,904 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:03:08,905 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:03:08,905 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:03:08,905 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:03:08,905 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:03:08,905 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:03:08,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:03:08,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:03:08,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:03:08,906 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:03:08,906 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:03:08,907 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:03:08,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:03:08,907 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:03:08,907 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:03:08,907 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:03:08,907 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 21:03:09,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:03:09,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:03:09,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:03:09,123 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:03:09,128 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:03:09,129 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-symm.wvr.bpl [2022-03-15 21:03:09,129 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-symm.wvr.bpl' [2022-03-15 21:03:09,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:03:09,151 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:03:09,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:03:09,152 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:03:09,152 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:03:09,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:09" (1/1) ... [2022-03-15 21:03:09,169 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:09" (1/1) ... [2022-03-15 21:03:09,174 INFO L137 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:03:09,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:03:09,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:03:09,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:03:09,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:03:09,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:09" (1/1) ... [2022-03-15 21:03:09,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:09" (1/1) ... [2022-03-15 21:03:09,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:09" (1/1) ... [2022-03-15 21:03:09,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:09" (1/1) ... [2022-03-15 21:03:09,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:09" (1/1) ... [2022-03-15 21:03:09,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:09" (1/1) ... [2022-03-15 21:03:09,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:09" (1/1) ... [2022-03-15 21:03:09,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:03:09,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:03:09,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:03:09,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:03:09,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:09" (1/1) ... [2022-03-15 21:03:09,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:03:09,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:03:09,214 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 21:03:09,240 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 21:03:09,255 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:03:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:03:09,256 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:03:09,256 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:03:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:03:09,256 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:03:09,256 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:03:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:03:09,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:03:09,257 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 21:03:09,302 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:03:09,303 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:03:09,431 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:03:09,522 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:03:09,522 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 21:03:09,524 INFO L202 PluginConnector]: Adding new model name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:03:09 BoogieIcfgContainer [2022-03-15 21:03:09,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:03:09,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:03:09,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:03:09,529 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:03:09,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:09" (1/2) ... [2022-03-15 21:03:09,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c0b947 and model type name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:03:09, skipping insertion in model container [2022-03-15 21:03:09,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:03:09" (2/2) ... [2022-03-15 21:03:09,531 INFO L111 eAbstractionObserver]: Analyzing ICFG name-comparator-symm.wvr.bpl [2022-03-15 21:03:09,535 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:03:09,535 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:03:09,535 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:03:09,535 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:03:09,564 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 21:03:09,603 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:03:09,619 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 21:03:09,620 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 21:03:09,628 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:03:09,636 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 18 transitions, 52 flow [2022-03-15 21:03:09,638 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 18 transitions, 52 flow [2022-03-15 21:03:09,639 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 23 places, 18 transitions, 52 flow [2022-03-15 21:03:09,658 INFO L129 PetriNetUnfolder]: 2/16 cut-off events. [2022-03-15 21:03:09,659 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 21:03:09,661 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 16 events. 2/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2022-03-15 21:03:09,662 INFO L116 LiptonReduction]: Number of co-enabled transitions 48 [2022-03-15 21:03:09,778 INFO L131 LiptonReduction]: Checked pairs total: 26 [2022-03-15 21:03:09,778 INFO L133 LiptonReduction]: Total number of compositions: 5 [2022-03-15 21:03:09,784 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 19 places, 14 transitions, 44 flow [2022-03-15 21:03:09,796 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 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 21:03:09,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 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 21:03:09,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 21:03:09,802 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:03:09,802 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:03:09,803 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:03:09,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:03:09,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1580973761, now seen corresponding path program 1 times [2022-03-15 21:03:09,822 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:03:09,823 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032766784] [2022-03-15 21:03:09,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:03:09,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:03:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:03:10,104 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 21:03:10,105 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:03:10,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032766784] [2022-03-15 21:03:10,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032766784] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:03:10,106 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:03:10,106 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 21:03:10,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1576791537] [2022-03-15 21:03:10,108 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:03:10,114 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:03:10,127 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 25 transitions. [2022-03-15 21:03:10,127 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:03:10,884 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [72#(and (or (not (= name_2 name_1)) (= i_8 0)) (or (= result_7 0) (not (= name_2 name_1)))), 73#(and (or (= result_3 0) (not break_6)) (or (< i_4 3) (= name_2 name_1)) (or (= name_2 name_1) (not break_6))), 70#(and (or (= (+ (* (- 1) name_1) name_2) 0) (< i_8 3)) (= result_7 0) (= result_3 0)), 71#(and (or (= result_3 0) (not break_6)) (or (= result_7 0) (not break_6)) (or (not break_6) (= i_8 0)) (or (< i_4 3) (= i_8 0)) (or (< i_4 3) (= result_7 0)) (or (= 0 (+ name_1 (* (- 1) name_2))) (< i_4 3) break_6)), 69#(or (= result_7 0) (not (= name_2 name_1))), 74#(and (= result_3 0) (or (= result_7 0) (= name_2 name_1))), 68#(and (or (= result_3 0) (not break_6)) (or (= result_7 0) (not break_6)) (or (< i_4 3) (= result_7 0)) (or (= 0 (+ name_1 (* (- 1) name_2))) (< i_4 3) break_6))] [2022-03-15 21:03:10,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 21:03:10,886 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:03:10,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 21:03:10,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-03-15 21:03:10,912 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 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) Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:03:11,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:03:11,169 INFO L93 Difference]: Finished difference Result 48 states and 88 transitions. [2022-03-15 21:03:11,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:03:11,172 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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 21:03:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:03:11,180 INFO L225 Difference]: With dead ends: 48 [2022-03-15 21:03:11,180 INFO L226 Difference]: Without dead ends: 45 [2022-03-15 21:03:11,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:03:11,184 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:03:11,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:03:11,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-03-15 21:03:11,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 29. [2022-03-15 21:03:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:03:11,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 55 transitions. [2022-03-15 21:03:11,215 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 55 transitions. Word has length 9 [2022-03-15 21:03:11,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:03:11,216 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 55 transitions. [2022-03-15 21:03:11,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:03:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 55 transitions. [2022-03-15 21:03:11,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 21:03:11,216 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:03:11,217 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:03:11,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:03:11,217 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:03:11,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:03:11,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1774663279, now seen corresponding path program 1 times [2022-03-15 21:03:11,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:03:11,219 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118790679] [2022-03-15 21:03:11,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:03:11,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:03:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:03:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:03:11,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:03:11,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118790679] [2022-03-15 21:03:11,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118790679] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:03:11,258 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:03:11,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 21:03:11,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [572878051] [2022-03-15 21:03:11,259 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:03:11,260 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:03:11,262 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 32 transitions. [2022-03-15 21:03:11,263 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:03:11,659 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [194#(and (or (< i_4 3) break_10) (or break_10 (not break_6))), 193#(and (< i_4 3) (not break_6)), 195#(not (= name_2 name_1)), 196#(or break_10 (not (= name_2 name_1))), 197#(and (or (< i_4 3) (= name_2 name_1)) (or (= name_2 name_1) (not break_6)))] [2022-03-15 21:03:11,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 21:03:11,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:03:11,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 21:03:11,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-03-15 21:03:11,664 INFO L87 Difference]: Start difference. First operand 29 states and 55 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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 21:03:11,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:03:11,791 INFO L93 Difference]: Finished difference Result 39 states and 71 transitions. [2022-03-15 21:03:11,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 21:03:11,791 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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) Word has length 10 [2022-03-15 21:03:11,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:03:11,792 INFO L225 Difference]: With dead ends: 39 [2022-03-15 21:03:11,792 INFO L226 Difference]: Without dead ends: 34 [2022-03-15 21:03:11,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-03-15 21:03:11,794 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:03:11,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:03:11,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-03-15 21:03:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 22. [2022-03-15 21:03:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:03:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 41 transitions. [2022-03-15 21:03:11,803 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 41 transitions. Word has length 10 [2022-03-15 21:03:11,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:03:11,803 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 41 transitions. [2022-03-15 21:03:11,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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 21:03:11,804 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 41 transitions. [2022-03-15 21:03:11,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 21:03:11,804 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:03:11,804 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:03:11,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 21:03:11,805 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:03:11,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:03:11,805 INFO L85 PathProgramCache]: Analyzing trace with hash -918402723, now seen corresponding path program 1 times [2022-03-15 21:03:11,806 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:03:11,806 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266970861] [2022-03-15 21:03:11,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:03:11,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:03:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:03:11,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:03:11,844 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:03:11,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266970861] [2022-03-15 21:03:11,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266970861] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:03:11,844 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:03:11,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 21:03:11,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [60615336] [2022-03-15 21:03:11,844 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:03:11,845 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:03:11,847 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 32 transitions. [2022-03-15 21:03:11,847 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:03:12,214 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [292#break_6, 294#(and (or break_6 (not break_10)) (or break_6 (= i_8 0))), 296#(and (or (not break_10) (= name_2 name_1)) (or (= name_2 name_1) (= i_8 0))), 295#(and (not break_10) (< i_8 3)), 293#(= name_2 name_1)] [2022-03-15 21:03:12,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 21:03:12,214 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:03:12,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 21:03:12,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-03-15 21:03:12,215 INFO L87 Difference]: Start difference. First operand 22 states and 41 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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 21:03:12,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:03:12,328 INFO L93 Difference]: Finished difference Result 29 states and 54 transitions. [2022-03-15 21:03:12,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 21:03:12,329 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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) Word has length 10 [2022-03-15 21:03:12,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:03:12,330 INFO L225 Difference]: With dead ends: 29 [2022-03-15 21:03:12,330 INFO L226 Difference]: Without dead ends: 27 [2022-03-15 21:03:12,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-03-15 21:03:12,331 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:03:12,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:03:12,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-03-15 21:03:12,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-03-15 21:03:12,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:03:12,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 51 transitions. [2022-03-15 21:03:12,335 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 51 transitions. Word has length 10 [2022-03-15 21:03:12,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:03:12,335 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 51 transitions. [2022-03-15 21:03:12,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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 21:03:12,335 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 51 transitions. [2022-03-15 21:03:12,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 21:03:12,336 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:03:12,336 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:03:12,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 21:03:12,336 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:03:12,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:03:12,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1585169715, now seen corresponding path program 1 times [2022-03-15 21:03:12,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:03:12,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934137869] [2022-03-15 21:03:12,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:03:12,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:03:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:03:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:03:12,532 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:03:12,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934137869] [2022-03-15 21:03:12,532 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934137869] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:03:12,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983843135] [2022-03-15 21:03:12,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:03:12,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:03:12,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:03:12,539 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 21:03:12,546 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 21:03:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:03:12,591 WARN L261 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 21:03:12,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:03:13,035 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 132 treesize of output 104 [2022-03-15 21:03:13,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:03:13,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:03:14,073 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:03:14,074 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 136 [2022-03-15 21:03:14,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:03:14,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983843135] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:03:14,241 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:03:14,241 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 21:03:14,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [383770677] [2022-03-15 21:03:14,241 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:03:14,242 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:03:14,245 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 41 transitions. [2022-03-15 21:03:14,245 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:03:18,001 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [477#(and (or (= (+ result_3 1) 0) (not (= name_2 (select nondet_0 0))) (= name_2 name_1)) (or (= result_3 1) (not (= name_1 (select nondet_0 0))) (= name_2 name_1))), 470#(and (or (not (< i_4 3)) break_10 break_6 (< i_4 2) (<= i_8 1)) (or (= (+ name_1 (* (- 1) name_2)) 1) (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) break_6 (< i_4 2) (= (+ (- 1) result_7) 0) (not break_10)) (or (not (< i_4 3)) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 2) (not break_10) (= (+ name_1 (* (- 1) name_2) 1) 0) (= (+ result_7 1) 0)) (or (not (< i_4 3)) break_10 break_6 (not (= name_2 (select nondet_0 i_4))) (<= i_8 1)) (or (not (< i_4 3)) break_10 break_6 (not (= name_1 (select nondet_0 i_4))) (<= i_8 1)) (or (not (< i_4 3)) break_6 (not break_10) (not (= name_1 (select nondet_0 i_4))) (= (+ result_7 1) 0)) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) break_6 (not (= name_2 (select nondet_0 i_4))) (not break_10) (= result_7 1))), 465#(and (or (= (+ result_3 1) 0) break_10 (not (= name_2 (select nondet_0 i_8))) (not (< i_8 3))) (or (= result_3 1) (= name_2 (select nondet_0 i_8)) break_10 (< i_8 2) (not (< i_8 3)) (= (+ (- 1) (* (- 1) name_1) name_2) 0)) (or (= name_1 (select nondet_0 i_8)) (= (+ result_3 1) 0) (= (+ (* (- 1) name_1) name_2 1) 0) break_10 (< i_8 2) (not (< i_8 3))) (or (= result_3 1) (= name_2 (select nondet_0 i_8)) break_10 (not (= name_1 (select nondet_0 i_8))) (not (< i_8 3)))), 467#(and (or (not (< i_4 3)) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 2) (= (+ name_1 (* (- 1) name_2) 1) 0) (= (+ result_7 1) 0)) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) break_6 (not (= name_2 (select nondet_0 i_4))) (= result_7 1)) (or (= (+ name_1 (* (- 1) name_2)) 1) (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) break_6 (< i_4 2) (= (+ (- 1) result_7) 0)) (or (not (< i_4 3)) break_6 (not (= name_1 (select nondet_0 i_4))) (= (+ result_7 1) 0))), 473#(and (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_8))) (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))) (= i_8 0)) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))) (not (= name_1 (select nondet_0 i_8)))) (or break_6 (< i_4 2) (<= 3 i_4) (= i_8 0)) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_8))) (= name_2 (select nondet_0 i_4)) (< i_4 2) (= (+ name_1 (* (- 1) name_2) 1) 0)) (or (= (+ name_1 (* (- 1) name_2)) 1) (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) break_6 (< i_4 2) (not (= name_1 (select nondet_0 i_8)))) (or (not (< i_4 3)) break_6 (not (= name_1 (select nondet_0 i_4))) (= i_8 0))), 466#(and (or (= (+ result_3 1) 0) (= (+ result_7 1) 0) (not break_6)) (or (< i_4 3) break_6 (= (+ name_1 (* (- 1) name_2) 1) 0) (= (+ result_7 1) 0)) (or (= result_3 1) (= (+ (- 1) result_7) 0) (not break_6)) (or (= (+ name_1 (* (- 1) name_2)) 1) (< i_4 3) break_6 (= (+ (- 1) result_7) 0))), 474#(and (or (= (+ name_1 (* (- 1) name_2)) 1) (< i_4 3) break_6 (not (= name_1 (select nondet_0 0)))) (or (< i_4 3) (not (= name_2 (select nondet_0 0))) break_6 (= (+ name_1 (* (- 1) name_2) 1) 0)) (or (= (+ result_3 1) 0) (not (= name_2 (select nondet_0 0))) (not break_6)) (or (= result_3 1) (not (= name_1 (select nondet_0 0))) (not break_6))), 475#(and (or (not (< i_4 3)) (not (= name_2 (select nondet_0 0))) break_6 (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) (not (= name_2 (select nondet_0 0))) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 2) (= (+ name_1 (* (- 1) name_2) 1) 0)) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))) (not (= name_1 (select nondet_0 0)))) (or (= (+ name_1 (* (- 1) name_2)) 1) (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) break_6 (< i_4 2) (not (= name_1 (select nondet_0 0))))), 472#(and (or (= (+ name_1 (* (- 1) name_2)) 1) (< i_4 3) break_6 (not (= name_1 (select nondet_0 i_8)))) (or (= result_3 1) (not (= name_1 (select nondet_0 i_8))) (not break_6)) (or (not break_6) (= i_8 0)) (or (< i_4 3) (= i_8 0)) (or (< i_4 3) break_6 (not (= name_2 (select nondet_0 i_8))) (= (+ name_1 (* (- 1) name_2) 1) 0)) (or (= (+ result_3 1) 0) (not (= name_2 (select nondet_0 i_8))) (not break_6))), 471#(and (or (not (= name_2 (select nondet_0 0))) break_10 (= name_2 name_1) (<= i_8 1)) (or (not (= name_2 (select nondet_0 0))) (not break_10) (= result_7 1) (= name_2 name_1)) (or (not (= name_1 (select nondet_0 0))) (not break_10) (= (+ result_7 1) 0) (= name_2 name_1)) (or break_10 (not (= name_1 (select nondet_0 0))) (= name_2 name_1) (<= i_8 1))), 464#(and (or (= (+ result_3 1) 0) (not break_10) (= (+ result_7 1) 0)) (or (= (+ result_3 1) 0) (= (+ (* (- 1) name_1) name_2 1) 0) break_10 (< i_8 3)) (or (= result_3 1) (= (+ (- 1) result_7) 0) (not break_10)) (or (= result_3 1) break_10 (< i_8 3) (= (+ (- 1) (* (- 1) name_1) name_2) 0))), 468#(and (or (not (= name_2 (select nondet_0 0))) (= result_7 1) (= name_2 name_1)) (or (not (= name_1 (select nondet_0 0))) (= (+ result_7 1) 0) (= name_2 name_1))), 469#(and (or (= (+ name_1 (* (- 1) name_2)) 1) (< i_4 3) break_6 (not break_10) (= result_7 1)) (or (< i_4 3) break_10 (<= i_8 1)) (or (< i_4 3) break_6 (not break_10) (= (+ name_1 (* (- 1) name_2) 1) 0) (= (+ result_7 1) 0)) (or break_10 (not break_6) (<= i_8 1)) (or (= result_3 1) (not break_10) (= result_7 1) (not break_6)) (or (= (+ result_3 1) 0) (not break_10) (= (+ result_7 1) 0) (not break_6))), 476#(and (or (not (= name_2 (select nondet_0 0))) (= name_2 name_1) (= i_8 0)) (or (not (= name_1 (select nondet_0 0))) (= name_2 name_1) (= i_8 0)))] [2022-03-15 21:03:18,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 21:03:18,002 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:03:18,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 21:03:18,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2022-03-15 21:03:18,003 INFO L87 Difference]: Start difference. First operand 27 states and 51 transitions. Second operand has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:03:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:03:30,144 INFO L93 Difference]: Finished difference Result 205 states and 333 transitions. [2022-03-15 21:03:30,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-03-15 21:03:30,153 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 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 21:03:30,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:03:30,158 INFO L225 Difference]: With dead ends: 205 [2022-03-15 21:03:30,159 INFO L226 Difference]: Without dead ends: 190 [2022-03-15 21:03:30,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2728 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=1581, Invalid=8121, Unknown=0, NotChecked=0, Total=9702 [2022-03-15 21:03:30,165 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 320 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:03:30,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 0 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:03:30,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-03-15 21:03:30,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 44. [2022-03-15 21:03:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 2.13953488372093) internal successors, (92), 43 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:03:30,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 92 transitions. [2022-03-15 21:03:30,183 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 92 transitions. Word has length 11 [2022-03-15 21:03:30,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:03:30,183 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 92 transitions. [2022-03-15 21:03:30,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:03:30,184 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 92 transitions. [2022-03-15 21:03:30,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 21:03:30,184 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:03:30,184 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:03:30,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 21:03:30,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:03:30,401 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:03:30,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:03:30,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1886503965, now seen corresponding path program 2 times [2022-03-15 21:03:30,403 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:03:30,403 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834656273] [2022-03-15 21:03:30,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:03:30,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:03:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:03:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:03:30,490 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:03:30,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834656273] [2022-03-15 21:03:30,490 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834656273] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:03:30,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208733337] [2022-03-15 21:03:30,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:03:30,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:03:30,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:03:30,491 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 21:03:30,496 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 21:03:30,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:03:30,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:03:30,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 21:03:30,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:03:30,637 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 54 treesize of output 42 [2022-03-15 21:03:30,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:03:30,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:03:30,722 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:03:30,722 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 40 [2022-03-15 21:03:30,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:03:30,745 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208733337] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:03:30,745 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:03:30,745 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2022-03-15 21:03:30,745 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1415223444] [2022-03-15 21:03:30,745 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:03:30,746 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:03:30,750 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 50 transitions. [2022-03-15 21:03:30,750 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:03:32,587 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [979#(or (and (< i_4 3) (not break_6)) (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0))), 999#(and (or (= name_2 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (= name_1 (select nondet_0 0)) (= name_2 name_1)) (or (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= (select nondet_0 1) name_1)))), 988#(and (or (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 i_8)) (not break_6)) (or (= name_1 (select nondet_0 i_8)) (< i_4 3) (= name_2 (select nondet_0 i_8)))), 989#(and (or (not (< i_4 3)) break_6 (< i_4 2)) (or (not (< i_4 3)) break_6 (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))))), 995#(and (or (not (= name_1 (select nondet_0 0))) (= name_2 name_1)) (or (not (= name_2 (select nondet_0 0))) (= name_2 name_1))), 996#(and (or (not (= name_2 (select nondet_0 0))) break_10 (= name_2 name_1)) (or break_10 (not (= name_1 (select nondet_0 0))) (= name_2 name_1))), 992#(and (or (not (< i_4 3)) (= name_2 (select nondet_0 0)) break_6 (not (= name_2 (select nondet_0 i_4))) (= name_1 (select nondet_0 0))) (or (not (< i_4 3)) (= name_2 (select nondet_0 0)) break_6 (= name_1 (select nondet_0 0)) (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) (= name_2 (select nondet_0 0)) break_6 (< i_4 2) (= name_1 (select nondet_0 0)))), 997#(and (or (= name_1 (select nondet_0 i_8)) (not (= name_2 (select nondet_0 0))) (= name_2 (select nondet_0 i_8)) (= name_2 name_1)) (or (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 i_8)) (not (= name_1 (select nondet_0 0))) (= name_2 name_1))), 998#(and (or (not (< i_8 2)) (= name_1 (select nondet_0 i_8)) (not (= name_2 (select nondet_0 (+ i_8 1)))) (= name_2 (select nondet_0 i_8)) break_10) (or (not (< i_8 2)) (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 i_8)) break_10 (< i_8 1)) (or (not (< i_8 2)) (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 i_8)) break_10 (not (= name_1 (select nondet_0 (+ i_8 1)))))), 987#(and (or (< i_4 3) break_10) (or break_10 (not break_6))), 991#(and (or (not (< i_4 3)) (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 i_8)) break_6 (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 i_8)) break_6 (< i_4 2)) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 i_8)) break_6 (not (= name_2 (select nondet_0 i_4))))), 990#(and (or (not (< i_4 3)) break_10 break_6 (not (= name_2 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_10 break_6 (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_10 break_6 (< i_4 2))), 993#(and (not break_10) (< i_8 3)), 986#(and (< i_4 3) (not break_6)), 994#(and (or break_10 (< i_8 2) (not (< i_8 3))) (or break_10 (not (= name_2 (select nondet_0 i_8))) (not (< i_8 3))) (or break_10 (not (= name_1 (select nondet_0 i_8))) (not (< i_8 3))))] [2022-03-15 21:03:32,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 21:03:32,588 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:03:32,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 21:03:32,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-03-15 21:03:32,588 INFO L87 Difference]: Start difference. First operand 44 states and 92 transitions. Second operand has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 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 21:03:34,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:03:34,002 INFO L93 Difference]: Finished difference Result 68 states and 131 transitions. [2022-03-15 21:03:34,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 21:03:34,003 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 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) Word has length 12 [2022-03-15 21:03:34,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:03:34,003 INFO L225 Difference]: With dead ends: 68 [2022-03-15 21:03:34,004 INFO L226 Difference]: Without dead ends: 61 [2022-03-15 21:03:34,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=308, Invalid=1584, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 21:03:34,004 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:03:34,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:03:34,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-03-15 21:03:34,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2022-03-15 21:03:34,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:03:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 86 transitions. [2022-03-15 21:03:34,009 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 86 transitions. Word has length 12 [2022-03-15 21:03:34,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:03:34,009 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 86 transitions. [2022-03-15 21:03:34,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 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 21:03:34,009 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 86 transitions. [2022-03-15 21:03:34,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 21:03:34,010 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:03:34,010 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:03:34,027 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 21:03:34,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:03:34,211 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:03:34,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:03:34,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2120523869, now seen corresponding path program 3 times [2022-03-15 21:03:34,212 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:03:34,212 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644766762] [2022-03-15 21:03:34,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:03:34,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:03:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:03:34,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:03:34,298 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:03:34,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644766762] [2022-03-15 21:03:34,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644766762] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:03:34,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580063021] [2022-03-15 21:03:34,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:03:34,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:03:34,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:03:34,300 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 21:03:34,300 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 21:03:34,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 21:03:34,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:03:34,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 21:03:34,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:03:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:03:34,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:03:34,552 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:03:34,553 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2022-03-15 21:03:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:03:34,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580063021] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:03:34,578 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:03:34,578 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-03-15 21:03:34,578 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1523512977] [2022-03-15 21:03:34,578 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:03:34,580 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:03:34,583 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 50 transitions. [2022-03-15 21:03:34,583 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:03:36,321 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [1282#(and (or (not (< i_4 3)) break_6 (not break_10) (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_6 (< i_4 2) (<= i_8 1)) (or (not (< i_4 3)) break_6 (< i_4 2) (not break_10)) (or (not (< i_4 3)) break_6 (not (= name_1 (select nondet_0 i_4))) (<= i_8 1)) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))) (<= i_8 1)) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))) (not break_10))), 1279#(and (not (= name_2 (select nondet_0 0))) (not (= name_2 name_1)) (not (= name_1 (select nondet_0 0)))), 1286#(and (or (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (not break_10) (= name_2 name_1) (not (= (select nondet_0 1) name_1))) (or (= name_2 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (= name_1 (select nondet_0 0)) (= name_2 name_1) (<= i_8 1)) (or (= name_2 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (= name_1 (select nondet_0 0)) (not break_10) (= name_2 name_1)) (or (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (= name_2 name_1) (<= i_8 1) (not (= (select nondet_0 1) name_1)))), 1276#(and (< i_4 3) (not break_6)), 1281#(and (or (not break_10) (not break_6)) (or (< i_4 3) (not break_10)) (or (not break_6) (<= i_8 1)) (or (< i_4 3) (<= i_8 1))), 1287#(and (or (not break_10) (= name_2 name_1)) (= i_8 0)), 1288#(and (or break_6 (not (= name_1 (select nondet_0 0)))) (or break_6 (not (= name_2 name_1))) (or (not (= name_2 (select nondet_0 0))) break_6)), 1283#(and (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (< i_4 1))), 1285#(and (or (= name_2 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (= name_1 (select nondet_0 0)) (= name_2 name_1)) (or (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= (select nondet_0 1) name_1)))), 1277#(and (or break_10 (< i_8 2) (not (< i_8 3))) (or break_10 (not (= name_2 (select nondet_0 i_8))) (not (< i_8 3))) (or break_10 (not (= name_1 (select nondet_0 i_8))) (not (< i_8 3)))), 1284#(and (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1)))) (<= i_8 1)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4) (<= i_8 1)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (< i_4 1) (<= i_8 1)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (not break_10) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not break_10) (<= 2 i_4) (< i_4 1)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not break_10) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1)))))), 1280#(and (or (not (< i_4 3)) break_6 (< i_4 2)) (or (not (< i_4 3)) break_6 (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))))), 1251#(and (not break_10) (< i_8 3)), 1278#(and (or (not (= name_1 (select nondet_0 0))) (= name_2 name_1)) (or (not (= name_2 (select nondet_0 0))) (= name_2 name_1)))] [2022-03-15 21:03:36,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 21:03:36,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:03:36,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 21:03:36,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:03:36,322 INFO L87 Difference]: Start difference. First operand 43 states and 86 transitions. Second operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:03:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:03:38,536 INFO L93 Difference]: Finished difference Result 71 states and 140 transitions. [2022-03-15 21:03:38,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 21:03:38,537 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 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 21:03:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:03:38,537 INFO L225 Difference]: With dead ends: 71 [2022-03-15 21:03:38,537 INFO L226 Difference]: Without dead ends: 71 [2022-03-15 21:03:38,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=452, Invalid=2518, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 21:03:38,539 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:03:38,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:03:38,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-03-15 21:03:38,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2022-03-15 21:03:38,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 2.119047619047619) internal successors, (89), 42 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 21:03:38,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 89 transitions. [2022-03-15 21:03:38,542 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 89 transitions. Word has length 12 [2022-03-15 21:03:38,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:03:38,543 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 89 transitions. [2022-03-15 21:03:38,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:03:38,543 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 89 transitions. [2022-03-15 21:03:38,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 21:03:38,543 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:03:38,543 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:03:38,566 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 21:03:38,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:03:38,757 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:03:38,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:03:38,758 INFO L85 PathProgramCache]: Analyzing trace with hash 870604607, now seen corresponding path program 4 times [2022-03-15 21:03:38,759 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:03:38,759 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873876970] [2022-03-15 21:03:38,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:03:38,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:03:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:03:38,994 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 21:03:38,994 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:03:38,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873876970] [2022-03-15 21:03:38,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873876970] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:03:38,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714676501] [2022-03-15 21:03:38,994 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:03:38,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:03:38,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:03:39,002 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 21:03:39,003 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 21:03:39,035 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:03:39,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:03:39,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 21:03:39,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:03:39,562 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 160 treesize of output 126 [2022-03-15 21:03:39,693 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 21:03:39,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:03:40,415 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:03:40,415 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 168 [2022-03-15 21:03:40,614 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 21:03:40,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714676501] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:03:40,615 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:03:40,615 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-03-15 21:03:40,615 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [188145071] [2022-03-15 21:03:40,615 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:03:40,616 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:03:40,620 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 61 transitions. [2022-03-15 21:03:40,620 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:03:48,985 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [1605#(and (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (= result_7 1) (<= 2 i_4) (= name_1 (select nondet_0 (+ i_4 1))) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (<= i_8 2) (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) (= (+ name_2 1) name_1) break_6 (= name_2 (select nondet_0 i_4)) (= result_7 1) (<= 2 i_4) (< i_4 1) (= name_1 (select nondet_0 (+ i_4 1)))) (or (<= i_8 2) (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (< i_4 1)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4) (= (+ result_7 1) 0)) (or (= name_1 (select nondet_0 i_4)) (= name_2 (+ name_1 1)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (= (+ result_7 1) 0) (= name_2 (select nondet_0 (+ i_4 1))) (< i_4 1)) (or (<= i_8 2) (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4))), 1595#(and (or (= (+ result_3 1) 0) (not (= name_2 (select nondet_0 i_8))) (not (< i_8 3))) (or (= name_1 (select nondet_0 i_8)) (< result_7 0) (= (+ result_3 1) 0) (not (< i_8 3))) (or (<= 3 i_8) (= result_3 1) (= name_2 (select nondet_0 i_8)) (= result_7 1)) (or (< name_2 name_1) (<= 3 i_8) (= (+ result_3 1) 0) (< i_8 2)) (or (<= 3 i_8) (= name_2 (+ name_1 1)) (= result_3 1) (< i_8 2)) (or (= result_3 1) (= name_2 (select nondet_0 i_8)) (not (= name_1 (select nondet_0 i_8))) (not (< i_8 3)))), 1603#(and (or (< i_4 3) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) break_6 (= (+ name_1 (* (- 1) name_2) 1) 0)) (or (< i_4 3) break_6 (= (select nondet_0 1) name_1) (= (+ name_1 (* (- 1) name_2) 1) 0)) (or (= (+ result_3 1) 0) (not (= (select nondet_0 1) name_2)) (not break_6)) (or (not break_6) (= i_8 0)) (or (< i_4 3) (= i_8 0)) (or (< i_4 3) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) break_6 (= (select nondet_0 1) name_2)) (or (= (+ (- 1) result_3) 0) (not break_6) (not (= (select nondet_0 1) name_1))) (or (= (+ result_3 1) 0) (= (select nondet_0 1) name_1) (not break_6)) (or (= (+ (- 1) result_3) 0) (not break_6) (= (select nondet_0 1) name_2))), 1615#(and (or (not (< i_4 3)) break_6 (= (select nondet_0 1) name_1) (= name_2 (select nondet_0 i_4)) (< i_4 2) (= (+ name_1 (* (- 1) name_2) 1) 0)) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) break_6 (< i_4 2) (= (select nondet_0 1) name_2)) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))) (= (select nondet_0 1) name_2)) (or (not (< i_4 3)) break_6 (= (select nondet_0 1) name_1) (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 2) (= (+ name_1 (* (- 1) name_2) 1) 0)) (or (not (< i_4 3)) (not (= (select nondet_0 1) name_2)) break_6 (not (= name_1 (select nondet_0 i_4))))), 1602#(and (or (= (+ (- 1) result_3) 0) (not (= name_1 (select nondet_0 i_8))) (not break_6)) (or (< i_4 3) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) break_6 (= (+ name_1 (* (- 1) name_2) 1) 0)) (or (< 0 i_8) (not break_6)) (or (< i_4 3) (< 0 i_8)) (or (not break_6) (<= i_8 1)) (or (< i_4 3) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) (= name_2 (select nondet_0 i_8)) break_6) (or (< i_4 3) (<= i_8 1)) (or (= (+ (- 1) result_3) 0) (= name_2 (select nondet_0 i_8)) (not break_6)) (or (= (+ result_3 1) 0) (not (= name_2 (select nondet_0 i_8))) (not break_6)) (or (= name_1 (select nondet_0 i_8)) (< i_4 3) break_6 (= (+ name_1 (* (- 1) name_2) 1) 0)) (or (= name_1 (select nondet_0 i_8)) (= (+ result_3 1) 0) (not break_6))), 1594#(and (or (= (+ (- 1) result_3) 0) (= (+ (* (- 1) name_1) name_2) 1) (< i_8 3)) (or (= (+ (- 1) result_3) 0) (= result_7 1)) (or (< result_7 0) (= (+ result_3 1) 0)) (or (< name_2 name_1) (= (+ result_3 1) 0) (< i_8 3))), 1599#(and (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (= result_7 1) (<= 2 i_4) (= name_1 (select nondet_0 (+ i_4 1))) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) (< result_7 0) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) (= (+ name_2 1) name_1) break_6 (= name_2 (select nondet_0 i_4)) (= result_7 1) (<= 2 i_4) (< i_4 1) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (< result_7 0) (= name_2 (+ name_1 1)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (= name_2 (select nondet_0 (+ i_4 1))) (< i_4 1))), 1597#(and (or (= (+ (- 1) result_3) 0) (= result_7 1) (not break_6)) (or (< result_7 0) (< i_4 3) break_6 (= (+ name_1 (* (- 1) name_2) 1) 0)) (or (< i_4 3) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) break_6 (= result_7 1)) (or (< result_7 0) (= (+ result_3 1) 0) (not break_6))), 1608#(and (or (= (select nondet_0 1) name_1) (not (= name_2 name_1)) (= name_1 (select nondet_0 0))) (or (= (+ result_3 1) 0) (not (= name_2 (select nondet_0 0))) (= (select nondet_0 1) name_1)) (or (= result_3 1) (= name_2 name_1) (not (= (select nondet_0 1) name_1))) (or (= (+ result_3 1) 0) (not (= (select nondet_0 1) name_2))) (or (= result_3 1) (= name_2 (select nondet_0 0)) (= result_7 1) (= (select nondet_0 1) name_2)) (or (< result_7 0) (= (+ result_3 1) 0) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0))) (or (= result_3 1) (not (= name_1 (select nondet_0 0))) (= name_2 name_1) (= (select nondet_0 1) name_2))), 1601#(and (or (<= i_8 2) (not break_6)) (or (= (+ (- 1) result_3) 0) (= result_7 1) (not break_6)) (or (= (+ result_3 1) 0) (not break_6) (= (- 1) result_7)) (or (<= i_8 2) (< i_4 3)) (or (< i_4 3) break_6 (= (+ name_1 (* (- 1) name_2) 1) 0) (= (- 1) result_7)) (or (< i_4 3) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) break_6 (= result_7 1))), 1604#(and (or (not (< i_4 3)) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 2) (= (+ name_1 (* (- 1) name_2) 1) 0) (= (- 1) result_7)) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) break_6 (not (= name_2 (select nondet_0 i_4))) (= result_7 1)) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) break_6 (< i_4 2) (= result_7 1)) (or (not (< i_4 3)) (<= i_8 2) break_6 (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) (<= i_8 2) break_6 (not (= name_2 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_6 (not (= name_1 (select nondet_0 i_4))) (= (+ result_7 1) 0)) (or (<= i_8 2) break_6 (< i_4 2) (<= 3 i_4))), 1616#(and (or (= name_1 (select nondet_0 i_4)) break_6 (= (select nondet_0 1) name_1) (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) (not (= (select nondet_0 1) name_2)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (= (select nondet_0 1) name_2) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (< i_4 1))), 1612#(and (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))) (= i_8 0)) (or (not (< i_4 3)) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 2) (= (+ name_1 (* (- 1) name_2) 1) 0) (= name_1 (select nondet_0 (+ i_8 1)))) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) break_6 (< i_4 2) (= (select nondet_0 1) name_2)) (or break_6 (< i_4 2) (<= 3 i_4) (= i_8 0)) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))) (= (select nondet_0 1) name_2)) (or (not (< i_4 3)) break_6 (= (select nondet_0 1) name_1) (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_6 (not (= name_1 (select nondet_0 i_4))) (= i_8 0)) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 2) (= (+ name_1 (* (- 1) name_2) 1) 0)) (or (not (< i_4 3)) (not (= (select nondet_0 1) name_2)) break_6 (not (= name_1 (select nondet_0 i_4))))), 1606#(and (or (not (< i_4 3)) (= name_1 (select nondet_0 i_8)) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 2) (= (+ name_1 (* (- 1) name_2) 1) 0)) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_8))) (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) (= name_2 (select nondet_0 i_8)) break_6 (< i_4 2)) (or (not (< i_4 3)) break_6 (< 0 i_8) (not (= name_1 (select nondet_0 i_4)))) (or break_6 (< i_4 2) (<= 3 i_4) (<= i_8 1)) (or (not (< i_4 3)) break_6 (not (= name_1 (select nondet_0 i_4))) (<= i_8 1)) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))) (<= i_8 1)) (or (not (< i_4 3)) (= name_2 (select nondet_0 i_8)) break_6 (not (= name_2 (select nondet_0 i_4)))) (or break_6 (< i_4 2) (< 0 i_8) (<= 3 i_4)) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 2) (= (+ name_1 (* (- 1) name_2) 1) 0)) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_8)) break_6 (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))) (< 0 i_8))), 1609#(and (or (< i_4 3) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) break_6 (= (+ name_1 (* (- 1) name_2) 1) 0)) (or (< i_4 3) break_6 (= (select nondet_0 1) name_1) (= (+ name_1 (* (- 1) name_2) 1) 0)) (or (= (+ result_3 1) 0) (not (= (select nondet_0 1) name_2)) (not break_6)) (or (< i_4 3) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) break_6 (= (select nondet_0 1) name_2)) (or (= (+ (- 1) result_3) 0) (not break_6) (not (= (select nondet_0 1) name_1))) (or (= (+ result_3 1) 0) (= (select nondet_0 1) name_1) (not break_6)) (or (= (+ (- 1) result_3) 0) (not break_6) (= (select nondet_0 1) name_2))), 1607#(and (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1)))) (<= i_8 1)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4) (<= i_8 1)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (< 0 i_8) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) (= name_1 (select nondet_0 i_8)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (< 0 i_8) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) break_6 (not (= name_2 (select nondet_0 i_8))) (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (< i_4 1)) (or (= name_1 (select nondet_0 i_4)) (= name_2 (select nondet_0 i_8)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1)))))), 1596#(and (or (= result_3 1) (= name_2 (select nondet_0 (+ i_8 1))) (= name_2 (select nondet_0 i_8)) (<= 2 i_8) (not (= name_1 (select nondet_0 i_8)))) (or (not (< i_8 2)) (= (+ result_3 1) 0) (not (= name_2 (select nondet_0 i_8))) (= name_1 (select nondet_0 (+ i_8 1)))) (or (= result_3 1) (= name_2 (select nondet_0 (+ i_8 1))) (= name_2 (select nondet_0 i_8)) (<= 2 i_8) (= result_7 1)) (or (not (< i_8 2)) (= name_1 (select nondet_0 i_8)) (< result_7 0) (= (+ result_3 1) 0) (= name_1 (select nondet_0 (+ i_8 1)))) (or (= name_2 (+ name_1 1)) (= result_3 1) (< i_8 1) (<= 2 i_8)) (or (not (= name_2 (select nondet_0 (+ i_8 1)))) (= (+ result_3 1) 0) (<= 2 i_8)) (or (< name_2 name_1) (= (+ result_3 1) 0) (< i_8 1) (<= 2 i_8)) (or (= result_3 1) (= name_2 (select nondet_0 (+ i_8 1))) (<= 2 i_8) (not (= name_1 (select nondet_0 (+ i_8 1)))))), 1613#(and (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4) (= name_1 (select nondet_0 (+ i_8 1)))) (or (= name_1 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ i_8 1)))) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4) (= i_8 0)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1)))) (= i_8 0)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (= (select nondet_0 1) name_2) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (< i_4 1))), 1610#(and (or (<= i_8 2) (= name_2 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (= name_1 (select nondet_0 0)) (= name_2 name_1)) (or (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (= (+ result_7 1) 0) (= name_2 name_1) (not (= (select nondet_0 1) name_1))) (or (= name_2 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (= name_1 (select nondet_0 0)) (= result_7 1) (= name_2 name_1)) (or (<= i_8 2) (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= (select nondet_0 1) name_1)))), 1611#(and (or (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (< 0 i_8) (= name_2 name_1) (not (= (select nondet_0 1) name_1))) (or (= name_2 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (= name_1 (select nondet_0 0)) (< 0 i_8) (= name_2 name_1)) (or (= name_2 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (= name_1 (select nondet_0 0)) (= name_2 name_1) (<= i_8 1)) (or (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (= name_2 name_1) (<= i_8 1) (not (= (select nondet_0 1) name_1)))), 1600#(and (or (= name_2 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (= name_1 (select nondet_0 0)) (= result_7 1) (= name_2 name_1)) (or (< result_7 0) (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= (select nondet_0 1) name_1)))), 1614#(and (or (= name_2 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (= name_1 (select nondet_0 0)) (= name_2 name_1) (= i_8 0)) (or (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= (select nondet_0 1) name_1)) (= i_8 0))), 1598#(and (or (not (< i_4 3)) (< result_7 0) break_6 (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) (< result_7 0) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 2) (= (+ name_1 (* (- 1) name_2) 1) 0)) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) break_6 (not (= name_2 (select nondet_0 i_4))) (= result_7 1)) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) break_6 (< i_4 2) (= result_7 1)))] [2022-03-15 21:03:48,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:03:48,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:03:48,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:03:48,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1749, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 21:03:48,986 INFO L87 Difference]: Start difference. First operand 43 states and 89 transitions. Second operand has 33 states, 32 states have (on average 1.90625) internal successors, (61), 33 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:03:55,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:03:55,584 INFO L93 Difference]: Finished difference Result 133 states and 259 transitions. [2022-03-15 21:03:55,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 21:03:55,585 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.90625) internal successors, (61), 33 states have internal predecessors, (61), 0 states have call successors, (0), 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 21:03:55,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:03:55,585 INFO L225 Difference]: With dead ends: 133 [2022-03-15 21:03:55,585 INFO L226 Difference]: Without dead ends: 124 [2022-03-15 21:03:55,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=584, Invalid=4672, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 21:03:55,587 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 299 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:03:55,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 0 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1682 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 21:03:55,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-03-15 21:03:55,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 82. [2022-03-15 21:03:55,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 2.185185185185185) internal successors, (177), 81 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:03:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 177 transitions. [2022-03-15 21:03:55,594 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 177 transitions. Word has length 13 [2022-03-15 21:03:55,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:03:55,594 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 177 transitions. [2022-03-15 21:03:55,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.90625) internal successors, (61), 33 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:03:55,594 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 177 transitions. [2022-03-15 21:03:55,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 21:03:55,595 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:03:55,595 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:03:55,616 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 21:03:55,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:03:55,807 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:03:55,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:03:55,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1877024013, now seen corresponding path program 5 times [2022-03-15 21:03:55,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:03:55,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735108447] [2022-03-15 21:03:55,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:03:55,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:03:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:03:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:03:55,881 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:03:55,881 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735108447] [2022-03-15 21:03:55,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735108447] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:03:55,881 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546090171] [2022-03-15 21:03:55,881 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:03:55,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:03:55,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:03:55,883 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 21:03:55,883 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 21:03:55,919 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:03:55,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:03:55,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 21:03:55,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:03:56,002 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 54 treesize of output 42 [2022-03-15 21:03:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:03:56,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:03:56,087 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:03:56,087 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 45 [2022-03-15 21:03:56,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:03:56,178 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546090171] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:03:56,178 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:03:56,178 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-03-15 21:03:56,178 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [786841278] [2022-03-15 21:03:56,178 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:03:56,179 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:03:56,184 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 59 transitions. [2022-03-15 21:03:56,184 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:03:57,479 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [2061#(and (or (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (not break_10)) (or (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (<= i_8 1))), 2063#(and (not break_10) (< i_8 3)), 2068#(and (or break_6 (not (= name_1 (select nondet_0 0))) (= name_2 name_1)) (or (not (= name_2 (select nondet_0 0))) break_6 (= name_2 name_1))), 2062#(= i_8 0), 2065#(and (or (not (= name_1 (select nondet_0 0))) (= name_2 name_1)) (or (not (= name_2 (select nondet_0 0))) (= name_2 name_1))), 2067#(and (or break_10 break_6 (< i_8 2) (not (< i_8 3))) (or break_10 break_6 (not (= name_1 (select nondet_0 i_8))) (not (< i_8 3))) (or break_10 break_6 (not (= name_2 (select nondet_0 i_8))) (not (< i_8 3)))), 2064#(and (or break_10 (< i_8 2) (not (< i_8 3))) (or break_10 (not (= name_2 (select nondet_0 i_8))) (not (< i_8 3))) (or break_10 (not (= name_1 (select nondet_0 i_8))) (not (< i_8 3)))), 2060#(or (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0))), 2066#(and (or break_6 (not break_10)) (or break_6 (< i_8 3)))] [2022-03-15 21:03:57,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:03:57,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:03:57,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:03:57,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:03:57,480 INFO L87 Difference]: Start difference. First operand 82 states and 177 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:03:57,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:03:57,859 INFO L93 Difference]: Finished difference Result 90 states and 187 transitions. [2022-03-15 21:03:57,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 21:03:57,859 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 21:03:57,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:03:57,860 INFO L225 Difference]: With dead ends: 90 [2022-03-15 21:03:57,860 INFO L226 Difference]: Without dead ends: 86 [2022-03-15 21:03:57,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2022-03-15 21:03:57,860 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:03:57,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:03:57,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-03-15 21:03:57,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2022-03-15 21:03:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 2.108108108108108) internal successors, (156), 74 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:03:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 156 transitions. [2022-03-15 21:03:57,865 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 156 transitions. Word has length 13 [2022-03-15 21:03:57,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:03:57,866 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 156 transitions. [2022-03-15 21:03:57,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:03:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 156 transitions. [2022-03-15 21:03:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:03:57,866 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:03:57,867 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:03:57,883 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 21:03:58,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:03:58,072 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:03:58,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:03:58,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1209822097, now seen corresponding path program 6 times [2022-03-15 21:03:58,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:03:58,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281394031] [2022-03-15 21:03:58,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:03:58,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:03:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:03:58,200 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:03:58,200 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:03:58,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281394031] [2022-03-15 21:03:58,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281394031] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:03:58,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97299506] [2022-03-15 21:03:58,203 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:03:58,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:03:58,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:03:58,208 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 21:03:58,209 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 21:03:58,247 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:03:58,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:03:58,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 21:03:58,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:03:58,353 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 54 treesize of output 42 [2022-03-15 21:03:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:03:58,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:03:58,447 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:03:58,447 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 40 [2022-03-15 21:03:58,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:03:58,470 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97299506] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:03:58,470 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:03:58,470 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2022-03-15 21:03:58,470 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1597541596] [2022-03-15 21:03:58,470 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:03:58,471 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:03:58,476 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 72 transitions. [2022-03-15 21:03:58,476 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:04:03,102 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [2424#(and (or (not (< i_8 2)) (= name_1 (select nondet_0 i_8)) (not (= name_2 (select nondet_0 (+ i_8 1)))) (= name_2 (select nondet_0 i_8)) break_10) (or (not (< i_8 2)) (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 i_8)) break_10 (< i_8 1)) (or (not (< i_8 2)) (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 i_8)) break_10 (not (= name_1 (select nondet_0 (+ i_8 1)))))), 2431#(and (or (= name_1 (select nondet_0 i_4)) break_10 break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) break_10 break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) break_10 break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (< i_4 1))), 2433#(and (or (not break_6) (= i_8 0)) (or (< i_4 3) (= i_8 0)) (or (= (select nondet_0 1) name_1) (not break_6) (= (select nondet_0 1) name_2)) (or (< i_4 3) (= (select nondet_0 1) name_1) (= (select nondet_0 1) name_2))), 2434#(and (or (not (< i_4 3)) break_6 (< i_4 2) (= i_8 0)) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))) (= i_8 0)) (or (not (< i_4 3)) break_6 (= (select nondet_0 1) name_1) (not (= name_2 (select nondet_0 i_4))) (= (select nondet_0 1) name_2)) (or (not (< i_4 3)) break_6 (= (select nondet_0 1) name_1) (not (= name_1 (select nondet_0 i_4))) (= (select nondet_0 1) name_2)) (or (not (< i_4 3)) break_6 (not (= name_1 (select nondet_0 i_4))) (= i_8 0)) (or (not (< i_4 3)) break_6 (= (select nondet_0 1) name_1) (< i_4 2) (= (select nondet_0 1) name_2))), 2435#(and (or break_6 (= (select nondet_0 1) name_1) (<= 2 i_4) (< i_4 1) (= (select nondet_0 1) name_2)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4) (= i_8 0)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1)))) (= i_8 0)) (or (= name_1 (select nondet_0 i_4)) break_6 (= (select nondet_0 1) name_1) (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (= (select nondet_0 1) name_2) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) break_6 (= (select nondet_0 1) name_1) (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4) (= (select nondet_0 1) name_2))), 2430#(and (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (< i_4 1))), 2419#(and (< i_4 3) (not break_6)), 2427#(and (or (not (< i_4 3)) break_6 (< i_4 2)) (or (not (< i_4 3)) break_6 (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))))), 2425#(and (or (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 (+ i_8 1))) (= name_2 (select nondet_0 i_8)) break_10 (not (= name_2 (select nondet_0 (+ 2 i_8)))) (not (< i_8 1)) (= name_1 (select nondet_0 (+ i_8 1)))) (or (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 (+ i_8 1))) (= name_2 (select nondet_0 i_8)) break_10 (< i_8 0) (not (< i_8 1)) (= name_1 (select nondet_0 (+ i_8 1)))) (or (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 (+ i_8 1))) (= name_2 (select nondet_0 i_8)) break_10 (not (= name_1 (select nondet_0 (+ 2 i_8)))) (not (< i_8 1)) (= name_1 (select nondet_0 (+ i_8 1))))), 2438#(and (or (= name_2 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (= name_1 (select nondet_0 0)) (= name_2 name_1)) (or (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= (select nondet_0 1) name_1)))), 2439#(and (or (= name_2 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) break_10 (= name_1 (select nondet_0 0)) (= name_2 name_1)) (or (= name_2 (select nondet_0 0)) break_10 (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= (select nondet_0 1) name_1)))), 2441#(and (or (= name_2 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (= name_1 (select nondet_0 0)) (= name_2 name_1) (= i_8 0)) (or (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= (select nondet_0 1) name_1)) (= i_8 0))), 2436#(and (or (not (< i_4 3)) break_6 (= (select nondet_0 1) name_1) (not (= name_2 (select nondet_0 i_4))) (= (select nondet_0 1) name_2)) (or (not (< i_4 3)) break_6 (= (select nondet_0 1) name_1) (not (= name_1 (select nondet_0 i_4))) (= (select nondet_0 1) name_2)) (or (not (< i_4 3)) break_6 (= (select nondet_0 1) name_1) (< i_4 2) (= (select nondet_0 1) name_2))), 2422#(and (not break_10) (< i_8 3)), 2426#(or (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (= name_2 name_1) (= (select nondet_0 1) name_2)), 2440#(and (or (= name_2 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (= i_8 1) (= name_1 (select nondet_0 0)) (= name_2 name_1)) (or (= name_2 (select nondet_0 0)) (= i_8 1) (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= (select nondet_0 1) name_1)))), 2420#(and (or (< i_4 3) break_10) (or break_10 (not break_6))), 2423#(and (or break_10 (< i_8 2) (not (< i_8 3))) (or break_10 (not (= name_2 (select nondet_0 i_8))) (not (< i_8 3))) (or break_10 (not (= name_1 (select nondet_0 i_8))) (not (< i_8 3)))), 2429#(and (or (not (< i_4 3)) (= i_8 1) break_6 (< i_4 2)) (or (not (< i_4 3)) (= i_8 1) break_6 (not (= name_2 (select nondet_0 i_4)))) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 i_8)) break_6 (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 i_8)) break_6 (< i_4 2)) (or (not (< i_4 3)) (= i_8 1) break_6 (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 i_8)) break_6 (not (= name_2 (select nondet_0 i_4))))), 2421#(and (or (< i_4 3) (= i_8 1)) (or (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 i_8)) (not break_6)) (or (= i_8 1) (not break_6)) (or (= name_1 (select nondet_0 i_8)) (< i_4 3) (= name_2 (select nondet_0 i_8)))), 2428#(and (or (not (< i_4 3)) break_10 break_6 (not (= name_2 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_10 break_6 (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_10 break_6 (< i_4 2))), 2437#(and (or break_6 (= (select nondet_0 1) name_1) (<= 2 i_4) (< i_4 1) (= (select nondet_0 1) name_2)) (or (= name_1 (select nondet_0 i_4)) break_6 (= (select nondet_0 1) name_1) (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (= (select nondet_0 1) name_2) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) break_6 (= (select nondet_0 1) name_1) (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4) (= (select nondet_0 1) name_2))), 2432#(and (or (= name_1 (select nondet_0 i_4)) (= i_8 1) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 i_8)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) (= i_8 1) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 i_8)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (< i_4 1)))] [2022-03-15 21:04:03,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 21:04:03,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:04:03,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 21:04:03,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1062, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 21:04:03,103 INFO L87 Difference]: Start difference. First operand 75 states and 156 transitions. Second operand has 32 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:04:08,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:04:08,102 INFO L93 Difference]: Finished difference Result 87 states and 172 transitions. [2022-03-15 21:04:08,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 21:04:08,103 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 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 21:04:08,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:04:08,103 INFO L225 Difference]: With dead ends: 87 [2022-03-15 21:04:08,103 INFO L226 Difference]: Without dead ends: 76 [2022-03-15 21:04:08,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=781, Invalid=5381, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 21:04:08,105 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 141 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:04:08,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 0 Invalid, 1856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1760 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 21:04:08,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-03-15 21:04:08,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 56. [2022-03-15 21:04:08,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 2.090909090909091) internal successors, (115), 55 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:04:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 115 transitions. [2022-03-15 21:04:08,109 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 115 transitions. Word has length 14 [2022-03-15 21:04:08,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:04:08,110 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 115 transitions. [2022-03-15 21:04:08,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:04:08,110 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 115 transitions. [2022-03-15 21:04:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:04:08,114 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:04:08,115 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:04:08,138 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 21:04:08,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:04:08,328 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:04:08,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:04:08,328 INFO L85 PathProgramCache]: Analyzing trace with hash -557504419, now seen corresponding path program 7 times [2022-03-15 21:04:08,329 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:04:08,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445063878] [2022-03-15 21:04:08,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:04:08,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:04:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:04:08,462 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:04:08,463 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:04:08,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445063878] [2022-03-15 21:04:08,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445063878] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:04:08,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612858554] [2022-03-15 21:04:08,463 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:04:08,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:04:08,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:04:08,465 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 21:04:08,466 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 21:04:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:04:08,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 21:04:08,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:04:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:04:08,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:04:08,696 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:04:08,696 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2022-03-15 21:04:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:04:08,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612858554] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:04:08,702 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:04:08,702 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2022-03-15 21:04:08,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [639121125] [2022-03-15 21:04:08,702 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:04:08,704 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:04:08,708 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 72 transitions. [2022-03-15 21:04:08,708 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:04:16,111 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [2830#(and (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (< i_8 3) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4) (< i_8 3)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (not break_10) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not break_10) (<= 2 i_4) (< i_4 1)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (< i_8 3) (< i_4 1)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not break_10) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1)))))), 2846#(and (or (not (< i_8 2)) (= name_1 (select nondet_0 i_8)) (not (= name_2 (select nondet_0 (+ i_8 1)))) (= name_2 (select nondet_0 i_8)) break_10) (or (not (< i_8 2)) (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 i_8)) break_10 (<= i_8 0)) (or (not (< i_8 2)) (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 i_8)) break_10 (not (= name_1 (select nondet_0 (+ i_8 1)))))), 2845#(and (or break_10 (<= i_8 1) (not (< i_8 3))) (or break_10 (not (= name_2 (select nondet_0 i_8))) (not (< i_8 3))) (or break_10 (not (= name_1 (select nondet_0 i_8))) (not (< i_8 3)))), 2826#(and (or (not (< i_4 3)) break_6 (< i_4 2) (not (= name_1 (select nondet_0 i_8)))) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_8))) (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_8))) (not (= name_2 (select nondet_0 i_4)))) (or (not (< i_4 3)) (= i_8 1) break_6 (< i_4 2)) (or (not (< i_4 3)) (= i_8 1) break_6 (not (= name_2 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_6 (not (= name_1 (select nondet_0 i_8))) (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))) (not (= name_1 (select nondet_0 i_8)))) (or (not (< i_4 3)) (= i_8 1) break_6 (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_8))) (< i_4 2))), 2841#(or (= name_2 (select nondet_0 0)) (= i_8 1) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (= name_2 name_1) (= (select nondet_0 1) name_2)), 2833#(and (or (not (= (select nondet_0 1) name_2)) (not break_6)) (or (< i_4 3) (not (= (select nondet_0 1) name_1))) (or (not break_6) (not (= (select nondet_0 1) name_1))) (or (< i_4 3) (not (= (select nondet_0 1) name_2)))), 2831#(and (or (= name_1 (select nondet_0 i_4)) (= i_8 1) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (< i_4 1)) (or (= name_1 (select nondet_0 i_4)) (= i_8 1) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) break_6 (not (= name_2 (select nondet_0 i_8))) (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) (= i_8 1) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 i_8))) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 i_8))) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) break_6 (not (= name_2 (select nondet_0 i_8))) (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4))), 2842#(and (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1))) (= i_8 0)) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (not (= (select nondet_0 1) name_2)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1))) (not (= (select nondet_0 1) name_1))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1))) (= i_8 0)) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (not (= (select nondet_0 1) name_2)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 0) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1))) (= i_8 0)) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1))) (not (= (select nondet_0 1) name_1)))), 2827#(and (or (not (= (select nondet_0 1) name_2)) (not break_6)) (or (< i_4 3) (not (= (select nondet_0 1) name_1))) (or (not break_6) (not (= (select nondet_0 1) name_1))) (or (not break_6) (= i_8 0)) (or (< i_4 3) (= i_8 0)) (or (< i_4 3) (not (= (select nondet_0 1) name_2)))), 2821#(and (< i_4 3) (not break_6)), 2823#(and (or (not (= name_1 (select nondet_0 i_8))) (not break_6)) (or (not (= name_2 (select nondet_0 i_8))) (not break_6)) (or (< i_4 3) (not (= name_1 (select nondet_0 i_8)))) (or (< i_4 3) (= i_8 1)) (or (= i_8 1) (not break_6)) (or (< i_4 3) (not (= name_2 (select nondet_0 i_8))))), 2824#(and (or (not (< i_4 3)) break_6 (< i_4 2)) (or (not (< i_4 3)) break_6 (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))))), 2834#(and (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))) (not (= (select nondet_0 1) name_1))) (or (not (< i_4 3)) break_6 (not (= name_1 (select nondet_0 i_4))) (not (= (select nondet_0 1) name_1))) (or (not (< i_4 3)) break_6 (< i_4 2) (not (= (select nondet_0 1) name_1))) (or (not (< i_4 3)) (not (= (select nondet_0 1) name_2)) break_6 (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) (not (= (select nondet_0 1) name_2)) break_6 (not (= name_2 (select nondet_0 i_4)))) (or (not (< i_4 3)) (not (= (select nondet_0 1) name_2)) break_6 (< i_4 2))), 2844#(and (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (not (= (select nondet_0 1) name_2)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1))) (not (= (select nondet_0 1) name_1))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (not (= (select nondet_0 1) name_2)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1))) (not (= (select nondet_0 1) name_1)))), 2825#(and (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))) (< i_8 3)) (or (not (< i_4 3)) break_6 (not break_10) (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_6 (< i_4 2) (not break_10)) (or (not (< i_4 3)) break_6 (< i_4 2) (< i_8 3)) (or (not (< i_4 3)) break_6 (not (= name_1 (select nondet_0 i_4))) (< i_8 3)) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))) (not break_10))), 2843#(or (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (= name_2 name_1) (= (select nondet_0 1) name_2) (= i_8 0)), 2837#(and (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 0) (not break_10) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (not break_10) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (not break_10) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (< i_8 3) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 0) (< i_8 3) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (< i_8 3) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1))))), 2836#(and (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 0) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1))))), 2840#(and (or (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (= name_2 name_1) (< i_8 3) (= (select nondet_0 1) name_2)) (or (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (not break_10) (= name_2 name_1) (= (select nondet_0 1) name_2))), 2839#(or (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (= name_2 name_1) (= (select nondet_0 1) name_2)), 2838#(and (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (= i_8 1) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 0) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 i_8))) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (= i_8 1) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (not (= name_2 (select nondet_0 i_8))) (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (not (= name_2 (select nondet_0 i_8))) (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (= i_8 1) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 i_8))) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1))))), 2832#(and (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4) (not (= (select nondet_0 1) name_1))) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1)))) (not (= (select nondet_0 1) name_1))) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4) (= i_8 0)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1)))) (= i_8 0)) (or (= name_1 (select nondet_0 i_4)) (not (= (select nondet_0 1) name_2)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (< i_4 1) (= i_8 0)) (or (= name_1 (select nondet_0 i_4)) (not (= (select nondet_0 1) name_2)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1)))))), 2835#(and (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4) (not (= (select nondet_0 1) name_1))) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1)))) (not (= (select nondet_0 1) name_1))) (or (= name_1 (select nondet_0 i_4)) (not (= (select nondet_0 1) name_2)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) (not (= (select nondet_0 1) name_2)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1)))))), 2829#(and (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (< i_4 1))), 2847#(and (or (= name_2 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (= name_1 (select nondet_0 0)) (= name_2 name_1)) (or (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= (select nondet_0 1) name_1)))), 2828#(and (or (not (< i_4 3)) break_6 (< i_4 2) (= i_8 0)) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))) (= i_8 0)) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))) (not (= (select nondet_0 1) name_1))) (or (not (< i_4 3)) break_6 (not (= name_1 (select nondet_0 i_4))) (not (= (select nondet_0 1) name_1))) (or (not (< i_4 3)) break_6 (< i_4 2) (not (= (select nondet_0 1) name_1))) (or (not (< i_4 3)) break_6 (not (= name_1 (select nondet_0 i_4))) (= i_8 0)) (or (not (< i_4 3)) (not (= (select nondet_0 1) name_2)) break_6 (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) (not (= (select nondet_0 1) name_2)) break_6 (not (= name_2 (select nondet_0 i_4)))) (or (not (< i_4 3)) (not (= (select nondet_0 1) name_2)) break_6 (< i_4 2))), 2822#(and (or (not break_10) (not break_6)) (or (< i_4 3) (not break_10)) (or (< i_8 3) (not break_6)) (or (< i_4 3) (< i_8 3)))] [2022-03-15 21:04:16,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:04:16,112 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:04:16,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:04:16,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1255, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 21:04:16,113 INFO L87 Difference]: Start difference. First operand 56 states and 115 transitions. Second operand has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:04:24,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:04:24,816 INFO L93 Difference]: Finished difference Result 125 states and 263 transitions. [2022-03-15 21:04:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-03-15 21:04:24,817 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 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 21:04:24,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:04:24,818 INFO L225 Difference]: With dead ends: 125 [2022-03-15 21:04:24,818 INFO L226 Difference]: Without dead ends: 125 [2022-03-15 21:04:24,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3717 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=2092, Invalid=12428, Unknown=0, NotChecked=0, Total=14520 [2022-03-15 21:04:24,822 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 373 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:04:24,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 0 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:04:24,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-03-15 21:04:24,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 97. [2022-03-15 21:04:24,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 2.1770833333333335) internal successors, (209), 96 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:04:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 209 transitions. [2022-03-15 21:04:24,827 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 209 transitions. Word has length 14 [2022-03-15 21:04:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:04:24,827 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 209 transitions. [2022-03-15 21:04:24,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:04:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 209 transitions. [2022-03-15 21:04:24,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:04:24,828 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:04:24,828 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:04:24,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-15 21:04:25,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:04:25,029 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:04:25,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:04:25,029 INFO L85 PathProgramCache]: Analyzing trace with hash -111884749, now seen corresponding path program 8 times [2022-03-15 21:04:25,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:04:25,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477120604] [2022-03-15 21:04:25,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:04:25,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:04:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:04:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:04:25,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:04:25,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477120604] [2022-03-15 21:04:25,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477120604] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:04:25,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127644382] [2022-03-15 21:04:25,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:04:25,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:04:25,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:04:25,408 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 21:04:25,408 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 21:04:25,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:04:25,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:04:25,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 21:04:25,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:04:25,839 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 143 treesize of output 115 [2022-03-15 21:04:26,025 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:04:26,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:04:26,771 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:04:26,771 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 238 treesize of output 204 [2022-03-15 21:04:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:04:26,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127644382] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:04:26,934 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:04:26,934 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2022-03-15 21:04:26,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [462083631] [2022-03-15 21:04:26,934 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:04:26,935 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:04:26,940 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 85 transitions. [2022-03-15 21:04:26,940 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:04:43,967 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 34 new interpolants: [3473#(and (or (= name_2 (select nondet_0 2)) (= name_1 (select nondet_0 i_4)) (= name_2 (+ name_1 1)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (not (= name_1 (select nondet_0 2))) (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (not (= name_2 (select nondet_0 2)))) (or (= name_1 (select nondet_0 i_4)) (= (+ name_2 1) name_1) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (= name_1 (select nondet_0 2)) (<= 2 i_4)) (or break_6 (not (= name_2 name_1)) (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (< i_4 1))), 3448#(and (or (= name_1 (select nondet_0 i_4)) (<= (+ result_7 1) 0) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (<= 1 result_7) (= name_1 (select nondet_0 (+ i_4 1))) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (< name_2 name_1) (= name_1 (select nondet_0 i_4)) (<= name_2 (+ name_1 result_7)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (<= 1 result_7) (< i_4 1) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= (+ name_1 result_7) name_2) (<= 2 i_4) (<= (+ name_1 1) name_2) (= name_2 (select nondet_0 (+ i_4 1))) (< i_4 1) (= name_1 (select nondet_0 (+ i_4 1))))), 3464#(and (or (< i_4 3) (not (= name_2 name_1))) (or (= (+ result_3 1) 0) (not (= name_2 (select nondet_0 2))) (not break_6)) (or (not break_6) (= i_8 0)) (or (< i_4 3) (= i_8 0)) (or (not (= name_1 (select nondet_0 2))) (< i_4 3) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) break_6) (or (= name_2 (select nondet_0 2)) (= name_1 (+ name_2 result_3)) (= name_1 (select nondet_0 2)) (not break_6)) (or (not (= name_1 (select nondet_0 2))) (= (+ (- 1) result_3) 0) (not break_6)) (or (not (= name_2 name_1)) (not break_6)) (or (< i_4 3) break_6 (= (+ name_1 (* (- 1) name_2) 1) 0) (not (= name_2 (select nondet_0 2))))), 3455#(and (or (= name_2 (select nondet_0 2)) (= name_2 (+ name_1 1)) (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (not break_10) (= (+ result_7 1) 0) (= name_2 name_1) (= (select nondet_0 1) name_2)) (or (= name_2 (select nondet_0 2)) (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (<= (+ name_1 result_7) name_2) (not break_10) (= name_1 (select nondet_0 2)) (= name_2 name_1) (= (select nondet_0 1) name_2)) (or (<= name_2 (+ name_1 result_7)) (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (not break_10) (= name_1 (select nondet_0 2)) (= name_2 name_1) (<= 1 result_7) (= (select nondet_0 1) name_2)) (or (not (= name_1 (select nondet_0 2))) (= (+ name_2 1) name_1) (= name_2 (select nondet_0 0)) break_10 (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (= name_2 name_1) (= (select nondet_0 1) name_2)) (or (not (= name_1 (select nondet_0 2))) (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (not break_10) (= (+ result_7 1) 0) (= name_2 name_1) (= (select nondet_0 1) name_2)) (or (= name_2 (+ name_1 1)) (= name_2 (select nondet_0 0)) break_10 (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= name_2 (select nondet_0 2))) (= (select nondet_0 1) name_2)) (or (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (not break_10) (= name_2 name_1) (not (= name_2 (select nondet_0 2))) (<= 1 result_7) (= (select nondet_0 1) name_2)) (or (<= result_7 1) (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (not break_10) (= name_2 name_1) (= (select nondet_0 1) name_2))), 3450#(and (or (< i_4 3) break_6 (not break_10) (= (+ name_1 (* (- 1) name_2) 1) 0) (= (+ result_7 1) 0)) (or (<= (+ result_7 result_3) 0) (not break_10) (not break_6)) (or (not break_10) (< 0 result_3) (<= 1 result_7) (not break_6)) (or (< i_4 3) break_6 (<= (+ name_1 result_7) name_2) (not break_10)) (or (= (+ result_3 1) 0) (not break_10) (= (+ result_7 1) 0) (not break_6)) (or (= name_1 (+ name_2 result_3)) break_10 (not break_6)) (or (<= name_2 (+ name_1 result_7)) (< i_4 3) break_6 (not break_10))), 3471#(and (or (< i_4 3) (not (= name_2 name_1))) (or (= (+ result_3 1) 0) (not (= name_2 (select nondet_0 2))) (not break_6)) (or (not (= name_1 (select nondet_0 2))) (< i_4 3) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) break_6) (or (= name_2 (select nondet_0 2)) (= name_1 (+ name_2 result_3)) (= name_1 (select nondet_0 2)) (not break_6)) (or (not (= name_1 (select nondet_0 2))) (= (+ (- 1) result_3) 0) (not break_6)) (or (not (= name_2 name_1)) (not break_6)) (or (< i_4 3) break_6 (= (+ name_1 (* (- 1) name_2) 1) 0) (not (= name_2 (select nondet_0 2))))), 3458#(and (or (= name_1 (select nondet_0 i_4)) (= name_2 (+ name_1 1)) break_6 (not (= name_2 (select nondet_0 i_8))) (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (= name_2 (select nondet_0 (+ i_4 1))) (< i_4 1)) (or break_6 (not (= name_2 name_1)) (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (< i_4 1)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 i_8))) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) (= name_1 (select nondet_0 i_8)) (= (+ name_2 1) name_1) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) (= name_2 (+ name_1 1)) (= name_2 (select nondet_0 i_8)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) break_6 (not (= name_2 (select nondet_0 i_8))) (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) (= (+ name_2 1) name_1) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 i_8))) (<= 2 i_4) (< i_4 1) (= name_1 (select nondet_0 (+ i_4 1))))), 3477#(and (or (not (< i_8 2)) (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 (+ i_8 1))) (= name_2 (select nondet_0 i_8)) break_10 (< 0 result_3) (not (= name_1 (select nondet_0 (+ i_8 1))))) (or (not (< i_8 2)) (= name_1 (select nondet_0 i_8)) (<= (+ result_3 1) 0) (= name_2 (select nondet_0 i_8)) break_10 (< i_8 1) (<= (+ name_2 result_3) name_1) (= name_1 (select nondet_0 (+ i_8 1)))) (or (not (< i_8 2)) (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 i_8)) break_10 (<= result_3 1) (not (= name_1 (select nondet_0 (+ i_8 1))))) (or (not (< i_8 2)) (= name_1 (select nondet_0 i_8)) (not (= name_2 (select nondet_0 (+ i_8 1)))) (<= (+ result_3 1) 0) (= name_2 (select nondet_0 i_8)) break_10) (or (not (< i_8 2)) (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 (+ i_8 1))) (= name_2 (select nondet_0 i_8)) break_10 (<= name_1 (+ name_2 result_3)) (< i_8 1) (< 0 result_3) (<= (+ name_1 1) name_2))), 3449#(and (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (<= (+ result_7 1) 0) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_2 (select nondet_0 (+ 2 i_4))) (= name_1 (select nondet_0 (+ 2 i_4))) (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (<= (+ name_1 result_7) name_2) (< i_4 0) (<= (+ name_1 1) name_2) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 (+ 2 i_4))) (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (<= 1 result_7) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (< name_2 name_1) (= name_1 (select nondet_0 (+ 2 i_4))) (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (<= name_2 (+ name_1 result_7)) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 0) (<= 1 result_7) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1))))), 3476#(and (or (= name_2 (select nondet_0 i_8)) break_10 (not (= name_1 (select nondet_0 i_8))) (< 0 result_3) (not (< i_8 3))) (or (<= (+ result_3 1) 0) break_10 (not (= name_2 (select nondet_0 i_8))) (not (< i_8 3))) (or (= name_2 (select nondet_0 i_8)) break_10 (<= name_1 (+ name_2 result_3)) (< 0 result_3) (< i_8 2) (<= (+ name_1 1) name_2) (not (< i_8 3))) (or (= name_1 (select nondet_0 i_8)) (<= (+ result_3 1) 0) break_10 (< i_8 2) (<= (+ name_2 result_3) name_1) (not (< i_8 3))) (or break_10 (<= result_3 1) (not (= name_1 (select nondet_0 i_8))) (not (< i_8 3)))), 3472#(and (or (= name_2 (select nondet_0 2)) (not (< i_4 3)) (= name_2 (+ name_1 1)) break_6 (not (= name_2 (select nondet_0 i_4)))) (or (not (< i_4 3)) (= (+ name_2 1) name_1) break_6 (= name_1 (select nondet_0 2)) (not (= name_1 (select nondet_0 i_4)))) (or (not (= name_1 (select nondet_0 2))) (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_6 (not (= name_1 (select nondet_0 i_4))) (not (= name_2 (select nondet_0 2)))) (or (not (< i_4 3)) break_6 (not (= name_2 name_1)) (< i_4 2))), 3452#(and (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not break_10) (<= 2 i_4) (<= 1 result_7) (= name_1 (select nondet_0 (+ i_4 1))) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) (= name_2 (+ name_1 1)) break_6 (= name_2 (select nondet_0 i_4)) (not break_10) (<= 2 i_4) (= (+ result_7 1) 0) (= name_2 (select nondet_0 (+ i_4 1))) (< i_4 1)) (or (= name_1 (select nondet_0 i_4)) (= (+ name_2 1) name_1) break_10 break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) (= name_2 (+ name_1 1)) break_10 break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= (+ name_1 result_7) name_2) (not break_10) (<= 2 i_4) (= name_2 (select nondet_0 (+ i_4 1))) (< i_4 1) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= name_2 (+ name_1 result_7)) break_6 (= name_2 (select nondet_0 i_4)) (not break_10) (<= 2 i_4) (<= 1 result_7) (< i_4 1) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (not break_10) (<= 2 i_4) (= (+ result_7 1) 0)) (or (= name_1 (select nondet_0 i_4)) (<= result_7 1) break_6 (= name_2 (select nondet_0 i_4)) (not break_10) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1)))))), 3456#(and (or (= (+ (- 1) result_3) 0) (not (= name_1 (select nondet_0 i_8))) (not break_6)) (or (< i_4 3) (not (= name_2 name_1))) (or (< i_4 3) break_6 (not (= name_2 (select nondet_0 i_8))) (= (+ name_1 (* (- 1) name_2) 1) 0)) (or (< i_4 3) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) break_6 (not (= name_1 (select nondet_0 i_8)))) (or (= name_1 (select nondet_0 i_8)) (= name_1 (+ name_2 result_3)) (= name_2 (select nondet_0 i_8)) (not break_6)) (or (not (= name_2 name_1)) (not break_6)) (or (= (+ result_3 1) 0) (not (= name_2 (select nondet_0 i_8))) (not break_6))), 3478#(and (or (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 (+ 2 i_8))) (= name_2 (select nondet_0 (+ i_8 1))) (= name_2 (select nondet_0 i_8)) break_10 (<= name_1 (+ name_2 result_3)) (< i_8 0) (< 0 result_3) (<= (+ name_1 1) name_2) (not (< i_8 1)) (= name_1 (select nondet_0 (+ i_8 1)))) (or (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 (+ i_8 1))) (= name_2 (select nondet_0 i_8)) break_10 (<= result_3 1) (not (= name_1 (select nondet_0 (+ 2 i_8)))) (not (< i_8 1)) (= name_1 (select nondet_0 (+ i_8 1)))) (or (= name_1 (select nondet_0 i_8)) (= name_1 (select nondet_0 (+ 2 i_8))) (<= (+ result_3 1) 0) (= name_2 (select nondet_0 (+ i_8 1))) (= name_2 (select nondet_0 i_8)) break_10 (< i_8 0) (<= (+ name_2 result_3) name_1) (not (< i_8 1)) (= name_1 (select nondet_0 (+ i_8 1)))) (or (= name_1 (select nondet_0 i_8)) (<= (+ result_3 1) 0) (= name_2 (select nondet_0 (+ i_8 1))) (= name_2 (select nondet_0 i_8)) break_10 (not (= name_2 (select nondet_0 (+ 2 i_8)))) (not (< i_8 1)) (= name_1 (select nondet_0 (+ i_8 1)))) (or (= name_1 (select nondet_0 i_8)) (= name_2 (select nondet_0 (+ 2 i_8))) (= name_2 (select nondet_0 (+ i_8 1))) (= name_2 (select nondet_0 i_8)) break_10 (< 0 result_3) (not (= name_1 (select nondet_0 (+ 2 i_8)))) (not (< i_8 1)) (= name_1 (select nondet_0 (+ i_8 1))))), 3460#(and (or (= (+ name_2 1) name_1) (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (not (= name_1 (select nondet_0 i_8))) (= name_1 (select nondet_0 2)) (= name_2 name_1) (= (select nondet_0 1) name_2)) (or (= name_2 (select nondet_0 2)) (= name_2 (+ name_1 1)) (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (not (= name_2 (select nondet_0 i_8))) (= name_1 (select nondet_0 0)) (= name_2 name_1) (= (select nondet_0 1) name_2)) (or (= name_2 (+ name_1 1)) (= name_2 (select nondet_0 0)) (= name_2 (select nondet_0 i_8)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= name_2 (select nondet_0 2))) (= (select nondet_0 1) name_2)) (or (not (= name_1 (select nondet_0 2))) (= name_1 (select nondet_0 i_8)) (= (+ name_2 1) name_1) (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (= name_2 name_1) (= (select nondet_0 1) name_2))), 3457#(and (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_8))) (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))) (not (= name_1 (select nondet_0 i_8)))) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_8))) (= name_2 (select nondet_0 i_4)) (< i_4 2) (= (+ name_1 (* (- 1) name_2) 1) 0)) (or (not (< i_4 3)) (= name_2 (+ name_1 1)) (= name_2 (select nondet_0 i_8)) break_6 (not (= name_2 (select nondet_0 i_4)))) (or break_6 (not (= name_2 name_1)) (< i_4 2) (<= 3 i_4)) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_8)) (= (+ name_2 1) name_1) break_6 (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) break_6 (< i_4 2) (not (= name_1 (select nondet_0 i_8))))), 3446#(and (or (< i_4 3) break_6 (<= (+ name_1 result_7) name_2) (<= (+ name_1 1) name_2)) (or (< name_2 name_1) (<= name_2 (+ name_1 result_7)) (< i_4 3) break_6 (<= 1 result_7)) (or (<= (+ result_3 1) 0) (<= (+ result_7 result_3) 0) (not break_6)) (or (<= 0 (+ result_7 result_3)) (< 0 result_3) (<= 1 result_7) (not break_6))), 3462#(and (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) break_6 (< i_4 2) (not (= name_1 (select nondet_0 (+ i_8 1))))) (or (not (< i_4 3)) (= name_2 (+ name_1 1)) (= name_2 (select nondet_0 (+ i_8 1))) break_6 (not (= name_2 (select nondet_0 i_4)))) (or (not (< i_4 3)) (not (= name_2 (select nondet_0 (+ i_8 1)))) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 2) (= (+ name_1 (* (- 1) name_2) 1) 0)) (or (not (< i_4 3)) (= (+ name_2 1) name_1) break_6 (not (= name_1 (select nondet_0 i_4))) (= name_1 (select nondet_0 (+ i_8 1)))) (or (not (< i_4 3)) (not (= name_2 (select nondet_0 (+ i_8 1)))) break_6 (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))) (not (= name_1 (select nondet_0 (+ i_8 1))))) (or break_6 (not (= name_2 name_1)) (< i_4 2) (<= 3 i_4))), 3451#(and (or (not (< i_4 3)) (= (+ name_2 1) name_1) break_10 break_6 (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_10 break_6 (not (= name_2 (select nondet_0 i_4))) (= name_1 (+ (- 1) name_2))) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) (<= name_2 (+ name_1 result_7)) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 2) (not break_10)) (or (not (< i_4 3)) (<= result_7 1) break_6 (not (= name_2 (select nondet_0 i_4))) (not break_10)) (or (not (< i_4 3)) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 2) (not break_10) (= (+ name_1 (* (- 1) name_2) 1) 0) (= (+ result_7 1) 0)) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) break_6 (not (= name_2 (select nondet_0 i_4))) (not break_10) (<= 1 result_7)) (or (not (< i_4 3)) break_6 (not break_10) (not (= name_1 (select nondet_0 i_4))) (= (+ result_7 1) 0)) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 2) (<= (+ name_1 result_7) name_2) (not break_10))), 3469#(and (or (= name_2 (select nondet_0 2)) (not (= name_2 (select nondet_0 (+ i_8 1)))) (= name_2 (+ name_1 1)) (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (= name_2 name_1) (= (select nondet_0 1) name_2)) (or (not (= name_1 (select nondet_0 2))) (= (+ name_2 1) name_1) (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (= name_2 name_1) (= (select nondet_0 1) name_2) (= name_1 (select nondet_0 (+ i_8 1)))) (or (= (+ name_2 1) name_1) (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (= name_1 (select nondet_0 2)) (= name_2 name_1) (not (= name_1 (select nondet_0 (+ i_8 1)))) (= (select nondet_0 1) name_2)) (or (= name_2 (+ name_1 1)) (= name_2 (select nondet_0 0)) (= name_2 (select nondet_0 (+ i_8 1))) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= name_2 (select nondet_0 2))) (= (select nondet_0 1) name_2))), 3465#(and (or (= name_1 (select nondet_0 (+ 2 i_4))) (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (= (+ name_2 1) name_1) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 0) (not (= name_1 (select nondet_0 (+ i_8 1)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (= name_2 (+ name_1 1)) (= name_2 (select nondet_0 (+ i_8 1))) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (= (+ name_2 1) name_1) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_8 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (not (= name_2 (select nondet_0 (+ i_8 1)))) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_2 (select nondet_0 (+ 2 i_4))) (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (not (= name_2 (select nondet_0 (+ i_8 1)))) (= name_2 (+ name_1 1)) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 0) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (<= 1 i_4) break_6 (not (= name_2 name_1)) (= name_2 (select nondet_0 i_4)) (< i_4 0) (= name_2 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (not (= name_1 (select nondet_0 (+ i_8 1)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1))))), 3466#(and (or (not (< i_4 3)) break_6 (< i_4 2) (= i_8 0)) (or (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4))) (= i_8 0)) (or (= name_2 (select nondet_0 2)) (not (< i_4 3)) (= name_2 (+ name_1 1)) break_6 (not (= name_2 (select nondet_0 i_4)))) (or (not (< i_4 3)) (= (+ name_2 1) name_1) break_6 (= name_1 (select nondet_0 2)) (not (= name_1 (select nondet_0 i_4)))) (or (not (= name_1 (select nondet_0 2))) (not (< i_4 3)) break_6 (not (= name_2 (select nondet_0 i_4)))) (or (not (< i_4 3)) break_6 (not (= name_1 (select nondet_0 i_4))) (not (= name_2 (select nondet_0 2)))) (or (not (< i_4 3)) break_6 (not (= name_1 (select nondet_0 i_4))) (= i_8 0)) (or (not (< i_4 3)) break_6 (not (= name_2 name_1)) (< i_4 2))), 3463#(and (or (= name_1 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ i_8 1)))) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_1 (select nondet_0 (+ i_8 1)))) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or break_6 (not (= name_2 name_1)) (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (< i_4 1)) (or (= name_1 (select nondet_0 i_4)) (= name_2 (+ name_1 1)) (= name_2 (select nondet_0 (+ i_8 1))) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (= name_1 (select nondet_0 i_4)) (= (+ name_2 1) name_1) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_1 (select nondet_0 (+ i_8 1)))) (< i_4 1) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (= (+ name_2 1) name_1) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4) (= name_1 (select nondet_0 (+ i_8 1)))) (or (= name_1 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ i_8 1)))) (= name_2 (+ name_1 1)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (= name_2 (select nondet_0 (+ i_4 1))) (< i_4 1))), 3461#(and (or (not (= name_2 (select nondet_0 (+ i_8 1)))) (= (+ result_3 1) 0) (not break_6)) (or (= (+ (- 1) result_3) 0) (not (= name_1 (select nondet_0 (+ i_8 1)))) (not break_6)) (or (< i_4 3) (not (= name_2 name_1))) (or (not (= name_2 (select nondet_0 (+ i_8 1)))) (< i_4 3) break_6 (= (+ name_1 (* (- 1) name_2) 1) 0)) (or (= name_1 (+ name_2 result_3)) (= name_2 (select nondet_0 (+ i_8 1))) (not break_6) (= name_1 (select nondet_0 (+ i_8 1)))) (or (< i_4 3) (= (+ (- 1) name_1 (* (- 1) name_2)) 0) break_6 (not (= name_1 (select nondet_0 (+ i_8 1))))) (or (not (= name_2 name_1)) (not break_6))), 3474#(and (or (not (= name_1 (select nondet_0 2))) (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_2 (select nondet_0 2)) (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (= name_2 (+ name_1 1)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (not (= name_2 (select nondet_0 2))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (<= 1 i_4) break_6 (not (= name_2 name_1)) (= name_2 (select nondet_0 i_4)) (< i_4 0) (= name_2 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (= (+ name_2 1) name_1) break_6 (= name_2 (select nondet_0 i_4)) (= name_1 (select nondet_0 2)) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1))))), 3470#(or (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (= name_2 name_1) (= (select nondet_0 1) name_2) (= i_8 0)), 3468#(and (or (not (= name_1 (select nondet_0 2))) (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1))) (= i_8 0)) (or (= name_2 (select nondet_0 2)) (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (= name_2 (+ name_1 1)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (not (= name_2 (select nondet_0 2))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1))) (= i_8 0)) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 0) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1))) (= i_8 0)) (or (<= 1 i_4) break_6 (not (= name_2 name_1)) (= name_2 (select nondet_0 i_4)) (< i_4 0) (= name_2 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (= (+ name_2 1) name_1) break_6 (= name_2 (select nondet_0 i_4)) (= name_1 (select nondet_0 2)) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1))))), 3475#(and (or (<= (+ result_3 1) 0) (<= (+ result_7 result_3) 0) (not break_10)) (or (<= (+ result_3 1) 0) break_10 (< i_8 3) (<= (+ name_2 result_3) name_1)) (or (<= 0 (+ result_7 result_3)) (not break_10) (< 0 result_3) (<= 1 result_7)) (or break_10 (<= name_1 (+ name_2 result_3)) (< 0 result_3) (<= (+ name_1 1) name_2) (< i_8 3))), 3467#(and (or (= name_2 (select nondet_0 2)) (= name_1 (select nondet_0 i_4)) (= name_2 (+ name_1 1)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (not (= name_1 (select nondet_0 2))) (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ i_4 1))))) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (not (= name_2 (select nondet_0 2)))) (or (= name_1 (select nondet_0 i_4)) (= (+ name_2 1) name_1) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (= name_1 (select nondet_0 2)) (<= 2 i_4)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ i_4 1)))) (<= 2 i_4) (= i_8 0)) (or break_6 (not (= name_2 name_1)) (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (< i_4 1)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (not (= name_2 (select nondet_0 (+ i_4 1)))) (= i_8 0)) (or (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (<= 2 i_4) (< i_4 1) (= i_8 0))), 3447#(and (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) break_6 (not (= name_2 (select nondet_0 i_4))) (<= 1 result_7)) (or (< name_2 name_1) (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) (<= name_2 (+ name_1 result_7)) break_6 (< i_4 2) (<= 1 result_7)) (or (not (< i_4 3)) (<= (+ result_7 1) 0) break_6 (not (= name_1 (select nondet_0 i_4)))) (or (not (< i_4 3)) (= name_1 (select nondet_0 i_4)) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 2) (<= (+ name_1 result_7) name_2) (<= (+ name_1 1) name_2))), 3459#(and (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (= name_2 (+ name_1 1)) (= name_2 (select nondet_0 i_8)) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 i_8))) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (= name_1 (select nondet_0 i_8)) (= (+ name_2 1) name_1) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 (+ 2 i_4))) (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (= (+ name_2 1) name_1) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 i_8))) (< i_4 0) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_2 (select nondet_0 (+ 2 i_4))) (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (= name_2 (+ name_1 1)) break_6 (not (= name_2 (select nondet_0 i_8))) (= name_2 (select nondet_0 i_4)) (< i_4 0) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (<= 1 i_4) break_6 (not (= name_2 name_1)) (= name_2 (select nondet_0 i_4)) (< i_4 0) (= name_2 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (not (= name_2 (select nondet_0 i_8))) (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1))))), 3479#(and (or (= name_2 (select nondet_0 2)) (not (= name_1 (select nondet_0 2))) (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (< 0 result_3) (= (select nondet_0 1) name_2)) (or (<= (+ result_3 1) 0) (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (= name_1 (select nondet_0 2)) (= name_2 name_1) (= (select nondet_0 1) name_2) (<= (+ name_2 result_3) name_1)) (or (= name_2 (select nondet_0 2)) (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (< 0 result_3) (= name_2 name_1) (<= (+ name_1 1) name_2) (= (select nondet_0 1) name_2)) (or (<= (+ result_3 1) 0) (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= name_2 (select nondet_0 2))) (= (select nondet_0 1) name_2)) (or (not (= name_1 (select nondet_0 2))) (= name_2 (select nondet_0 0)) (<= result_3 1) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (= name_2 name_1) (= (select nondet_0 1) name_2))), 3454#(and (or (< name_2 name_1) (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (= name_1 (select nondet_0 2)) (= name_2 name_1) (<= 1 result_7) (= (select nondet_0 1) name_2)) (or (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= name_2 (select nondet_0 2))) (<= 1 result_7) (= (select nondet_0 1) name_2)) (or (= name_2 (select nondet_0 2)) (= name_2 (select nondet_0 0)) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (<= (+ name_1 result_7) name_2) (= name_1 (select nondet_0 2)) (= name_2 name_1) (<= (+ name_1 1) name_2) (= (select nondet_0 1) name_2)) (or (not (= name_1 (select nondet_0 2))) (= name_2 (select nondet_0 0)) (<= (+ result_7 1) 0) (= (select nondet_0 1) name_1) (= name_1 (select nondet_0 0)) (= name_2 name_1) (= (select nondet_0 1) name_2))), 3453#(and (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (= name_2 (+ name_1 1)) break_10 break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_2 (select nondet_0 (+ 2 i_4))) (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (= name_2 (+ name_1 1)) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 0) (not break_10) (= (+ result_7 1) 0) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 (+ 2 i_4))) (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (<= name_2 (+ name_1 result_7)) break_6 (= name_2 (select nondet_0 i_4)) (< i_4 0) (not break_10) (<= 1 result_7) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 (+ 2 i_4))) (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (not break_10) (<= 1 result_7) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (<= result_7 1) break_6 (= name_2 (select nondet_0 i_4)) (not (= name_2 (select nondet_0 (+ 2 i_4)))) (not break_10) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) (= (+ name_2 1) name_1) break_10 break_6 (= name_2 (select nondet_0 i_4)) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (not break_10) (= (+ result_7 1) 0) (not (= name_1 (select nondet_0 (+ 2 i_4)))) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))) (or (= name_2 (select nondet_0 (+ 2 i_4))) (= name_1 (select nondet_0 (+ 2 i_4))) (= name_1 (select nondet_0 i_4)) (<= 1 i_4) break_6 (= name_2 (select nondet_0 i_4)) (<= (+ name_1 result_7) name_2) (< i_4 0) (not break_10) (= name_2 (select nondet_0 (+ i_4 1))) (= name_1 (select nondet_0 (+ i_4 1)))))] [2022-03-15 21:04:43,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 21:04:43,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:04:43,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 21:04:43,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3127, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 21:04:43,969 INFO L87 Difference]: Start difference. First operand 97 states and 209 transitions. Second operand has 46 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 46 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:12:08,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:12:08,740 INFO L93 Difference]: Finished difference Result 676 states and 1185 transitions. [2022-03-15 21:12:08,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 314 states. [2022-03-15 21:12:08,741 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 46 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:12:08,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:12:08,745 INFO L225 Difference]: With dead ends: 676 [2022-03-15 21:12:08,745 INFO L226 Difference]: Without dead ends: 619 [2022-03-15 21:12:08,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49547 ImplicationChecksByTransitivity, 443.2s TimeCoverageRelationStatistics Valid=11092, Invalid=119590, Unknown=0, NotChecked=0, Total=130682 [2022-03-15 21:12:08,757 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1424 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 5821 mSolverCounterSat, 975 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1424 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 975 IncrementalHoareTripleChecker+Valid, 5821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:12:08,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1424 Valid, 0 Invalid, 6796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [975 Valid, 5821 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-03-15 21:12:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-03-15 21:12:08,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 148. [2022-03-15 21:12:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 2.421768707482993) internal successors, (356), 147 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:12:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 356 transitions. [2022-03-15 21:12:08,775 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 356 transitions. Word has length 15 [2022-03-15 21:12:08,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:12:08,775 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 356 transitions. [2022-03-15 21:12:08,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 46 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:12:08,775 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 356 transitions. [2022-03-15 21:12:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:12:08,779 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:12:08,779 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:12:08,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 21:12:08,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 21:12:08,980 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:12:08,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:12:08,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1103949987, now seen corresponding path program 9 times [2022-03-15 21:12:08,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:12:08,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054310980] [2022-03-15 21:12:08,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:12:08,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:12:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:12:09,023 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:12:09,023 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:12:09,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054310980] [2022-03-15 21:12:09,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054310980] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:12:09,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461652377] [2022-03-15 21:12:09,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:12:09,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:12:09,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:12:09,025 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:12:09,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 21:12:09,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:12:09,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:12:09,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:12:09,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:12:09,123 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:12:09,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 21:12:09,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461652377] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:12:09,123 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 21:12:09,123 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-03-15 21:12:09,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [346596079] [2022-03-15 21:12:09,124 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:12:09,125 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:12:09,130 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 98 transitions. [2022-03-15 21:12:09,130 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:12:11,224 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:12:11,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:12:11,224 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:12:11,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:12:11,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-15 21:12:11,225 INFO L87 Difference]: Start difference. First operand 148 states and 356 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:12:11,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:12:11,260 INFO L93 Difference]: Finished difference Result 173 states and 345 transitions. [2022-03-15 21:12:11,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:12:11,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:12:11,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:12:11,261 INFO L225 Difference]: With dead ends: 173 [2022-03-15 21:12:11,261 INFO L226 Difference]: Without dead ends: 144 [2022-03-15 21:12:11,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-15 21:12:11,262 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:12:11,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:12:11,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-03-15 21:12:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 100. [2022-03-15 21:12:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.9898989898989898) internal successors, (197), 99 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:12:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 197 transitions. [2022-03-15 21:12:11,265 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 197 transitions. Word has length 16 [2022-03-15 21:12:11,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:12:11,265 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 197 transitions. [2022-03-15 21:12:11,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:12:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 197 transitions. [2022-03-15 21:12:11,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:12:11,266 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:12:11,266 INFO L514 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:12:11,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 21:12:11,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:12:11,489 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:12:11,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:12:11,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1108487715, now seen corresponding path program 10 times [2022-03-15 21:12:11,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:12:11,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652070222] [2022-03-15 21:12:11,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:12:11,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:12:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:12:11,538 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:12:11,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:12:11,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652070222] [2022-03-15 21:12:11,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652070222] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:12:11,539 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:12:11,539 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 21:12:11,539 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1179100737] [2022-03-15 21:12:11,539 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:12:11,541 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:12:11,550 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 116 transitions. [2022-03-15 21:12:11,550 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:12:13,905 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [5502#(<= 0 (+ 2 i_4)), 5503#(<= 0 (+ 3 i_4)), 5501#(<= 0 (+ i_4 1))] [2022-03-15 21:12:13,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 21:12:13,905 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:12:13,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 21:12:13,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:12:13,906 INFO L87 Difference]: Start difference. First operand 100 states and 197 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:12:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:12:13,950 INFO L93 Difference]: Finished difference Result 39 states and 67 transitions. [2022-03-15 21:12:13,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:12:13,950 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:12:13,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:12:13,951 INFO L225 Difference]: With dead ends: 39 [2022-03-15 21:12:13,951 INFO L226 Difference]: Without dead ends: 0 [2022-03-15 21:12:13,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:12:13,952 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:12:13,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:12:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-15 21:12:13,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-15 21:12:13,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:12:13,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-15 21:12:13,953 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-03-15 21:12:13,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:12:13,953 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-15 21:12:13,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:12:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-15 21:12:13,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-15 21:12:13,955 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2022-03-15 21:12:13,955 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 21:12:13,955 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 21:12:13,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 21:12:13,957 INFO L732 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1] [2022-03-15 21:12:13,958 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 21:12:13,958 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 21:12:13,960 INFO L202 PluginConnector]: Adding new model name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 09:12:13 BasicIcfg [2022-03-15 21:12:13,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 21:12:13,961 INFO L158 Benchmark]: Toolchain (without parser) took 544809.76ms. Allocated memory was 183.5MB in the beginning and 395.3MB in the end (delta: 211.8MB). Free memory was 142.6MB in the beginning and 276.3MB in the end (delta: -133.7MB). Peak memory consumption was 77.7MB. Max. memory is 8.0GB. [2022-03-15 21:12:13,961 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 183.5MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 21:12:13,961 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.62ms. Allocated memory is still 183.5MB. Free memory was 142.6MB in the beginning and 141.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:12:13,962 INFO L158 Benchmark]: Boogie Preprocessor took 13.35ms. Allocated memory is still 183.5MB. Free memory was 141.0MB in the beginning and 140.0MB in the end (delta: 961.5kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:12:13,962 INFO L158 Benchmark]: RCFGBuilder took 333.79ms. Allocated memory is still 183.5MB. Free memory was 140.0MB in the beginning and 127.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-15 21:12:13,962 INFO L158 Benchmark]: TraceAbstraction took 544434.79ms. Allocated memory was 183.5MB in the beginning and 395.3MB in the end (delta: 211.8MB). Free memory was 127.2MB in the beginning and 276.3MB in the end (delta: -149.1MB). Peak memory consumption was 63.0MB. Max. memory is 8.0GB. [2022-03-15 21:12:13,963 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.09ms. Allocated memory is still 183.5MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.62ms. Allocated memory is still 183.5MB. Free memory was 142.6MB in the beginning and 141.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.35ms. Allocated memory is still 183.5MB. Free memory was 141.0MB in the beginning and 140.0MB in the end (delta: 961.5kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 333.79ms. Allocated memory is still 183.5MB. Free memory was 140.0MB in the beginning and 127.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 544434.79ms. Allocated memory was 183.5MB in the beginning and 395.3MB in the end (delta: 211.8MB). Free memory was 127.2MB in the beginning and 276.3MB in the end (delta: -149.1MB). Peak memory consumption was 63.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 23 PlacesBefore, 19 PlacesAfterwards, 18 TransitionsBefore, 14 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 26 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 26, positive: 26, positive conditional: 0, positive unconditional: 26, 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: 16, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, 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 - PositiveResult [Line: 81]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 27 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 544.4s, OverallIterations: 13, TraceHistogramMax: 7, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 481.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2848 SdHoareTripleChecker+Valid, 9.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2848 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2493 mSDsCounter, 1927 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13658 IncrementalHoareTripleChecker+Invalid, 15585 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1927 mSolverCounterUnsat, 0 mSDtfsCounter, 13658 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1237 GetRequests, 315 SyntacticMatches, 24 SemanticMatches, 898 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59970 ImplicationChecksByTransitivity, 481.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=11, InterpolantAutomatonStates: 685, 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, 13 MinimizatonAttempts, 836 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 287 NumberOfCodeBlocks, 287 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 361 ConstructedInterpolants, 1 QuantifiedInterpolants, 4910 SizeOfPredicates, 95 NumberOfNonLiveVariables, 687 ConjunctsInSsa, 187 ConjunctsInUnsatCore, 30 InterpolantComputations, 5 PerfectInterpolantSequences, 97/224 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-03-15 21:12:13,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...