/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-trans.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:03:14,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:03:14,103 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:03:14,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:03:14,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:03:14,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:03:14,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:03:14,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:03:14,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:03:14,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:03:14,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:03:14,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:03:14,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:03:14,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:03:14,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:03:14,144 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:03:14,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:03:14,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:03:14,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:03:14,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:03:14,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:03:14,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:03:14,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:03:14,157 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:03:14,162 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:03:14,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:03:14,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:03:14,163 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:03:14,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:03:14,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:03:14,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:03:14,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:03:14,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:03:14,165 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:03:14,165 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:03:14,166 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:03:14,166 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:03:14,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:03:14,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:03:14,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:03:14,167 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:03:14,171 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:14,198 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:03:14,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:03:14,199 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:03:14,199 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:03:14,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:03:14,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:03:14,200 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:03:14,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:03:14,200 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:03:14,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:03:14,200 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:03:14,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:03:14,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:03:14,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:03:14,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:03:14,201 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:03:14,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:03:14,201 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:03:14,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:03:14,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:03:14,201 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:03:14,201 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:03:14,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:03:14,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:03:14,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:03:14,202 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:03:14,202 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:03:14,203 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:03:14,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:03:14,203 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:03:14,203 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:03:14,203 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:03:14,203 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:14,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:03:14,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:03:14,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:03:14,376 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:03:14,377 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:03:14,378 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-trans.wvr.bpl [2022-03-15 21:03:14,378 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-trans.wvr.bpl' [2022-03-15 21:03:14,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:03:14,396 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:03:14,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:03:14,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:03:14,403 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:03:14,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:14" (1/1) ... [2022-03-15 21:03:14,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:14" (1/1) ... [2022-03-15 21:03:14,425 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:03:14,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:03:14,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:03:14,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:03:14,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:03:14,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:14" (1/1) ... [2022-03-15 21:03:14,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:14" (1/1) ... [2022-03-15 21:03:14,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:14" (1/1) ... [2022-03-15 21:03:14,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:14" (1/1) ... [2022-03-15 21:03:14,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:14" (1/1) ... [2022-03-15 21:03:14,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:14" (1/1) ... [2022-03-15 21:03:14,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:14" (1/1) ... [2022-03-15 21:03:14,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:03:14,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:03:14,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:03:14,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:03:14,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:14" (1/1) ... [2022-03-15 21:03:14,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:03:14,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:03:14,467 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:14,475 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:14,501 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:03:14,502 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:03:14,502 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:03:14,502 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:03:14,502 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:03:14,502 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:03:14,502 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:03:14,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:03:14,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:03:14,503 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 21:03:14,503 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 21:03:14,503 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 21:03:14,503 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:14,546 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:03:14,547 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:03:14,660 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:03:14,758 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:03:14,758 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 21:03:14,766 INFO L202 PluginConnector]: Adding new model name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:03:14 BoogieIcfgContainer [2022-03-15 21:03:14,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:03:14,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:03:14,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:03:14,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:03:14,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:03:14" (1/2) ... [2022-03-15 21:03:14,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a9010a and model type name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:03:14, skipping insertion in model container [2022-03-15 21:03:14,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:03:14" (2/2) ... [2022-03-15 21:03:14,775 INFO L111 eAbstractionObserver]: Analyzing ICFG name-comparator-trans.wvr.bpl [2022-03-15 21:03:14,779 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:03:14,779 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:03:14,779 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:03:14,779 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:03:14,843 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 21:03:14,885 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:03:14,889 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:14,889 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 21:03:14,896 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:03:14,903 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 74 flow [2022-03-15 21:03:14,904 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 74 flow [2022-03-15 21:03:14,905 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 74 flow [2022-03-15 21:03:14,929 INFO L129 PetriNetUnfolder]: 3/22 cut-off events. [2022-03-15 21:03:14,930 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 21:03:14,932 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 3/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2022-03-15 21:03:14,932 INFO L116 LiptonReduction]: Number of co-enabled transitions 144 [2022-03-15 21:03:15,073 INFO L131 LiptonReduction]: Checked pairs total: 98 [2022-03-15 21:03:15,074 INFO L133 LiptonReduction]: Total number of compositions: 6 [2022-03-15 21:03:15,083 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 20 transitions, 64 flow [2022-03-15 21:03:15,100 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 54 states, 53 states have (on average 2.830188679245283) internal successors, (150), 53 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have 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:15,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 53 states have (on average 2.830188679245283) internal successors, (150), 53 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have 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:15,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 21:03:15,106 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:03:15,106 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:03:15,106 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:03:15,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:03:15,109 INFO L85 PathProgramCache]: Analyzing trace with hash 237822303, now seen corresponding path program 1 times [2022-03-15 21:03:15,121 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:03:15,122 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078226120] [2022-03-15 21:03:15,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:03:15,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:03:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:03:15,287 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:15,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:03:15,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078226120] [2022-03-15 21:03:15,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078226120] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:03:15,288 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:03:15,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:03:15,289 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1912634121] [2022-03-15 21:03:15,289 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:03:15,293 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:03:15,316 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 109 transitions. [2022-03-15 21:03:15,316 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:03:16,260 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [147#(and (or (not break_11) (<= result_8 0)) (or (< i_9 3) break_11))] [2022-03-15 21:03:16,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 21:03:16,262 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:03:16,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 21:03:16,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:03:16,276 INFO L87 Difference]: Start difference. First operand has 54 states, 53 states have (on average 2.830188679245283) internal successors, (150), 53 states have internal predecessors, (150), 0 states have call successors, (0), 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 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have 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:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:03:16,332 INFO L93 Difference]: Finished difference Result 88 states and 247 transitions. [2022-03-15 21:03:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 21:03:16,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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:16,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:03:16,339 INFO L225 Difference]: With dead ends: 88 [2022-03-15 21:03:16,340 INFO L226 Difference]: Without dead ends: 69 [2022-03-15 21:03:16,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 21:03:16,342 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:03:16,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:03:16,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-03-15 21:03:16,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-03-15 21:03:16,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 2.8676470588235294) internal successors, (195), 68 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have 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:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 195 transitions. [2022-03-15 21:03:16,366 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 195 transitions. Word has length 13 [2022-03-15 21:03:16,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:03:16,367 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 195 transitions. [2022-03-15 21:03:16,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have 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:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 195 transitions. [2022-03-15 21:03:16,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:03:16,368 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:03:16,368 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:03:16,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:03:16,368 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:03:16,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:03:16,369 INFO L85 PathProgramCache]: Analyzing trace with hash -800848176, now seen corresponding path program 1 times [2022-03-15 21:03:16,369 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:03:16,369 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221231538] [2022-03-15 21:03:16,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:03:16,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:03:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:03:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:03:16,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:03:16,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221231538] [2022-03-15 21:03:16,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221231538] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:03:16,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938834440] [2022-03-15 21:03:16,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:03:16,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:03:16,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:03:16,463 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:16,487 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:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:03:16,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:03:16,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:03:16,715 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:16,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 21:03:16,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938834440] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:03:16,716 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 21:03:16,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2022-03-15 21:03:16,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2102069543] [2022-03-15 21:03:16,717 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:03:16,718 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:03:16,725 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 146 transitions. [2022-03-15 21:03:16,725 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:03:18,347 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [436#(and (or (< i_13 3) (= name_3 name_2)) (or (not break_15) (= name_3 name_2))), 444#(or (= name_3 name_2) (not (= name_2 name_1))), 445#(and (or (not break_15) (= name_3 name_2) (not (= name_2 name_1))) (or (= name_3 name_2) (<= i_13 0))), 430#(not (= name_3 name_1)), 429#(and (not break_15) (< i_13 3)), 439#(and (or break_11 (<= i_13 0)) (or (<= i_5 0) break_11) (or (not break_7) (not break_15) break_11)), 446#(or break_11 (not (= name_2 name_1)) (not (= name_3 name_1))), 437#(or (= name_3 name_2) (not (= name_3 name_1))), 442#(or break_11 (not (= name_2 name_1))), 433#(and (or (not break_15) break_11) (or (< i_13 3) break_11)), 428#(and (or (not break_15) (not (= name_2 name_1))) (<= i_13 0)), 438#(and (or (<= i_5 0) break_11) (or (not break_7) break_11)), 443#(and (or break_11 (<= i_13 0)) (or (not break_15) break_11 (not (= name_2 name_1)))), 434#(or break_11 (not (= name_3 name_1))), 435#(= name_3 name_2), 440#(and (or (<= i_5 0) (= name_3 name_2)) (or (not break_7) (= name_3 name_2))), 427#(not (= name_2 name_1)), 432#break_11, 431#(or (not (= name_2 name_1)) (not (= name_3 name_1))), 441#(and (or (<= i_5 0) (= name_3 name_2)) (or (= name_3 name_2) (<= i_13 0)) (or (not break_7) (not break_15) (= name_3 name_2)))] [2022-03-15 21:03:18,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:03:18,347 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:03:18,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:03:18,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2022-03-15 21:03:18,348 INFO L87 Difference]: Start difference. First operand 69 states and 195 transitions. Second operand has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have 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:19,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:03:19,787 INFO L93 Difference]: Finished difference Result 189 states and 537 transitions. [2022-03-15 21:03:19,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 21:03:19,788 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 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:03:19,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:03:19,789 INFO L225 Difference]: With dead ends: 189 [2022-03-15 21:03:19,789 INFO L226 Difference]: Without dead ends: 185 [2022-03-15 21:03:19,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=413, Invalid=2449, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 21:03:19,792 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 193 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:03:19,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 0 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:03:19,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-03-15 21:03:19,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 117. [2022-03-15 21:03:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.8879310344827585) internal successors, (335), 116 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have 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:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 335 transitions. [2022-03-15 21:03:19,807 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 335 transitions. Word has length 14 [2022-03-15 21:03:19,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:03:19,807 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 335 transitions. [2022-03-15 21:03:19,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have 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:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 335 transitions. [2022-03-15 21:03:19,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:03:19,809 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:03:19,809 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:03:19,825 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:20,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:03:20,010 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:03:20,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:03:20,011 INFO L85 PathProgramCache]: Analyzing trace with hash 855554270, now seen corresponding path program 1 times [2022-03-15 21:03:20,015 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:03:20,015 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408493576] [2022-03-15 21:03:20,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:03:20,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:03:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:03:20,244 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:20,244 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:03:20,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408493576] [2022-03-15 21:03:20,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408493576] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:03:20,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582298459] [2022-03-15 21:03:20,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:03:20,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:03:20,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:03:20,246 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:20,247 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:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:03:20,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 21:03:20,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:03:20,537 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 171 treesize of output 135 [2022-03-15 21:03:20,840 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:20,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:03:21,384 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:03:21,384 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 159 treesize of output 135 [2022-03-15 21:03:21,500 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:21,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582298459] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:03:21,501 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:03:21,501 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 21:03:21,501 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1321023961] [2022-03-15 21:03:21,501 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:03:21,502 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:03:21,511 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 188 transitions. [2022-03-15 21:03:21,511 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:03:32,467 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [1044#(and (or (not (< i_9 3)) break_11 break_7 (< i_9 2) (<= i_5 1)) (or (not (< i_9 3)) (= (- 1) result_4) (not break_7) break_11 (<= i_13 0) (not (= name_2 (select nondet_0 i_9)))) (or (not (< i_9 3)) (not break_7) (not break_15) break_11 (not (= name_2 (select nondet_0 i_9))) (= (+ result_4 1) 0)) (or (not (< i_9 3)) break_11 break_7 (not (= name_3 (select nondet_0 i_9))) (<= i_5 1)) (or (not (< i_9 3)) (not break_7) (= (+ (* (- 1) name_3) name_2 1) 0) (not break_15) break_11 (= name_3 (select nondet_0 i_9)) (= (+ result_4 1) 0) (< i_9 2)) (or (not (< i_9 3)) break_11 break_7 (not (= name_2 (select nondet_0 i_9))) (<= i_5 1)) (or (not (< i_9 3)) (= (- 1) result_4) (not break_7) (= (+ (* (- 1) name_3) name_2 1) 0) break_11 (= name_3 (select nondet_0 i_9)) (<= i_13 0) (< i_9 2))), 1063#(and (or (<= i_9 1) break_11 (not (= name_1 (select nondet_0 0))) (= name_2 name_1)) (or (<= i_9 1) (not (= name_2 (select nondet_0 0))) break_11 (= name_2 name_1)) (or (= (+ result_8 1) 0) (not (= name_1 (select nondet_0 0))) (not (= name_3 name_1)) (not break_11) (= name_2 name_1))), 1048#(and (or (not break_7) (= name_3 name_2) (not (= name_2 (select nondet_0 0))) (= (+ result_4 1) 0)) (or (not (= name_3 (select nondet_0 0))) (= name_3 name_2) break_7 (<= i_5 1)) (or (= name_3 name_2) (not (= name_2 (select nondet_0 0))) break_7 (<= i_5 1))), 1054#(and (or (= name_3 name_2) (not (= name_2 (select nondet_0 0))) break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= i_5 0) (= name_2 (select nondet_0 i_5)) (= name_3 name_2) (not (= name_2 (select nondet_0 0))) break_7 (not (< i_5 3))) (or (<= i_5 0) (not (= name_3 (select nondet_0 0))) (= name_2 (select nondet_0 i_5)) (= name_3 name_2) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)))), 1057#(and (or (not (< i_9 3)) break_11 (not (= name_1 (select nondet_0 0))) (= name_2 name_1) (not (= name_2 (select nondet_0 i_9)))) (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) break_11 (not (= name_1 (select nondet_0 0))) (= name_3 (select nondet_0 i_9)) (= name_2 name_1) (< i_9 2))), 1035#(and (or (= (+ result_8 1) 0) break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= i_5 0) (= name_2 (select nondet_0 i_5)) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)))), 1038#(and (or (not (< i_9 3)) (not break_7) (= (+ (* (- 1) name_3) name_2 1) 0) break_11 (= name_3 (select nondet_0 i_9)) (= (+ result_4 1) 0) (< i_9 2)) (or (not (< i_9 3)) break_11 break_7 (< i_9 2) (<= i_5 1)) (or (not (< i_9 3)) break_11 break_7 (not (= name_3 (select nondet_0 i_9))) (<= i_5 1)) (or (not (< i_9 3)) (not break_7) break_11 (not (= name_2 (select nondet_0 i_9))) (= (+ result_4 1) 0)) (or (not (< i_9 3)) break_11 break_7 (not (= name_2 (select nondet_0 i_9))) (<= i_5 1))), 1065#(and (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) break_11 (not (= name_1 (select nondet_0 0))) (= name_3 (select nondet_0 i_9)) (<= i_13 0) (= name_2 name_1) (< i_9 2)) (or (not (< i_9 3)) (not break_15) break_11 (not (= name_1 (select nondet_0 0))) (= name_2 name_1) (not (= name_2 (select nondet_0 i_9)))) (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) (not break_15) break_11 (not (= name_1 (select nondet_0 0))) (= name_3 (select nondet_0 i_9)) (= name_2 name_1) (< i_9 2)) (or (not (< i_9 3)) break_11 (not (= name_1 (select nondet_0 0))) (<= i_13 0) (= name_2 name_1) (not (= name_2 (select nondet_0 i_9))))), 1032#(and (or (= (+ result_8 1) 0) (not break_11) (= (+ result_4 1) 0)) (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) break_11 (= (+ result_4 1) 0))), 1042#(and (or (= (+ result_8 1) 0) (not break_15) break_7 (not break_11) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= i_5 0) (= name_2 (select nondet_0 i_5)) break_7 (= name_1 (select nondet_0 i_5)) (not break_11) (not (< i_5 3))) (or (= (+ result_8 1) 0) break_7 (not break_11) (<= i_13 0) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) (not break_15) break_11 break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) break_11 break_7 (<= i_13 0) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= i_5 0) (= name_2 (select nondet_0 i_5)) (< i_9 3) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)))), 1056#(and (or (= (+ result_8 1) 0) (not (= name_1 (select nondet_0 0))) (not break_11) (= name_2 name_1)) (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) break_11 (not (= name_1 (select nondet_0 0))) (= name_2 name_1))), 1049#(and (or (not break_7) (not break_15) (= name_3 name_2) (not (= name_2 (select nondet_0 0))) (= (+ result_4 1) 0)) (or (= (- 1) result_4) (not break_7) (= name_3 name_2) (not (= name_2 (select nondet_0 0))) (<= i_13 0)) (or (not (= name_3 (select nondet_0 0))) (= name_3 name_2) break_7 (<= i_5 1)) (or (= name_3 name_2) (not (= name_2 (select nondet_0 0))) break_7 (<= i_5 1))), 1067#(and (or break_11 (not (= name_1 (select nondet_0 0))) (= name_2 name_1) (= i_9 0)) (or (not (= name_2 (select nondet_0 0))) break_11 (= name_2 name_1) (= i_9 0)) (or break_11 (not (= name_1 (select nondet_0 0))) (not (= name_3 name_2)) (= name_2 name_1))), 1064#(and (or (not break_15) (= name_3 name_2) (not (= name_2 (select nondet_0 0))) break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (= name_3 name_2) (not (= name_2 (select nondet_0 0))) break_7 (<= i_13 0) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= i_5 0) (not (= name_3 (select nondet_0 0))) (= name_2 (select nondet_0 i_5)) (= name_3 name_2) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3))) (or (<= i_5 0) (= name_2 (select nondet_0 i_5)) (= name_3 name_2) (not (= name_2 (select nondet_0 0))) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)))), 1037#(and (or (not (< i_9 3)) break_11 (not (= name_2 (select nondet_0 i_9))) (= (+ result_4 1) 0)) (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) break_11 (= name_3 (select nondet_0 i_9)) (= (+ result_4 1) 0) (< i_9 2))), 1040#(and (or (<= i_5 0) (= name_2 (select nondet_0 i_5)) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3))) (or (= (+ result_8 1) 0) (not break_15) break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (= (+ result_8 1) 0) break_7 (<= i_13 0) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)))), 1043#(and (or (not (< i_9 3)) (not break_15) break_11 (not (= name_2 (select nondet_0 i_9))) (= (+ result_4 1) 0)) (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) (< i_13 3) break_11 (= name_3 (select nondet_0 i_9)) (= (+ result_4 1) 0) (< i_9 2)) (or (not (< i_9 3)) (< i_13 3) break_11 (not (= name_2 (select nondet_0 i_9))) (= (+ result_4 1) 0)) (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) (not break_15) break_11 (= name_3 (select nondet_0 i_9)) (= (+ result_4 1) 0) (< i_9 2))), 1060#(or (= (+ result_8 1) 0) (not (= name_1 (select nondet_0 0))) (not (= name_3 name_1)) (= name_2 name_1)), 1034#(and (or (< i_9 3) break_7 (<= i_5 1)) (or (not break_7) (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) break_11 (= (+ result_4 1) 0)) (or (= (+ result_8 1) 0) (not break_7) (not break_11) (= (+ result_4 1) 0)) (or break_7 (not break_11) (<= i_5 1))), 1058#(and (or (= (+ result_8 1) 0) break_7 (not (= name_3 name_1)) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= 3 i_5) (<= i_5 0) (= name_2 (select nondet_0 i_5)) break_7 (= name_1 (select nondet_0 i_5)))), 1045#(and (or (not (< i_9 3)) break_11 break_7 (<= i_13 0) (not (= name_2 (select nondet_0 i_9))) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= i_5 0) (not (< i_9 3)) (= name_2 (select nondet_0 i_5)) break_11 break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)) (< i_9 2)) (or (not (< i_9 3)) (not break_15) break_11 break_7 (not (= name_2 (select nondet_0 i_9))) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= i_5 0) (not (< i_9 3)) (= name_2 (select nondet_0 i_5)) break_11 break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)) (not (= name_3 (select nondet_0 i_9)))) (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) break_11 break_7 (= name_3 (select nondet_0 i_9)) (<= i_13 0) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)) (< i_9 2)) (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) (not break_15) break_11 break_7 (= name_3 (select nondet_0 i_9)) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)) (< i_9 2)) (or (<= i_5 0) (not (< i_9 3)) (= name_2 (select nondet_0 i_5)) break_11 break_7 (= name_1 (select nondet_0 i_5)) (not (= name_2 (select nondet_0 i_9))) (not (< i_5 3)))), 1041#(and (or (= (- 1) result_4) (not break_7) (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) break_11 (<= i_13 0)) (or (< i_9 3) break_7 (<= i_5 1)) (or (not break_7) (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) (not break_15) break_11 (= (+ result_4 1) 0)) (or (= (+ result_8 1) 0) (= (- 1) result_4) (not break_7) (not break_11) (<= i_13 0)) (or (= (+ result_8 1) 0) (not break_7) (not break_15) (not break_11) (= (+ result_4 1) 0)) (or break_7 (not break_11) (<= i_5 1))), 1050#(or (= (+ result_8 1) 0) (not (= name_3 name_1)) (= (+ result_4 1) 0)), 1062#(and (or (= (+ result_8 1) 0) (not break_15) (not (= name_1 (select nondet_0 0))) (not break_11) (= name_2 name_1)) (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) break_11 (not (= name_1 (select nondet_0 0))) (<= i_13 0) (= name_2 name_1)) (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) (not break_15) break_11 (not (= name_1 (select nondet_0 0))) (= name_2 name_1)) (or (= (+ result_8 1) 0) (not (= name_1 (select nondet_0 0))) (not break_11) (<= i_13 0) (= name_2 name_1))), 1036#(and (or (<= i_5 0) (= name_2 (select nondet_0 i_5)) break_7 (= name_1 (select nondet_0 i_5)) (not break_11) (not (< i_5 3))) (or (<= i_5 0) (= name_2 (select nondet_0 i_5)) (< i_9 3) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3))) (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) break_11 break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (= (+ result_8 1) 0) break_7 (not break_11) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)))), 1039#(and (or (<= i_5 0) (not (< i_9 3)) (= name_2 (select nondet_0 i_5)) break_11 break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)) (< i_9 2)) (or (<= i_5 0) (not (< i_9 3)) (= name_2 (select nondet_0 i_5)) break_11 break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)) (not (= name_3 (select nondet_0 i_9)))) (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) break_11 break_7 (= name_3 (select nondet_0 i_9)) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)) (< i_9 2)) (or (not (< i_9 3)) break_11 break_7 (not (= name_2 (select nondet_0 i_9))) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= 3 i_5) (<= i_5 0) (not (< i_9 3)) (= name_2 (select nondet_0 i_5)) break_11 break_7 (not (= name_2 (select nondet_0 i_9))))), 1066#(and (or (= name_1 (select nondet_0 i_9)) break_11 break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or break_11 break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)) (= i_9 0)) (or break_11 break_7 (not (= name_3 name_2)) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= i_5 0) (= name_2 (select nondet_0 i_5)) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3))) (or break_11 break_7 (not (< i_5 3)) (= i_9 0) (not (= name_2 (select nondet_0 i_5))))), 1051#(and (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) break_11 (not (= name_3 name_1)) (= (+ result_4 1) 0)) (or (= (+ result_8 1) 0) (not (= name_3 name_1)) (not break_11) (= (+ result_4 1) 0))), 1055#(or (= (+ result_8 1) 0) (not (= name_1 (select nondet_0 0))) (= name_2 name_1)), 1033#(and (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) (< i_13 3) break_11 (= (+ result_4 1) 0)) (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) (not break_15) break_11 (= (+ result_4 1) 0)) (or (= (+ result_8 1) 0) (< i_13 3) (not break_11) (= (+ result_4 1) 0)) (or (= (+ result_8 1) 0) (not break_15) (not break_11) (= (+ result_4 1) 0))), 1053#(or (= name_3 name_2) (not (= name_2 (select nondet_0 0))) (not (= name_3 name_1)) (= (+ result_4 1) 0)), 1061#(and (or (<= i_9 1) break_11 break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= i_5 0) (= name_2 (select nondet_0 i_5)) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3))) (or (<= i_9 1) break_11 break_7 (not (< i_5 3)) (not (= name_2 (select nondet_0 i_5)))) (or (= (+ result_8 1) 0) break_7 (not (= name_3 name_1)) (not break_11) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)))), 1031#(and (or (= (+ result_8 1) 0) (not break_15) (= (+ result_4 1) 0)) (or (= (+ result_8 1) 0) (< i_13 3) (= (+ result_4 1) 0))), 1047#(and (or (< i_13 3) (= name_3 name_2) (not (= name_2 (select nondet_0 0))) (= (+ result_4 1) 0)) (or (not break_15) (= name_3 name_2) (not (= name_2 (select nondet_0 0))) (= (+ result_4 1) 0))), 1052#(and (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) break_11 (not (= name_3 name_1)) (= name_3 (select nondet_0 i_9)) (= (+ result_4 1) 0) (< i_9 2)) (or (not (< i_9 3)) break_11 (not (= name_3 name_1)) (not (= name_2 (select nondet_0 i_9))) (= (+ result_4 1) 0))), 1059#(and (or (= (+ result_8 1) 0) (not break_15) (not (= name_1 (select nondet_0 0))) (= name_2 name_1)) (or (= (+ result_8 1) 0) (not (= name_1 (select nondet_0 0))) (<= i_13 0) (= name_2 name_1))), 1046#(or (= name_3 name_2) (not (= name_2 (select nondet_0 0))) (= (+ result_4 1) 0))] [2022-03-15 21:03:32,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 21:03:32,468 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:03:32,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 21:03:32,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3728, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 21:03:32,470 INFO L87 Difference]: Start difference. First operand 117 states and 335 transitions. Second operand has 47 states, 46 states have (on average 3.0869565217391304) internal successors, (142), 47 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:03:55,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:03:55,020 INFO L93 Difference]: Finished difference Result 679 states and 1886 transitions. [2022-03-15 21:03:55,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-03-15 21:03:55,020 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 3.0869565217391304) internal successors, (142), 47 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:03:55,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:03:55,024 INFO L225 Difference]: With dead ends: 679 [2022-03-15 21:03:55,024 INFO L226 Difference]: Without dead ends: 657 [2022-03-15 21:03:55,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 145 SyntacticMatches, 2 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6776 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=3489, Invalid=24903, Unknown=0, NotChecked=0, Total=28392 [2022-03-15 21:03:55,029 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1497 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 5666 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 5666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:03:55,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1497 Valid, 0 Invalid, 6014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 5666 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-03-15 21:03:55,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2022-03-15 21:03:55,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 176. [2022-03-15 21:03:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 3.0285714285714285) internal successors, (530), 175 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have 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,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 530 transitions. [2022-03-15 21:03:55,045 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 530 transitions. Word has length 15 [2022-03-15 21:03:55,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:03:55,045 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 530 transitions. [2022-03-15 21:03:55,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.0869565217391304) internal successors, (142), 47 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:03:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 530 transitions. [2022-03-15 21:03:55,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:03:55,046 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:03:55,046 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:03:55,067 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:55,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-03-15 21:03:55,247 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:03:55,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:03:55,248 INFO L85 PathProgramCache]: Analyzing trace with hash -888722441, now seen corresponding path program 1 times [2022-03-15 21:03:55,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:03:55,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676035824] [2022-03-15 21:03:55,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:03:55,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:03:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:03:55,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:03:55,321 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:03:55,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676035824] [2022-03-15 21:03:55,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676035824] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:03:55,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637203546] [2022-03-15 21:03:55,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:03:55,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:03:55,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:03:55,323 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:55,323 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:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:03:55,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:03:55,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:03:55,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:03:55,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 21:03:55,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637203546] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:03:55,456 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 21:03:55,456 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-03-15 21:03:55,457 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [742283073] [2022-03-15 21:03:55,457 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:03:55,458 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:03:55,464 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 188 transitions. [2022-03-15 21:03:55,464 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:03:57,162 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2461#(and (or (not break_7) (<= result_4 0)) (or (< i_5 3) break_7 (<= name_1 name_2)))] [2022-03-15 21:03:57,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 21:03:57,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:03:57,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 21:03:57,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:03:57,163 INFO L87 Difference]: Start difference. First operand 176 states and 530 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:03:57,220 INFO L93 Difference]: Finished difference Result 200 states and 592 transitions. [2022-03-15 21:03:57,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 21:03:57,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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:03:57,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:03:57,221 INFO L225 Difference]: With dead ends: 200 [2022-03-15 21:03:57,221 INFO L226 Difference]: Without dead ends: 158 [2022-03-15 21:03:57,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 77 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:03:57,222 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:03:57,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:03:57,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-03-15 21:03:57,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 130. [2022-03-15 21:03:57,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 2.9689922480620154) internal successors, (383), 129 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have 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,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 383 transitions. [2022-03-15 21:03:57,227 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 383 transitions. Word has length 15 [2022-03-15 21:03:57,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:03:57,228 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 383 transitions. [2022-03-15 21:03:57,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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,228 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 383 transitions. [2022-03-15 21:03:57,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:03:57,228 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:03:57,228 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:03:57,244 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:57,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:03:57,440 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:03:57,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:03:57,440 INFO L85 PathProgramCache]: Analyzing trace with hash 664422544, now seen corresponding path program 2 times [2022-03-15 21:03:57,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:03:57,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259064120] [2022-03-15 21:03:57,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:03:57,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:03:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:03:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:03:57,513 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:03:57,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259064120] [2022-03-15 21:03:57,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259064120] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:03:57,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928686409] [2022-03-15 21:03:57,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:03:57,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:03:57,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:03:57,515 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:57,515 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:57,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:03:57,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:03:57,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 21:03:57,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:03:57,641 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 24 treesize of output 18 [2022-03-15 21:03:57,684 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:57,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:03:57,805 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:03:57,806 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:03:57,812 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:57,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928686409] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:03:57,812 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:03:57,812 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2022-03-15 21:03:57,812 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [81455221] [2022-03-15 21:03:57,812 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:03:57,813 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:03:57,822 INFO L252 McrAutomatonBuilder]: Finished intersection with 103 states and 230 transitions. [2022-03-15 21:03:57,822 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:04:03,211 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [3044#(and (or (not (< i_9 3)) (= name_2 (select nondet_0 i_5)) break_11 break_7 (not (= name_2 (select nondet_0 i_9))) (<= 2 i_5)) (or (not (< i_9 3)) (= name_2 (select nondet_0 i_5)) break_11 break_7 (<= 2 i_5) (< i_9 2))), 3035#(and (or (< i_9 3) break_11) (or (= (+ result_8 1) 0) (not break_11))), 3032#(or (<= 3 i_5) (= (+ result_8 1) 0) break_7), 3037#(and (or (= name_2 (select nondet_0 i_5)) (< i_9 3) break_11 break_7 (<= 2 i_5)) (or (= (+ result_8 1) 0) (= name_2 (select nondet_0 i_5)) break_7 (not break_11) (<= 2 i_5))), 3034#(or (= (+ result_8 1) 0) (= name_2 (select nondet_0 0))), 3046#(and (or (<= 3 i_5) break_7 (= i_9 0)) (or (<= 3 i_5) break_7 (not (= name_2 (select nondet_0 i_9))))), 3033#(or (= (+ result_8 1) 0) (= name_2 (select nondet_0 i_5)) break_7 (<= 2 i_5)), 3047#(and (or (= name_2 (select nondet_0 i_5)) break_7 (not (= name_2 (select nondet_0 i_9))) (<= 2 i_5)) (or (= name_2 (select nondet_0 i_5)) break_7 (= i_9 0) (<= 2 i_5))), 3038#(and (or (= (+ result_8 1) 0) (= name_2 (select nondet_0 0)) (not break_11)) (or (< i_9 3) (= name_2 (select nondet_0 0)) break_11)), 3040#(and (or (= (+ result_8 1) 0) (= name_2 (select nondet_0 i_5)) break_7 (not break_11) (<= 2 i_5)) (or (<= i_9 1) (= name_2 (select nondet_0 i_5)) break_11 break_7 (<= 2 i_5))), 3048#(or (= name_2 (select nondet_0 0)) (= i_9 0)), 3041#(and (or (= (+ result_8 1) 0) (= name_2 (select nondet_0 0)) (not break_11)) (or (<= i_9 1) (= name_2 (select nondet_0 0)) break_11)), 3036#(and (or (<= 3 i_5) (= (+ result_8 1) 0) break_7 (not break_11)) (or (<= 3 i_5) (< i_9 3) break_11 break_7)), 3043#(and (or (<= 3 i_5) (not (< i_9 3)) break_11 break_7 (not (= name_2 (select nondet_0 i_9)))) (or (<= 3 i_5) (not (< i_9 3)) break_11 break_7 (< i_9 2))), 3042#(and (or (not (< i_9 3)) break_11 (< i_9 2)) (or (not (< i_9 3)) break_11 (not (= name_2 (select nondet_0 i_9))))), 3045#(and (or (not (< i_9 3)) (= name_2 (select nondet_0 0)) break_11 (< i_9 2)) (or (not (< i_9 3)) (= name_2 (select nondet_0 0)) break_11 (not (= name_2 (select nondet_0 i_9))))), 3039#(and (or (<= 3 i_5) (<= i_9 1) break_11 break_7) (or (<= 3 i_5) (= (+ result_8 1) 0) break_7 (not break_11))), 3050#(or (= name_2 (select nondet_0 i_5)) (not (= name_2 (select nondet_0 0))) break_7 (<= 2 i_5)), 3049#(or (<= 3 i_5) (not (= name_2 (select nondet_0 0))) break_7)] [2022-03-15 21:04:03,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:04:03,212 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:04:03,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:04:03,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1111, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 21:04:03,212 INFO L87 Difference]: Start difference. First operand 130 states and 383 transitions. Second operand has 27 states, 26 states have (on average 4.423076923076923) internal successors, (115), 27 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:04,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:04:04,645 INFO L93 Difference]: Finished difference Result 321 states and 856 transitions. [2022-03-15 21:04:04,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 21:04:04,646 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.423076923076923) internal successors, (115), 27 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) Word has length 16 [2022-03-15 21:04:04,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:04:04,647 INFO L225 Difference]: With dead ends: 321 [2022-03-15 21:04:04,647 INFO L226 Difference]: Without dead ends: 283 [2022-03-15 21:04:04,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=646, Invalid=3260, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 21:04:04,649 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 327 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:04:04,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 0 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:04:04,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-03-15 21:04:04,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 105. [2022-03-15 21:04:04,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 2.9038461538461537) internal successors, (302), 104 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have 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:04,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 302 transitions. [2022-03-15 21:04:04,653 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 302 transitions. Word has length 16 [2022-03-15 21:04:04,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:04:04,653 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 302 transitions. [2022-03-15 21:04:04,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.423076923076923) internal successors, (115), 27 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:04,654 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 302 transitions. [2022-03-15 21:04:04,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:04:04,654 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:04:04,654 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:04:04,672 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:04:04,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:04:04,867 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:04:04,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:04:04,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1168973617, now seen corresponding path program 3 times [2022-03-15 21:04:04,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:04:04,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436320950] [2022-03-15 21:04:04,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:04:04,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:04:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:04:05,013 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:04:05,013 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:04:05,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436320950] [2022-03-15 21:04:05,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436320950] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:04:05,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4340611] [2022-03-15 21:04:05,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:04:05,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:04:05,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:04:05,015 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:04:05,015 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:04:05,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:04:05,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:04:05,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 21:04:05,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:04:05,155 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 72 treesize of output 56 [2022-03-15 21:04:05,275 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:04:05,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:04:05,412 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:04:05,413 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:04:05,446 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:04:05,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4340611] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:04:05,446 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:04:05,446 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-03-15 21:04:05,446 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1753961498] [2022-03-15 21:04:05,446 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:04:05,448 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:04:05,456 INFO L252 McrAutomatonBuilder]: Finished intersection with 105 states and 236 transitions. [2022-03-15 21:04:05,457 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:04:13,854 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 48 new interpolants: [3794#(and (or (not (< i_9 3)) break_11 break_7 (<= i_13 0) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= i_5 0) (not (< i_9 3)) break_11 break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3))) (or (not (< i_9 3)) (not break_15) break_11 break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)))), 3786#(and (or (not break_15) (= name_3 (select nondet_0 0)) (= (+ result_4 1) 0)) (or (< i_13 3) (= name_3 (select nondet_0 0)) (= (+ result_4 1) 0))), 3799#(or (not (< i_9 3)) break_11 (not (= name_1 (select nondet_0 0)))), 3817#(and (or (= name_3 (select nondet_0 0)) break_7 (<= i_5 1)) (or (not break_7) (= name_3 (select nondet_0 0)) (= (+ result_4 1) 0))), 3822#(and (or (not break_15) (= name_3 (select nondet_0 0)) (not (= name_1 (select nondet_0 0)))) (or (= name_3 (select nondet_0 0)) (not (= name_1 (select nondet_0 0))) (<= i_13 0))), 3805#(and (or (<= 3 i_5) (<= i_5 0) (<= 2 i_9) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9))) (or (<= 2 i_9) (not break_15) break_11 break_7 (= name_3 (select nondet_0 i_9)) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= 3 i_5) (<= 2 i_9) break_11 break_7 (= name_3 (select nondet_0 i_9)) (<= i_13 0) (not (= name_1 (select nondet_0 i_5))))), 3813#(and (or (not (= name_3 name_1)) (not break_11) (= (+ result_4 1) 0)) (or (< i_9 3) (not (= name_3 name_1)) (= (+ result_4 1) 0))), 3797#(and (or (not break_15) (not (= name_1 (select nondet_0 0)))) (or (not (= name_1 (select nondet_0 0))) (<= i_13 0))), 3787#(and (or (< i_9 3) break_7 (<= i_5 1)) (or (= (- 1) result_4) (not break_7) (< i_9 3)) (or (= (- 1) result_4) (not break_7) (not break_11)) (or break_7 (not break_11) (<= i_5 1))), 3779#(and (or (not break_11) (= (+ result_4 1) 0)) (or (< i_9 3) (= (+ result_4 1) 0))), 3812#(or (not (= name_3 name_1)) (= (+ result_4 1) 0)), 3780#(and (or (not break_15) (not break_11) (= (+ result_4 1) 0)) (or (< i_9 3) (not break_15) (= (+ result_4 1) 0)) (or (< i_9 3) (< i_13 3) (= (+ result_4 1) 0)) (or (< i_13 3) (not break_11) (= (+ result_4 1) 0))), 3818#(and (or (= (- 1) result_4) (not break_7) (= name_3 (select nondet_0 0)) (<= i_13 0)) (or (= name_3 (select nondet_0 0)) break_7 (<= i_5 1)) (or (not break_7) (not break_15) (= name_3 (select nondet_0 0)) (= (+ result_4 1) 0))), 3775#(and (or (<= i_5 0) break_7 (not (< i_5 3))) (or break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)))), 3784#(and (or (<= 3 i_9) (< i_13 3) break_11 (= (+ result_4 1) 0)) (or (<= 3 i_9) (not break_15) break_11 (= (+ result_4 1) 0))), 3803#(or (<= 2 i_9) break_11 (not (= name_1 (select nondet_0 0))) (= name_3 (select nondet_0 i_9))), 3781#(or (not (< i_9 3)) break_11 (= (+ result_4 1) 0)), 3783#(or (= name_3 (select nondet_0 0)) (= (+ result_4 1) 0)), 3795#(not (= name_1 (select nondet_0 0))), 3778#(and (or (not break_15) (= (+ result_4 1) 0)) (or (< i_13 3) (= (+ result_4 1) 0))), 3777#(and (or (<= i_5 0) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3))) (or break_7 (not (= name_3 name_1)) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)))), 3808#(and (or (= name_1 (select nondet_0 i_9)) break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= i_5 0) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3))) (or break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)) (= i_9 0))), 3821#(or (= name_3 (select nondet_0 0)) (not (= name_1 (select nondet_0 0)))), 3811#(or (not (= name_1 (select nondet_0 0))) (= i_9 0)), 3776#(and (or (<= i_5 0) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3))) (or break_7 (<= i_13 0) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (not break_15) break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)))), 3819#(and (or (= name_3 (select nondet_0 0)) break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= i_5 0) (= name_3 (select nondet_0 0)) break_7 (not (< i_5 3)))), 3785#(and (or (<= 2 i_9) (not break_15) break_11 (= name_3 (select nondet_0 i_9)) (= (+ result_4 1) 0)) (or (<= 2 i_9) (< i_13 3) break_11 (= name_3 (select nondet_0 i_9)) (= (+ result_4 1) 0))), 3791#(and (or (= (- 1) result_4) (not break_7) (not break_11) (<= i_13 0)) (or (= (- 1) result_4) (not break_7) (< i_9 3) (<= i_13 0)) (or (= (- 1) result_4) (not break_7) (< i_9 3) (not break_15)) (or (< i_9 3) break_7 (<= i_5 1)) (or (= (- 1) result_4) (not break_7) (not break_15) (not break_11)) (or break_7 (not break_11) (<= i_5 1))), 3806#(and (or (<= 2 i_9) (not break_15) break_11 (not (= name_1 (select nondet_0 0))) (= name_3 (select nondet_0 i_9))) (or break_11 (not (= name_1 (select nondet_0 0))) (= name_3 (select nondet_0 i_9)) (not (< i_9 2)) (<= i_13 0))), 3802#(and (or (<= 2 i_9) break_11 break_7 (= name_3 (select nondet_0 i_9)) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= i_5 0) (<= 2 i_9) break_11 break_7 (= name_3 (select nondet_0 i_9)) (not (< i_5 3)))), 3810#(or break_11 (not (= name_1 (select nondet_0 0))) (not (= name_3 name_1))), 3800#(and (or (not (< i_9 3)) break_11 (not (= name_1 (select nondet_0 0))) (<= i_13 0)) (or (<= 3 i_9) (not break_15) break_11 (not (= name_1 (select nondet_0 0))))), 3816#(or (= name_3 (select nondet_0 0)) (not (= name_3 name_1)) (= (+ result_4 1) 0)), 3807#(and (or (<= i_5 0) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3))) (or break_11 break_7 (not (= name_3 name_1)) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)))), 3796#(and (or (not (= name_1 (select nondet_0 0))) (not break_11)) (or (< i_9 3) (not (= name_1 (select nondet_0 0))))), 3793#(and (or (<= i_5 0) break_7 (= name_1 (select nondet_0 i_5)) (not break_11) (not (< i_5 3))) (or break_7 (not break_11) (<= i_13 0) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (not break_15) break_7 (not break_11) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (< i_9 3) (not break_15) break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (< i_9 3) break_7 (<= i_13 0) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= i_5 0) (< i_9 3) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)))), 3815#(or (<= 2 i_9) break_11 (not (= name_3 name_1)) (= name_3 (select nondet_0 i_9)) (= (+ result_4 1) 0)), 3809#(or (not (= name_1 (select nondet_0 0))) (not (= name_3 name_1))), 3814#(or (<= 3 i_9) break_11 (not (= name_3 name_1)) (= (+ result_4 1) 0)), 3820#(and (or (not break_15) (= name_3 (select nondet_0 0)) break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (= name_3 (select nondet_0 0)) break_7 (<= i_13 0) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= 3 i_5) (<= i_5 0) (= name_3 (select nondet_0 0)) break_7 (= name_1 (select nondet_0 i_5)))), 3789#(and (or (< i_9 3) break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= i_5 0) break_7 (not break_11) (not (< i_5 3))) (or break_7 (not break_11) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= i_5 0) (< i_9 3) break_7 (not (< i_5 3)))), 3790#(and (or (not (< i_9 3)) break_11 break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= i_5 0) (not (< i_9 3)) break_11 break_7 (not (< i_5 3)))), 3792#(and (or (not (< i_9 3)) break_11 break_7 (<= i_5 1)) (or (not (< i_9 3)) (= (- 1) result_4) (not break_7) break_11 (<= i_13 0)) (or (not (< i_9 3)) (not break_7) (not break_15) break_11 (= (+ result_4 1) 0))), 3801#(and (or (<= 2 i_9) break_11 break_7 (= name_3 (select nondet_0 i_9)) (<= i_5 1)) (or (<= 2 i_9) (not break_7) break_11 (= name_3 (select nondet_0 i_9)) (= (+ result_4 1) 0))), 3804#(and (or break_11 break_7 (= name_3 (select nondet_0 i_9)) (not (< i_9 2)) (<= i_5 1)) (or (<= 2 i_9) (not break_7) (not break_15) break_11 (= name_3 (select nondet_0 i_9)) (= (+ result_4 1) 0)) (or (= (- 1) result_4) (not break_7) break_11 (= name_3 (select nondet_0 i_9)) (not (< i_9 2)) (<= i_13 0))), 3782#(or (<= 2 i_9) break_11 (= name_3 (select nondet_0 i_9)) (= (+ result_4 1) 0)), 3788#(and (or (not (< i_9 3)) break_11 break_7 (<= i_5 1)) (or (not (< i_9 3)) (not break_7) break_11 (= (+ result_4 1) 0))), 3798#(and (or (not break_15) (not (= name_1 (select nondet_0 0))) (not break_11)) (or (not (= name_1 (select nondet_0 0))) (not break_11) (<= i_13 0)) (or (< i_9 3) (not (= name_1 (select nondet_0 0))) (<= i_13 0)) (or (< i_9 3) (not break_15) (not (= name_1 (select nondet_0 0)))))] [2022-03-15 21:04:13,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-03-15 21:04:13,855 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:04:13,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-03-15 21:04:13,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=4538, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 21:04:13,857 INFO L87 Difference]: Start difference. First operand 105 states and 302 transitions. Second operand has 58 states, 57 states have (on average 3.0350877192982457) internal successors, (173), 58 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have 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:20,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:04:20,775 INFO L93 Difference]: Finished difference Result 304 states and 844 transitions. [2022-03-15 21:04:20,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-03-15 21:04:20,776 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 3.0350877192982457) internal successors, (173), 58 states have internal predecessors, (173), 0 states have call successors, (0), 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:04:20,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:04:20,777 INFO L225 Difference]: With dead ends: 304 [2022-03-15 21:04:20,777 INFO L226 Difference]: Without dead ends: 292 [2022-03-15 21:04:20,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4782 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=2529, Invalid=19227, Unknown=0, NotChecked=0, Total=21756 [2022-03-15 21:04:20,781 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 538 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 6793 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 6793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:04:20,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [538 Valid, 0 Invalid, 7000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 6793 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 21:04:20,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-03-15 21:04:20,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 169. [2022-03-15 21:04:20,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 2.9464285714285716) internal successors, (495), 168 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have 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:20,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 495 transitions. [2022-03-15 21:04:20,788 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 495 transitions. Word has length 16 [2022-03-15 21:04:20,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:04:20,788 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 495 transitions. [2022-03-15 21:04:20,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 3.0350877192982457) internal successors, (173), 58 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have 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:20,789 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 495 transitions. [2022-03-15 21:04:20,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:04:20,789 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:04:20,789 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:04:20,805 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:04:21,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:04:21,004 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:04:21,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:04:21,004 INFO L85 PathProgramCache]: Analyzing trace with hash -461142593, now seen corresponding path program 4 times [2022-03-15 21:04:21,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:04:21,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886532570] [2022-03-15 21:04:21,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:04:21,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:04:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:04:21,256 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:04:21,257 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:04:21,257 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886532570] [2022-03-15 21:04:21,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886532570] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:04:21,257 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694621843] [2022-03-15 21:04:21,257 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:04:21,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:04:21,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:04:21,258 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:04:21,259 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:04:21,295 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:04:21,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:04:21,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 21:04:21,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:04:21,580 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 168 treesize of output 132 [2022-03-15 21:04:21,903 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:04:21,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:04:22,451 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:04:22,451 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 159 treesize of output 135 [2022-03-15 21:04:22,577 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:04:22,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694621843] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:04:22,577 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:04:22,577 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 21:04:22,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1046190762] [2022-03-15 21:04:22,577 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:04:22,578 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:04:22,589 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 289 transitions. [2022-03-15 21:04:22,589 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:04:49,188 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 62 new interpolants: [4774#(and (or (<= 2 i_9) (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (= (+ result_4 1) 0)) (or (<= 2 i_9) (< i_9 1) break_11 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (= name_3 (select nondet_0 (+ i_9 1))) (= (+ result_4 1) 0) (= (+ name_2 1) name_3))), 4775#(and (or (= (- 1) result_4) (not break_7) (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) break_11) (or (<= i_5 2) break_7 (not break_11)) (or (<= i_5 2) (< i_9 3) break_7) (or (= (+ result_8 1) 0) (= (- 1) result_4) (not break_7) (not break_11))), 4825#(and (or (< 0 i_9) (= name_2 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (= name_1 (select nondet_0 0)) (= name_2 name_1)) (or (< 0 i_9) (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= (select nondet_0 1) name_1))) (or (<= i_9 1) (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (= name_2 name_1))), 4802#(and (or (not (< i_9 3)) (not break_15) break_11 (not (= name_2 (select nondet_0 i_9))) (= (+ result_4 1) 0)) (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) (< i_13 3) break_11 (= name_3 (select nondet_0 i_9)) (= (+ result_4 1) 0) (< i_9 2)) (or (not (< i_9 3)) (< i_13 3) break_11 (not (= name_2 (select nondet_0 i_9))) (= (+ result_4 1) 0)) (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) (not break_15) break_11 (= name_3 (select nondet_0 i_9)) (= (+ result_4 1) 0) (< i_9 2))), 4804#(and (or (not (< i_9 3)) break_11 break_7 (<= i_13 0) (not (= name_2 (select nondet_0 i_9))) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (not (< i_9 3)) (not break_15) break_11 break_7 (not (= name_2 (select nondet_0 i_9))) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (not (< i_9 3)) (= name_2 (select nondet_0 i_5)) break_11 break_7 (= name_1 (select nondet_0 i_5)) (<= i_13 0) (not (< i_5 3)) (< i_9 2) (<= i_5 1)) (or (not (< i_9 3)) (= name_2 (select nondet_0 i_5)) break_11 break_7 (= name_1 (select nondet_0 i_5)) (<= i_13 0) (not (< i_5 3)) (not (= name_3 (select nondet_0 i_9))) (<= i_5 1)) (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) break_11 break_7 (= name_3 (select nondet_0 i_9)) (<= i_13 0) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)) (< i_9 2)) (or (not (< i_9 3)) (= name_2 (select nondet_0 i_5)) (not break_15) break_11 break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)) (< i_9 2) (<= i_5 1)) (or (not (< i_9 3)) (= name_2 (select nondet_0 i_5)) (not break_15) break_11 break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)) (not (= name_3 (select nondet_0 i_9))) (<= i_5 1)) (or (not (< i_9 3)) (= name_2 (select nondet_0 i_5)) break_11 break_7 (<= i_13 0) (not (= name_2 (select nondet_0 i_9))) (not (< i_5 3)) (<= i_5 1)) (or (not (< i_9 3)) (= name_2 (select nondet_0 i_5)) (not break_15) break_11 break_7 (not (= name_2 (select nondet_0 i_9))) (not (< i_5 3)) (<= i_5 1)) (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) (not break_15) break_11 break_7 (= name_3 (select nondet_0 i_9)) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)) (< i_9 2))), 4801#(and (or (= (+ result_8 1) 0) (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (not break_11) (<= i_13 0) (= name_2 name_1) (not (= (select nondet_0 1) name_1))) (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) (= name_2 (select nondet_0 0)) break_11 (= name_1 (select nondet_0 0)) (<= i_13 0) (= name_2 name_1) (not (= (select nondet_0 1) name_1))) (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) (not break_15) (= name_2 (select nondet_0 0)) break_11 (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= (select nondet_0 1) name_1))) (or (= (+ result_8 1) 0) (not break_15) (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (not break_11) (= name_2 name_1) (not (= (select nondet_0 1) name_1)))), 4778#(and (or (= name_2 (select nondet_0 i_5)) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)) (<= i_5 1)) (or (= (+ result_8 1) 0) break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)))), 4830#(and (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) break_11 (not (= name_3 name_1)) (= (+ result_4 1) 0)) (or (= (+ result_8 1) 0) (not (= name_3 name_1)) (not break_11) (= (+ result_4 1) 0))), 4791#(and (or (<= 2 i_9) (= name_2 (select nondet_0 i_5)) (not (= name_2 (select nondet_0 (+ i_9 1)))) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (<= 2 i_5)) (or (<= i_5 0) (<= 2 i_9) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (= name_1 (select nondet_0 (+ i_5 1))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (not (= name_3 (select nondet_0 (+ i_9 1)))) (<= 2 i_5)) (or (<= i_5 0) (<= 2 i_9) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (< i_9 1) (= name_1 (select nondet_0 (+ i_5 1))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (<= 2 i_5)) (or (<= 2 i_9) (= name_2 (select nondet_0 i_5)) (< i_9 1) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (= name_3 (select nondet_0 (+ i_9 1))) (<= 2 i_5) (= (+ name_2 1) name_3)) (or (<= i_5 0) (<= 2 i_9) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (<= 2 i_5))), 4812#(and (or (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (not (= name_1 (select nondet_0 (+ i_5 1)))) (not (= (select nondet_0 1) name_2)) break_7 (= name_1 (select nondet_0 i_5))) (or (<= i_5 0) (not (= (select nondet_0 1) name_3)) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (= name_1 (select nondet_0 (+ i_5 1))) break_7 (= name_1 (select nondet_0 i_5)))), 4829#(or (= (+ result_8 1) 0) (not (= name_3 name_1)) (= (+ result_4 1) 0)), 4780#(and (or (not (< i_9 3)) (= name_2 (select nondet_0 i_5)) break_11 break_7 (not (= name_2 (select nondet_0 i_9))) (not (< i_5 3)) (<= i_5 1)) (or (not (< i_9 3)) (= name_2 (select nondet_0 i_5)) break_11 break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)) (< i_9 2) (<= i_5 1)) (or (not (< i_9 3)) (= name_2 (select nondet_0 i_5)) break_11 break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)) (not (= name_3 (select nondet_0 i_9))) (<= i_5 1)) (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) break_11 break_7 (= name_3 (select nondet_0 i_9)) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)) (< i_9 2)) (or (not (< i_9 3)) break_11 break_7 (not (= name_2 (select nondet_0 i_9))) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)))), 4800#(and (or (= (+ result_8 1) 0) (not break_15) (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= (select nondet_0 1) name_1))) (or (= (+ result_8 1) 0) (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (<= i_13 0) (= name_2 name_1) (not (= (select nondet_0 1) name_1)))), 4813#(and (or (not break_15) (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (= (+ result_4 1) 0)) (or (< i_13 3) (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (= (+ result_4 1) 0))), 4817#(and (or (= name_2 (select nondet_0 i_5)) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)) (<= i_5 1)) (or (= (+ result_8 1) 0) break_7 (not (= name_3 name_1)) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)))), 4797#(and (or (= name_2 (select nondet_0 i_5)) (not break_15) break_7 (= name_1 (select nondet_0 i_5)) (not break_11) (not (< i_5 3)) (<= i_5 1)) (or (= (+ result_8 1) 0) (not break_15) break_7 (not break_11) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (= (+ result_8 1) 0) break_7 (not break_11) (<= i_13 0) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) (not break_15) break_11 break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) break_11 break_7 (<= i_13 0) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (= name_2 (select nondet_0 i_5)) (< i_9 3) (not break_15) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)) (<= i_5 1)) (or (= name_2 (select nondet_0 i_5)) (< i_9 3) break_7 (= name_1 (select nondet_0 i_5)) (<= i_13 0) (not (< i_5 3)) (<= i_5 1)) (or (= name_2 (select nondet_0 i_5)) break_7 (= name_1 (select nondet_0 i_5)) (not break_11) (<= i_13 0) (not (< i_5 3)) (<= i_5 1))), 4820#(and (or (<= i_9 2) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) break_11 break_7 (= name_1 (select nondet_0 i_5))) (or (<= i_5 0) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (= name_1 (select nondet_0 (+ i_5 1))) break_7 (= name_1 (select nondet_0 i_5)) (not break_11)) (or (= (+ result_8 1) 0) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_7 (= name_1 (select nondet_0 i_5)) (not (= name_3 name_1)) (not break_11))), 4782#(or (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (= (+ result_4 1) 0)), 4779#(and (or (= name_2 (select nondet_0 i_5)) break_7 (= name_1 (select nondet_0 i_5)) (not break_11) (not (< i_5 3)) (<= i_5 1)) (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) break_11 break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (= (+ result_8 1) 0) break_7 (not break_11) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (= name_2 (select nondet_0 i_5)) (< i_9 3) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)) (<= i_5 1))), 4773#(and (or (not (< i_9 3)) break_11 (not (= name_2 (select nondet_0 i_9))) (= (+ result_4 1) 0)) (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) break_11 (= name_3 (select nondet_0 i_9)) (= (+ result_4 1) 0) (< i_9 2))), 4776#(and (or (<= i_5 2) (not (< i_9 3)) break_11 break_7 (not (= name_2 (select nondet_0 i_9)))) (or (not (< i_9 3)) (= (- 1) result_4) (not break_7) (= (+ (* (- 1) name_3) name_2 1) 0) break_11 (= name_3 (select nondet_0 i_9)) (< i_9 2)) (or (not (< i_9 3)) (= (- 1) result_4) (not break_7) break_11 (not (= name_2 (select nondet_0 i_9)))) (or (<= i_5 2) (not (< i_9 3)) break_11 break_7 (< i_9 2)) (or (<= i_5 2) (not (< i_9 3)) break_11 break_7 (not (= name_3 (select nondet_0 i_9))))), 4777#(and (or (<= i_5 2) (<= 2 i_9) (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 break_7 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9))) (or (<= i_5 2) (<= 2 i_9) break_11 break_7 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (not (= name_3 (select nondet_0 (+ i_9 1))))) (or (<= i_5 2) (<= 2 i_9) (< i_9 1) break_11 break_7 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9))) (or (<= 2 i_9) (not break_7) (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (= (+ result_4 1) 0)) (or (<= 2 i_9) (not break_7) (< i_9 1) break_11 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (= name_3 (select nondet_0 (+ i_9 1))) (= (+ result_4 1) 0) (= (+ name_2 1) name_3))), 4794#(and (or (= (+ result_8 1) 0) (not break_15) (= (+ result_4 1) 0)) (or (= (+ result_8 1) 0) (< i_13 3) (= (+ result_4 1) 0))), 4809#(and (or (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 break_7 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (not (< i_9 2)) (<= i_13 0) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (= name_2 (select nondet_0 i_5)) (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 break_7 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (not (< i_9 2)) (<= i_13 0) (not (< i_5 3)) (<= i_5 1)) (or (<= 2 i_9) (= name_2 (select nondet_0 i_5)) (not break_15) (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 break_7 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (not (< i_5 3)) (<= i_5 1)) (or (= name_2 (select nondet_0 i_5)) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (not (< i_9 2)) (<= i_13 0) (not (= name_3 (select nondet_0 (+ i_9 1)))) (not (< i_5 3)) (<= i_5 1)) (or (<= 2 i_9) (= name_2 (select nondet_0 i_5)) (< i_9 1) (not break_15) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (not (< i_5 3)) (<= i_5 1)) (or (= name_2 (select nondet_0 i_5)) (< i_9 1) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (not (< i_9 2)) (<= i_13 0) (not (< i_5 3)) (<= i_5 1)) (or (<= 2 i_9) (= name_2 (select nondet_0 i_5)) (not break_15) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (not (= name_3 (select nondet_0 (+ i_9 1)))) (not (< i_5 3)) (<= i_5 1)) (or (<= 2 i_9) (not break_15) (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 break_7 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 1) break_11 break_7 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (not (< i_9 2)) (<= i_13 0) (= name_3 (select nondet_0 (+ i_9 1))) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= 2 i_9) (< i_9 1) (not break_15) break_11 break_7 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (= name_3 (select nondet_0 (+ i_9 1))) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)) (= (+ name_2 1) name_3))), 4827#(and (or (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (= name_1 (select nondet_0 (+ i_9 1))) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (not (= name_3 name_1))) (or (not (< i_5 2)) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (not (= name_3 name_1)) (not (= name_3 name_2))) (or (= name_2 (select nondet_0 i_5)) break_7 (= name_1 (select nondet_0 i_5)) (= i_9 0) (<= 2 i_5)) (or (<= i_5 0) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (= name_1 (select nondet_0 (+ i_5 1))) break_11 break_7 (= name_1 (select nondet_0 i_5)))), 4810#(and (or (<= 2 i_9) (= name_2 (select nondet_0 i_5)) (< i_9 1) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (<= i_13 0) (= name_3 (select nondet_0 (+ i_9 1))) (<= 2 i_5) (= (+ name_2 1) name_3)) (or (<= 2 i_9) (= name_2 (select nondet_0 i_5)) (not (= name_2 (select nondet_0 (+ i_9 1)))) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (<= i_13 0) (<= 2 i_5)) (or (<= i_5 0) (<= 2 i_9) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not break_15) (= name_1 (select nondet_0 (+ i_5 1))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (not (= name_3 (select nondet_0 (+ i_9 1)))) (<= 2 i_5)) (or (<= i_5 0) (<= 2 i_9) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (< i_9 1) (not break_15) (= name_1 (select nondet_0 (+ i_5 1))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (<= 2 i_5)) (or (<= 2 i_9) (= name_2 (select nondet_0 i_5)) (not break_15) (not (= name_2 (select nondet_0 (+ i_9 1)))) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (<= 2 i_5)) (or (<= i_5 0) (<= 2 i_9) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not break_15) (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (<= 2 i_5)) (or (<= i_5 0) (<= 2 i_9) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (<= i_13 0) (<= 2 i_5)) (or (<= i_5 0) (<= 2 i_9) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (= name_1 (select nondet_0 (+ i_5 1))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (<= i_13 0) (not (= name_3 (select nondet_0 (+ i_9 1)))) (<= 2 i_5)) (or (<= i_5 0) (<= 2 i_9) (= name_2 (select nondet_0 (+ i_5 1))) (< i_9 1) (= name_1 (select nondet_0 (+ i_5 1))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (<= i_13 0) (<= 2 i_5)) (or (<= 2 i_9) (= name_2 (select nondet_0 i_5)) (< i_9 1) (not break_15) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (= name_3 (select nondet_0 (+ i_9 1))) (<= 2 i_5) (= (+ name_2 1) name_3))), 4816#(and (or (<= i_5 0) (not (= (select nondet_0 1) name_3)) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not break_15) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (= name_1 (select nondet_0 (+ i_5 1))) break_7 (= name_1 (select nondet_0 i_5))) (or (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (not (= name_1 (select nondet_0 (+ i_5 1)))) (not (= (select nondet_0 1) name_2)) break_7 (= name_1 (select nondet_0 i_5)) (<= i_13 0)) (or (<= i_5 0) (not (= (select nondet_0 1) name_3)) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (= name_1 (select nondet_0 (+ i_5 1))) break_7 (= name_1 (select nondet_0 i_5)) (<= i_13 0)) (or (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not break_15) (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (not (= name_1 (select nondet_0 (+ i_5 1)))) (not (= (select nondet_0 1) name_2)) break_7 (= name_1 (select nondet_0 i_5)))), 4824#(and (or (<= i_9 2) (= name_2 (select nondet_0 0)) break_11 (= name_1 (select nondet_0 0)) (= name_2 name_1)) (or (= (+ result_8 1) 0) (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (not (= name_3 name_1)) (not break_11) (= name_2 name_1) (not (= (select nondet_0 1) name_1)))), 4832#(and (or (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 (not (= name_3 name_1)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (not (< i_9 2)) (= (+ result_4 1) 0)) (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 1) break_11 (not (= name_3 name_1)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (not (< i_9 2)) (= name_3 (select nondet_0 (+ i_9 1))) (= (+ result_4 1) 0))), 4808#(and (or (<= 2 i_9) (not break_7) (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (<= i_13 0) (= (+ result_4 1) 0)) (or (<= i_5 2) (<= 2 i_9) break_11 break_7 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (<= i_13 0) (not (= name_3 (select nondet_0 (+ i_9 1))))) (or (<= 2 i_9) (not break_7) (not break_15) (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (= (+ result_4 1) 0)) (or (<= i_5 2) (<= 2 i_9) (< i_9 1) break_11 break_7 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (<= i_13 0)) (or (<= i_5 2) (<= 2 i_9) (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 break_7 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (<= i_13 0)) (or (<= i_5 2) (<= 2 i_9) (not break_15) (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 break_7 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9))) (or (<= i_5 2) (<= 2 i_9) (not break_15) break_11 break_7 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (not (= name_3 (select nondet_0 (+ i_9 1))))) (or (<= 2 i_9) (not break_7) (< i_9 1) (not break_15) break_11 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (= name_3 (select nondet_0 (+ i_9 1))) (= (+ result_4 1) 0) (= (+ name_2 1) name_3)) (or (<= i_5 2) (<= 2 i_9) (< i_9 1) (not break_15) break_11 break_7 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9))) (or (<= 2 i_9) (not break_7) (< i_9 1) break_11 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (<= i_13 0) (= name_3 (select nondet_0 (+ i_9 1))) (= (+ result_4 1) 0) (= (+ name_2 1) name_3))), 4805#(and (or (<= i_5 0) (not (< i_9 3)) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) break_11 break_7 (= name_1 (select nondet_0 i_5)) (<= i_13 0) (not (= name_2 (select nondet_0 i_9)))) (or (<= i_5 0) (not (< i_9 3)) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not break_15) break_11 break_7 (= name_1 (select nondet_0 i_5)) (not (= name_2 (select nondet_0 i_9)))) (or (not (< i_9 3)) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not break_15) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (not (= name_2 (select nondet_0 i_9)))) (or (<= i_5 0) (not (< i_9 3)) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not break_15) (= name_1 (select nondet_0 (+ i_5 1))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (< i_9 2)) (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (<= i_13 0) (< i_9 2)) (or (<= i_5 0) (not (< i_9 3)) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not break_15) (= name_1 (select nondet_0 (+ i_5 1))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (not (= name_3 (select nondet_0 i_9)))) (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not break_15) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (< i_9 2)) (or (<= i_5 0) (not (< i_9 3)) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (= name_1 (select nondet_0 (+ i_5 1))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (<= i_13 0) (not (= name_3 (select nondet_0 i_9)))) (or (<= i_5 0) (not (< i_9 3)) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (= name_1 (select nondet_0 (+ i_5 1))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (<= i_13 0) (< i_9 2)) (or (not (< i_9 3)) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (<= i_13 0) (not (= name_2 (select nondet_0 i_9))))), 4795#(and (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) (< i_13 3) break_11 (= (+ result_4 1) 0)) (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) (not break_15) break_11 (= (+ result_4 1) 0)) (or (= (+ result_8 1) 0) (< i_13 3) (not break_11) (= (+ result_4 1) 0)) (or (= (+ result_8 1) 0) (not break_15) (not break_11) (= (+ result_4 1) 0))), 4833#(or (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (not (= name_3 name_1)) (= (+ result_4 1) 0)), 4786#(and (or (= (+ (* (- 1) name_3) name_2 1) 0) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (< i_9 3) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_11 break_7 (= name_1 (select nondet_0 i_5))) (or (<= i_5 0) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (= name_1 (select nondet_0 (+ i_5 1))) break_7 (= name_1 (select nondet_0 i_5)) (not break_11)) (or (= (+ result_8 1) 0) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_7 (= name_1 (select nondet_0 i_5)) (not break_11)) (or (<= i_5 0) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (< i_9 3) (= name_1 (select nondet_0 (+ i_5 1))) break_7 (= name_1 (select nondet_0 i_5)))), 4789#(and (or (= (+ result_8 1) 0) (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (not break_11) (= name_2 name_1) (not (= (select nondet_0 1) name_1))) (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) (= name_2 (select nondet_0 0)) break_11 (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= (select nondet_0 1) name_1)))), 4815#(and (or (= name_2 (select nondet_0 i_5)) (not break_15) (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) break_7 (not (< i_5 3)) (<= i_5 1)) (or (not (= (select nondet_0 1) name_3)) (= name_2 (select nondet_0 i_5)) (not break_15) (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)) (<= i_5 1)) (or (not (= (select nondet_0 1) name_3)) (= name_2 (select nondet_0 i_5)) (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) break_7 (= name_1 (select nondet_0 i_5)) (<= i_13 0) (not (< i_5 3)) (<= i_5 1)) (or (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) break_7 (<= i_13 0) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (= name_2 (select nondet_0 i_5)) (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) break_7 (<= i_13 0) (not (< i_5 3)) (<= i_5 1)) (or (not break_15) (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)))), 4828#(or (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (= name_2 name_1) (= i_9 0)), 4783#(and (or (not break_7) (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (= (+ result_4 1) 0)) (or (<= i_5 2) (not (= (select nondet_0 1) name_3)) (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) break_7) (or (<= i_5 2) (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) break_7)), 4823#(or (= (+ result_8 1) 0) (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (not (= name_3 name_1)) (= name_2 name_1) (not (= (select nondet_0 1) name_1))), 4790#(and (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) (= name_2 (select nondet_0 0)) break_11 (= name_1 (select nondet_0 0)) (= name_3 (select nondet_0 i_9)) (= name_2 name_1) (not (= (select nondet_0 1) name_1)) (< i_9 2)) (or (not (< i_9 3)) (= name_2 (select nondet_0 0)) break_11 (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= name_2 (select nondet_0 i_9))) (not (= (select nondet_0 1) name_1)))), 4796#(and (or (= (- 1) result_4) (not break_7) (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) break_11 (<= i_13 0)) (or (= (+ result_8 1) 0) (= (- 1) result_4) (not break_7) (not break_15) (not break_11)) (or (<= i_5 2) (not break_15) break_7 (not break_11)) (or (= (- 1) result_4) (not break_7) (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) (not break_15) break_11) (or (<= i_5 2) (< i_9 3) (not break_15) break_7) (or (<= i_5 2) (< i_9 3) break_7 (<= i_13 0)) (or (<= i_5 2) break_7 (not break_11) (<= i_13 0)) (or (= (+ result_8 1) 0) (= (- 1) result_4) (not break_7) (not break_11) (<= i_13 0))), 4821#(and (or (= name_2 (select nondet_0 i_5)) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)) (<= i_5 1)) (or (= name_1 (select nondet_0 i_9)) break_7 (not (= name_3 name_1)) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or break_7 (not (= name_3 name_1)) (not (= name_3 name_2)) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (< 0 i_9) break_7 (not (< i_5 3)) (not (= name_2 (select nondet_0 i_5)))) (or (<= 3 i_5) (<= i_9 1) break_7) (or (< 0 i_9) break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)))), 4811#(and (or (<= 2 i_9) (< i_9 1) (not break_15) (= name_2 (select nondet_0 0)) break_11 (= name_1 (select nondet_0 0)) (= name_3 (select nondet_0 i_9)) (= name_2 name_1) (= name_3 (select nondet_0 (+ i_9 1))) (= (+ name_2 1) name_3) (not (= (select nondet_0 1) name_1))) (or (<= 2 i_9) (< i_9 1) (= name_2 (select nondet_0 0)) break_11 (= name_1 (select nondet_0 0)) (= name_3 (select nondet_0 i_9)) (<= i_13 0) (= name_2 name_1) (= name_3 (select nondet_0 (+ i_9 1))) (= (+ name_2 1) name_3) (not (= (select nondet_0 1) name_1))) (or (<= 2 i_9) (= name_2 (select nondet_0 0)) (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 (= name_1 (select nondet_0 0)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (<= i_13 0) (= name_2 name_1) (not (= (select nondet_0 1) name_1))) (or (<= 2 i_9) (not break_15) (= name_2 (select nondet_0 0)) (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 (= name_1 (select nondet_0 0)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (= name_2 name_1) (not (= (select nondet_0 1) name_1)))), 4807#(and (or (<= 2 i_9) (< i_9 1) (not break_15) break_11 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (= name_3 (select nondet_0 (+ i_9 1))) (= (+ result_4 1) 0) (= (+ name_2 1) name_3)) (or (<= 2 i_9) (< i_9 1) (< i_13 3) break_11 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (= name_3 (select nondet_0 (+ i_9 1))) (= (+ result_4 1) 0) (= (+ name_2 1) name_3)) (or (<= 2 i_9) (< i_13 3) (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (= (+ result_4 1) 0)) (or (<= 2 i_9) (not break_15) (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (= (+ result_4 1) 0))), 4784#(and (or (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (not (= (select nondet_0 1) name_3)) (= name_2 (select nondet_0 i_5)) (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)) (<= i_5 1)) (or (= name_2 (select nondet_0 i_5)) (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) break_7 (not (< i_5 3)) (<= i_5 1))), 4792#(and (or (<= 2 i_9) (< i_9 1) (= name_2 (select nondet_0 0)) break_11 (= name_1 (select nondet_0 0)) (= name_3 (select nondet_0 i_9)) (= name_2 name_1) (= name_3 (select nondet_0 (+ i_9 1))) (= (+ name_2 1) name_3) (not (= (select nondet_0 1) name_1))) (or (<= 2 i_9) (= name_2 (select nondet_0 0)) (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 (= name_1 (select nondet_0 0)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (= name_2 name_1) (not (= (select nondet_0 1) name_1)))), 4772#(and (or (= (+ result_8 1) 0) (not break_11) (= (+ result_4 1) 0)) (or (= (+ (* (- 1) name_3) name_2 1) 0) (< i_9 3) break_11 (= (+ result_4 1) 0))), 4781#(and (or (<= 2 i_9) (= name_2 (select nondet_0 i_5)) (< i_9 1) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (not (< i_5 3)) (<= i_5 1)) (or (<= 2 i_9) (= name_2 (select nondet_0 i_5)) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (not (= name_3 (select nondet_0 (+ i_9 1)))) (not (< i_5 3)) (<= i_5 1)) (or (<= 2 i_9) (= name_2 (select nondet_0 i_5)) (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 break_7 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (not (< i_5 3)) (<= i_5 1)) (or (<= 2 i_9) (< i_9 1) break_11 break_7 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (= name_3 (select nondet_0 (+ i_9 1))) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)) (= (+ name_2 1) name_3)) (or (<= 2 i_9) (not (= name_2 (select nondet_0 (+ i_9 1)))) break_11 break_7 (= name_3 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_9)) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)))), 4787#(and (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (= name_3 (select nondet_0 i_9)) (< i_9 2)) (or (not (< i_9 3)) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (not (= name_2 (select nondet_0 i_9)))) (or (<= i_5 0) (not (< i_9 3)) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (= name_1 (select nondet_0 (+ i_5 1))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (< i_9 2)) (or (<= i_5 0) (not (< i_9 3)) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (= name_1 (select nondet_0 (+ i_5 1))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (not (= name_3 (select nondet_0 i_9)))) (or (<= i_5 0) (not (< i_9 3)) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) break_11 break_7 (= name_1 (select nondet_0 i_5)) (not (= name_2 (select nondet_0 i_9))))), 4831#(and (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) break_11 (not (= name_3 name_1)) (= name_3 (select nondet_0 i_9)) (= (+ result_4 1) 0) (< i_9 2)) (or (not (< i_9 3)) break_11 (not (= name_3 name_1)) (not (= name_2 (select nondet_0 i_9))) (= (+ result_4 1) 0))), 4818#(and (or (= (- 1) result_8) break_7 (not (= name_3 name_1)) (not break_11) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (<= i_9 2) break_11 break_7 (not (< i_5 3))) (or (= name_2 (select nondet_0 i_5)) break_7 (= name_1 (select nondet_0 i_5)) (not break_11) (not (< i_5 3)) (<= i_5 1))), 4826#(and (or break_11 break_7 (= (select nondet_0 1) name_1) (not (= name_3 name_1)) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (= name_2 (select nondet_0 i_5)) break_11 break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)) (<= i_5 1)) (or break_7 (not (< i_5 3)) (= i_9 0)) (or break_11 break_7 (not (= name_3 name_1)) (not (= name_3 name_2)) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3)))), 4803#(and (or (<= i_5 2) (not (< i_9 3)) (not break_15) break_11 break_7 (< i_9 2)) (or (not (< i_9 3)) (= (- 1) result_4) (not break_7) (not break_15) break_11 (not (= name_2 (select nondet_0 i_9)))) (or (not (< i_9 3)) (= (- 1) result_4) (not break_7) break_11 (<= i_13 0) (not (= name_2 (select nondet_0 i_9)))) (or (<= i_5 2) (not (< i_9 3)) break_11 break_7 (<= i_13 0) (not (= name_2 (select nondet_0 i_9)))) (or (<= i_5 2) (not (< i_9 3)) (not break_15) break_11 break_7 (not (= name_2 (select nondet_0 i_9)))) (or (not (< i_9 3)) (= (- 1) result_4) (not break_7) (= (+ (* (- 1) name_3) name_2 1) 0) (not break_15) break_11 (= name_3 (select nondet_0 i_9)) (< i_9 2)) (or (<= i_5 2) (not (< i_9 3)) (not break_15) break_11 break_7 (not (= name_3 (select nondet_0 i_9)))) (or (not (< i_9 3)) (= (- 1) result_4) (not break_7) (= (+ (* (- 1) name_3) name_2 1) 0) break_11 (= name_3 (select nondet_0 i_9)) (<= i_13 0) (< i_9 2)) (or (<= i_5 2) (not (< i_9 3)) break_11 break_7 (<= i_13 0) (not (= name_3 (select nondet_0 i_9)))) (or (<= i_5 2) (not (< i_9 3)) break_11 break_7 (<= i_13 0) (< i_9 2))), 4814#(and (or (not break_7) (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (<= i_13 0) (= (+ result_4 1) 0)) (or (<= i_5 2) (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) break_7 (<= i_13 0)) (or (not break_7) (not break_15) (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) (= (+ result_4 1) 0)) (or (<= i_5 2) (not (= (select nondet_0 1) name_3)) (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) break_7 (<= i_13 0)) (or (<= i_5 2) (not (= (select nondet_0 1) name_3)) (not break_15) (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) break_7) (or (<= i_5 2) (not break_15) (= name_3 name_2) (= name_2 (select nondet_0 0)) (= name_3 (select nondet_0 0)) (not (= (select nondet_0 1) name_2)) break_7)), 4785#(and (or (= (+ result_8 1) 0) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_7 (= name_1 (select nondet_0 i_5))) (or (<= i_5 0) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (= name_1 (select nondet_0 (+ i_5 1))) break_7 (= name_1 (select nondet_0 i_5)))), 4822#(and (or (= name_2 (select nondet_0 i_5)) (< 0 i_9) (not (< i_5 2)) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_7 (= name_1 (select nondet_0 i_5))) (or (= name_2 (select nondet_0 i_5)) (< 0 i_9) (not (< i_5 2)) break_7 (= name_1 (select nondet_0 i_5)) (not (= name_2 (select nondet_0 (+ i_5 1))))) (or (not (< i_5 2)) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_7 (= name_1 (select nondet_0 i_5)) (not (= name_3 name_1)) (not (= name_3 name_2))) (or (<= i_9 1) (= name_2 (select nondet_0 i_5)) break_7 (= name_1 (select nondet_0 i_5)) (<= 2 i_5)) (or (<= i_5 0) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (= name_1 (select nondet_0 (+ i_5 1))) break_7 (= name_1 (select nondet_0 i_5))) (or (= name_1 (select nondet_0 i_9)) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_7 (= name_1 (select nondet_0 i_5)) (not (= name_3 name_1)))), 4793#(and (or (= name_2 (select nondet_0 i_5)) (not break_15) break_7 (= name_1 (select nondet_0 i_5)) (not (< i_5 3)) (<= i_5 1)) (or (= (+ result_8 1) 0) (not break_15) break_7 (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (= (+ result_8 1) 0) break_7 (<= i_13 0) (not (= name_1 (select nondet_0 i_5))) (not (< i_5 3))) (or (= name_2 (select nondet_0 i_5)) break_7 (= name_1 (select nondet_0 i_5)) (<= i_13 0) (not (< i_5 3)) (<= i_5 1))), 4788#(or (= (+ result_8 1) 0) (= name_2 (select nondet_0 0)) (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= (select nondet_0 1) name_1))), 4798#(and (or (<= i_5 0) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (= name_1 (select nondet_0 (+ i_5 1))) break_7 (= name_1 (select nondet_0 i_5)) (<= i_13 0)) (or (= (+ result_8 1) 0) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not break_15) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_7 (= name_1 (select nondet_0 i_5))) (or (= (+ result_8 1) 0) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_7 (= name_1 (select nondet_0 i_5)) (<= i_13 0)) (or (<= i_5 0) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not break_15) (= name_1 (select nondet_0 (+ i_5 1))) break_7 (= name_1 (select nondet_0 i_5)))), 4806#(and (or (not (< i_9 3)) (= name_2 (select nondet_0 0)) break_11 (= name_1 (select nondet_0 0)) (<= i_13 0) (= name_2 name_1) (not (= name_2 (select nondet_0 i_9))) (not (= (select nondet_0 1) name_1))) (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) (not break_15) (= name_2 (select nondet_0 0)) break_11 (= name_1 (select nondet_0 0)) (= name_3 (select nondet_0 i_9)) (= name_2 name_1) (not (= (select nondet_0 1) name_1)) (< i_9 2)) (or (not (< i_9 3)) (not break_15) (= name_2 (select nondet_0 0)) break_11 (= name_1 (select nondet_0 0)) (= name_2 name_1) (not (= name_2 (select nondet_0 i_9))) (not (= (select nondet_0 1) name_1))) (or (not (< i_9 3)) (= (+ (* (- 1) name_3) name_2 1) 0) (= name_2 (select nondet_0 0)) break_11 (= name_1 (select nondet_0 0)) (= name_3 (select nondet_0 i_9)) (<= i_13 0) (= name_2 name_1) (not (= (select nondet_0 1) name_1)) (< i_9 2))), 4819#(and (or (<= i_5 0) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (= name_1 (select nondet_0 (+ i_5 1))) break_7 (= name_1 (select nondet_0 i_5))) (or (= (+ result_8 1) 0) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_7 (= name_1 (select nondet_0 i_5)) (not (= name_3 name_1)))), 4799#(and (or (<= i_5 0) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (= name_1 (select nondet_0 (+ i_5 1))) break_7 (= name_1 (select nondet_0 i_5)) (not break_11) (<= i_13 0)) (or (<= i_5 0) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (< i_9 3) (not break_15) (= name_1 (select nondet_0 (+ i_5 1))) break_7 (= name_1 (select nondet_0 i_5))) (or (= (+ (* (- 1) name_3) name_2 1) 0) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (< i_9 3) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_11 break_7 (= name_1 (select nondet_0 i_5)) (<= i_13 0)) (or (<= i_5 0) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (< i_9 3) (= name_1 (select nondet_0 (+ i_5 1))) break_7 (= name_1 (select nondet_0 i_5)) (<= i_13 0)) (or (= (+ result_8 1) 0) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_7 (= name_1 (select nondet_0 i_5)) (not break_11) (<= i_13 0)) (or (= (+ result_8 1) 0) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not break_15) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_7 (= name_1 (select nondet_0 i_5)) (not break_11)) (or (= (+ (* (- 1) name_3) name_2 1) 0) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (< i_9 3) (not break_15) (not (= name_1 (select nondet_0 (+ i_5 1)))) break_11 break_7 (= name_1 (select nondet_0 i_5))) (or (<= i_5 0) (= name_2 (select nondet_0 (+ i_5 1))) (= name_2 (select nondet_0 i_5)) (not (< i_5 2)) (not break_15) (= name_1 (select nondet_0 (+ i_5 1))) break_7 (= name_1 (select nondet_0 i_5)) (not break_11)))] [2022-03-15 21:04:49,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-03-15 21:04:49,189 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:04:49,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-03-15 21:04:49,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=8286, Unknown=0, NotChecked=0, Total=8556 [2022-03-15 21:04:49,190 INFO L87 Difference]: Start difference. First operand 169 states and 495 transitions. Second operand has 74 states, 73 states have (on average 3.0273972602739727) internal successors, (221), 74 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 21:15:24,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1200 states. [2022-03-15 21:15:24,447 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 21:15:24,447 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 21:15:24,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1953 GetRequests, 664 SyntacticMatches, 4 SemanticMatches, 1284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733424 ImplicationChecksByTransitivity, 613.3s TimeCoverageRelationStatistics Valid=101705, Invalid=1550805, Unknown=0, NotChecked=0, Total=1652510 [2022-03-15 21:15:24,523 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 4828 mSDsluCounter, 4107 mSDsCounter, 0 mSdLazyCounter, 40776 mSolverCounterSat, 3450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4828 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 44226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3450 IncrementalHoareTripleChecker+Valid, 40776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:15:24,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4828 Valid, 0 Invalid, 44226 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3450 Valid, 40776 Invalid, 0 Unknown, 0 Unchecked, 22.8s Time] [2022-03-15 21:15:24,524 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 21:15:24,540 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:15:24,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:15:24,727 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (169states) and FLOYD_HOARE automaton (currently 1200 states, 74 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1286 known predicates. [2022-03-15 21:15:24,728 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 21:15:24,728 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 21:15:24,728 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 21:15:24,730 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2022-03-15 21:15:24,731 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 21:15:24,731 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 21:15:24,732 INFO L202 PluginConnector]: Adding new model name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 09:15:24 BasicIcfg [2022-03-15 21:15:24,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 21:15:24,733 INFO L158 Benchmark]: Toolchain (without parser) took 730336.32ms. Allocated memory was 195.0MB in the beginning and 1.0GB in the end (delta: 836.8MB). Free memory was 159.0MB in the beginning and 328.1MB in the end (delta: -169.1MB). Peak memory consumption was 668.5MB. Max. memory is 8.0GB. [2022-03-15 21:15:24,733 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 195.0MB. Free memory is still 160.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 21:15:24,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.90ms. Allocated memory is still 195.0MB. Free memory was 159.0MB in the beginning and 157.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:15:24,733 INFO L158 Benchmark]: Boogie Preprocessor took 12.10ms. Allocated memory is still 195.0MB. Free memory was 157.4MB in the beginning and 156.4MB in the end (delta: 966.5kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:15:24,733 INFO L158 Benchmark]: RCFGBuilder took 327.32ms. Allocated memory is still 195.0MB. Free memory was 156.4MB in the beginning and 141.9MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-03-15 21:15:24,733 INFO L158 Benchmark]: TraceAbstraction took 729964.87ms. Allocated memory was 195.0MB in the beginning and 1.0GB in the end (delta: 836.8MB). Free memory was 141.3MB in the beginning and 328.1MB in the end (delta: -186.7MB). Peak memory consumption was 650.7MB. Max. memory is 8.0GB. [2022-03-15 21:15:24,734 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 195.0MB. Free memory is still 160.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.90ms. Allocated memory is still 195.0MB. Free memory was 159.0MB in the beginning and 157.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 12.10ms. Allocated memory is still 195.0MB. Free memory was 157.4MB in the beginning and 156.4MB in the end (delta: 966.5kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 327.32ms. Allocated memory is still 195.0MB. Free memory was 156.4MB in the beginning and 141.9MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 729964.87ms. Allocated memory was 195.0MB in the beginning and 1.0GB in the end (delta: 836.8MB). Free memory was 141.3MB in the beginning and 328.1MB in the end (delta: -186.7MB). Peak memory consumption was 650.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 32 PlacesBefore, 27 PlacesAfterwards, 25 TransitionsBefore, 20 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 98 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 98, positive: 98, positive conditional: 0, positive unconditional: 98, 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: 50, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 98, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 50, unknown conditional: 0, unknown unconditional: 50] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 21, Positive conditional cache size: 0, Positive unconditional cache size: 21, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (169states) and FLOYD_HOARE automaton (currently 1200 states, 74 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1286 known predicates. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (169states) and FLOYD_HOARE automaton (currently 1200 states, 74 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1286 known predicates. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (169states) and FLOYD_HOARE automaton (currently 1200 states, 74 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1286 known predicates. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (169states) and FLOYD_HOARE automaton (currently 1200 states, 74 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1286 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 38 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 729.8s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 667.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7405 SdHoareTripleChecker+Valid, 29.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7405 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 25.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7888 mSDsCounter, 4127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56666 IncrementalHoareTripleChecker+Invalid, 60793 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4127 mSolverCounterUnsat, 0 mSDtfsCounter, 56666 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2909 GetRequests, 1172 SyntacticMatches, 15 SemanticMatches, 1721 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746274 ImplicationChecksByTransitivity, 643.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=3, InterpolantAutomatonStates: 273, 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, 6 MinimizatonAttempts, 878 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 2898 SizeOfPredicates, 74 NumberOfNonLiveVariables, 486 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 11/54 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown