/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/loop-tiling-eq.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:42:12,084 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:42:12,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:42:12,136 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:42:12,136 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:42:12,139 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:42:12,141 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:42:12,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:42:12,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:42:12,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:42:12,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:42:12,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:42:12,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:42:12,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:42:12,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:42:12,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:42:12,156 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:42:12,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:42:12,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:42:12,162 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:42:12,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:42:12,165 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:42:12,166 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:42:12,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:42:12,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:42:12,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:42:12,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:42:12,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:42:12,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:42:12,173 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:42:12,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:42:12,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:42:12,174 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:42:12,174 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:42:12,175 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:42:12,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:42:12,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:42:12,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:42:12,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:42:12,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:42:12,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:42:12,181 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 20:42:12,206 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:42:12,206 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:42:12,207 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:42:12,207 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:42:12,208 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:42:12,208 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:42:12,208 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:42:12,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:42:12,208 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:42:12,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:42:12,209 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:42:12,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:42:12,209 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:42:12,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:42:12,209 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:42:12,209 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:42:12,209 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:42:12,209 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:42:12,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:42:12,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:42:12,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:42:12,210 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:42:12,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:42:12,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:42:12,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:42:12,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:42:12,210 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:42:12,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:42:12,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:42:12,211 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:42:12,211 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:42:12,211 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:42:12,211 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 20:42:12,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:42:12,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:42:12,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:42:12,441 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 20:42:12,442 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 20:42:12,443 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/loop-tiling-eq.wvr.bpl [2022-03-15 20:42:12,444 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/loop-tiling-eq.wvr.bpl' [2022-03-15 20:42:12,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:42:12,464 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 20:42:12,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:42:12,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:42:12,466 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:42:12,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:12" (1/1) ... [2022-03-15 20:42:12,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:12" (1/1) ... [2022-03-15 20:42:12,484 INFO L137 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 20:42:12,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:42:12,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:42:12,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:42:12,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:42:12,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:12" (1/1) ... [2022-03-15 20:42:12,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:12" (1/1) ... [2022-03-15 20:42:12,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:12" (1/1) ... [2022-03-15 20:42:12,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:12" (1/1) ... [2022-03-15 20:42:12,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:12" (1/1) ... [2022-03-15 20:42:12,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:12" (1/1) ... [2022-03-15 20:42:12,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:12" (1/1) ... [2022-03-15 20:42:12,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:42:12,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:42:12,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:42:12,501 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:42:12,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:12" (1/1) ... [2022-03-15 20:42:12,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:42:12,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:12,523 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 20:42:12,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 20:42:12,582 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 20:42:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 20:42:12,582 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 20:42:12,582 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 20:42:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 20:42:12,582 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 20:42:12,582 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 20:42:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:42:12,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:42:12,583 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 20:42:12,618 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:42:12,620 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:42:12,739 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:42:12,752 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:42:12,752 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 20:42:12,753 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread1EXIT is neither atomic block end nor error location. [2022-03-15 20:42:12,753 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread2EXIT is neither atomic block end nor error location. [2022-03-15 20:42:12,754 INFO L202 PluginConnector]: Adding new model loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:42:12 BoogieIcfgContainer [2022-03-15 20:42:12,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:42:12,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:42:12,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:42:12,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:42:12,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:12" (1/2) ... [2022-03-15 20:42:12,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ccffc1e and model type loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:42:12, skipping insertion in model container [2022-03-15 20:42:12,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:42:12" (2/2) ... [2022-03-15 20:42:12,760 INFO L111 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.bpl [2022-03-15 20:42:12,763 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:42:12,763 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:42:12,763 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 20:42:12,763 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:42:12,782 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 20:42:12,821 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:42:12,826 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:42:12,826 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 20:42:12,833 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:42:12,839 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 18 transitions, 52 flow [2022-03-15 20:42:12,841 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 18 transitions, 52 flow [2022-03-15 20:42:12,842 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 22 places, 18 transitions, 52 flow [2022-03-15 20:42:12,853 INFO L129 PetriNetUnfolder]: 3/16 cut-off events. [2022-03-15 20:42:12,853 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 20:42:12,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 16 events. 3/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2022-03-15 20:42:12,856 INFO L116 LiptonReduction]: Number of co-enabled transitions 46 [2022-03-15 20:42:12,915 INFO L131 LiptonReduction]: Checked pairs total: 30 [2022-03-15 20:42:12,915 INFO L133 LiptonReduction]: Total number of compositions: 3 [2022-03-15 20:42:12,920 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 16 transitions, 48 flow [2022-03-15 20:42:12,928 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:12,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 20:42:12,933 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:12,933 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:12,933 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:12,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:12,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1940878297, now seen corresponding path program 1 times [2022-03-15 20:42:12,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:12,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913497265] [2022-03-15 20:42:12,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:12,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:13,071 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:42:13,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [310147518] [2022-03-15 20:42:13,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:13,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:13,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:13,088 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:13,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 20:42:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:13,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 20:42:13,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:13,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:42:13,268 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:13,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913497265] [2022-03-15 20:42:13,269 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:42:13,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310147518] [2022-03-15 20:42:13,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310147518] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:42:13,269 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:42:13,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:42:13,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [567157118] [2022-03-15 20:42:13,272 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:13,276 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:13,323 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 25 transitions. [2022-03-15 20:42:13,324 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:13,428 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:42:13,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 20:42:13,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:13,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 20:42:13,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 20:42:13,444 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 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 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:13,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:13,480 INFO L93 Difference]: Finished difference Result 35 states and 74 transitions. [2022-03-15 20:42:13,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 20:42:13,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-03-15 20:42:13,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:13,486 INFO L225 Difference]: With dead ends: 35 [2022-03-15 20:42:13,486 INFO L226 Difference]: Without dead ends: 30 [2022-03-15 20:42:13,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 20:42:13,489 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:13,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 8 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:42:13,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-03-15 20:42:13,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2022-03-15 20:42:13,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:13,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 53 transitions. [2022-03-15 20:42:13,512 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 53 transitions. Word has length 9 [2022-03-15 20:42:13,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:13,512 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 53 transitions. [2022-03-15 20:42:13,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:13,512 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 53 transitions. [2022-03-15 20:42:13,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:42:13,513 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:13,513 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:13,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:13,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-03-15 20:42:13,732 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:13,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:13,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1169345532, now seen corresponding path program 1 times [2022-03-15 20:42:13,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:13,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217047621] [2022-03-15 20:42:13,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:13,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:13,740 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:42:13,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [772918239] [2022-03-15 20:42:13,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:13,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:13,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:13,751 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:13,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 20:42:13,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:13,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 20:42:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:13,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:42:13,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:13,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217047621] [2022-03-15 20:42:13,870 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:42:13,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772918239] [2022-03-15 20:42:13,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772918239] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:42:13,870 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:42:13,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:42:13,870 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1573595378] [2022-03-15 20:42:13,871 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:13,871 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:13,876 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 39 transitions. [2022-03-15 20:42:13,876 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:14,047 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:42:14,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 20:42:14,050 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:14,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 20:42:14,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 20:42:14,057 INFO L87 Difference]: Start difference. First operand 26 states and 53 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:14,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:14,103 INFO L93 Difference]: Finished difference Result 43 states and 94 transitions. [2022-03-15 20:42:14,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 20:42:14,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 20:42:14,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:14,105 INFO L225 Difference]: With dead ends: 43 [2022-03-15 20:42:14,105 INFO L226 Difference]: Without dead ends: 30 [2022-03-15 20:42:14,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 20:42:14,108 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:14,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 9 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:42:14,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-03-15 20:42:14,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-03-15 20:42:14,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 61 transitions. [2022-03-15 20:42:14,118 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 61 transitions. Word has length 11 [2022-03-15 20:42:14,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:14,118 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 61 transitions. [2022-03-15 20:42:14,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:14,118 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 61 transitions. [2022-03-15 20:42:14,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:42:14,119 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:14,119 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:14,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:14,320 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,SelfDestructingSolverStorable1 [2022-03-15 20:42:14,322 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:14,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:14,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1890844708, now seen corresponding path program 1 times [2022-03-15 20:42:14,327 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:14,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582171726] [2022-03-15 20:42:14,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:14,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:14,334 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:42:14,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [648759529] [2022-03-15 20:42:14,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:14,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:14,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:14,342 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:14,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 20:42:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:14,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:42:14,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:14,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:14,624 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 20:42:14,624 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:14,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582171726] [2022-03-15 20:42:14,624 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:42:14,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648759529] [2022-03-15 20:42:14,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648759529] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:14,625 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:42:14,625 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2022-03-15 20:42:14,625 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1994985676] [2022-03-15 20:42:14,625 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:14,626 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:14,627 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 46 transitions. [2022-03-15 20:42:14,627 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:15,017 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [408#(and (or (<= L 0) (< x L)) (or (<= 0 i) (< x L))), 406#(and (or (<= L 0) (< x L)) (or (< j (+ M 1)) (< x L)) (or (< 0 N) (< x L))), 407#(and (or (< 0 L) (< j (+ M 1))) (or (< 0 L) (< 0 N))), 405#(or (< 0 L) (< 0 N)), 404#(and (or (<= L 0) (< x L)) (or (< 0 N) (< x L))), 409#(or (< 0 L) (<= 0 i))] [2022-03-15 20:42:15,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:42:15,017 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:15,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:42:15,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:42:15,018 INFO L87 Difference]: Start difference. First operand 30 states and 61 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:15,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:15,297 INFO L93 Difference]: Finished difference Result 51 states and 105 transitions. [2022-03-15 20:42:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 20:42:15,298 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 20:42:15,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:15,298 INFO L225 Difference]: With dead ends: 51 [2022-03-15 20:42:15,298 INFO L226 Difference]: Without dead ends: 37 [2022-03-15 20:42:15,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2022-03-15 20:42:15,299 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 56 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:15,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 42 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:15,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-03-15 20:42:15,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-03-15 20:42:15,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 2.111111111111111) internal successors, (76), 36 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:15,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 76 transitions. [2022-03-15 20:42:15,302 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 76 transitions. Word has length 12 [2022-03-15 20:42:15,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:15,302 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 76 transitions. [2022-03-15 20:42:15,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:15,303 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 76 transitions. [2022-03-15 20:42:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:42:15,303 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:15,303 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:15,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:15,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:15,525 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:15,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:15,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1578762864, now seen corresponding path program 1 times [2022-03-15 20:42:15,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:15,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958206681] [2022-03-15 20:42:15,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:15,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:15,541 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:42:15,541 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528427363] [2022-03-15 20:42:15,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:15,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:15,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:15,542 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:15,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 20:42:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:15,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 20:42:15,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:15,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-03-15 20:42:15,653 INFO L353 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-03-15 20:42:15,653 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 23 treesize of output 20 [2022-03-15 20:42:15,656 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 20:42:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:15,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:15,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 46 treesize of output 42 [2022-03-15 20:42:16,246 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 20:42:16,247 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 12 treesize of output 12 [2022-03-15 20:42:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:16,250 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:16,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958206681] [2022-03-15 20:42:16,250 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:42:16,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528427363] [2022-03-15 20:42:16,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528427363] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:16,251 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:42:16,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-03-15 20:42:16,251 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [895934595] [2022-03-15 20:42:16,251 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:16,252 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:16,255 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 59 transitions. [2022-03-15 20:42:16,255 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:16,861 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [649#(= i 0), 640#(and (or (and (= (select A 0) (select (select B 0) 0)) (not (= x 0))) (and (= (select (select B 0) 0) (select F x)) (= x 0))) (<= N 1) (<= M 1)), 643#(and (<= j 1) (or (and (= (select F x) (select (select B i) 0)) (= x 0)) (and (not (= x 0)) (= (select A 0) (select (select B i) 0)))) (= i 0)), 646#(and (<= j 1) (= (select (select B i) 0) (select F 0)) (= i 0)), 648#(and (or (= (select A 0) (select F 0)) (= x 0)) (= i 0)), 645#(and (<= i 1) (= (select (select B 0) 0) (select F 0)) (<= M 1)), 647#(and (= j 0) (= i 0)), 642#(and (<= i 1) (or (and (= (select A 0) (select (select B 0) 0)) (not (= x 0))) (and (= (select (select B 0) 0) (select F x)) (= x 0))) (<= M 1)), 644#(and (= j 0) (or (= (select A 0) (select F 0)) (= x 0)) (= i 0)), 641#(and (= (select (select B 0) 0) (select F 0)) (<= N 1) (<= M 1))] [2022-03-15 20:42:16,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 20:42:16,861 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:16,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 20:42:16,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:42:16,862 INFO L87 Difference]: Start difference. First operand 37 states and 76 transitions. Second operand has 19 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:17,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:17,293 INFO L93 Difference]: Finished difference Result 73 states and 162 transitions. [2022-03-15 20:42:17,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 20:42:17,294 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:42:17,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:17,294 INFO L225 Difference]: With dead ends: 73 [2022-03-15 20:42:17,294 INFO L226 Difference]: Without dead ends: 67 [2022-03-15 20:42:17,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:42:17,295 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 63 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:17,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 62 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:42:17,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-03-15 20:42:17,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 52. [2022-03-15 20:42:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.176470588235294) internal successors, (111), 51 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 111 transitions. [2022-03-15 20:42:17,299 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 111 transitions. Word has length 13 [2022-03-15 20:42:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:17,299 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 111 transitions. [2022-03-15 20:42:17,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 111 transitions. [2022-03-15 20:42:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:42:17,300 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:17,300 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:17,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-15 20:42:17,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:17,515 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:17,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:17,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1696136944, now seen corresponding path program 2 times [2022-03-15 20:42:17,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:17,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58224378] [2022-03-15 20:42:17,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:17,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:17,523 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:42:17,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [568950934] [2022-03-15 20:42:17,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:42:17,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:17,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:17,525 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:17,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 20:42:17,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:42:17,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:17,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:42:17,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:17,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:17,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:17,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58224378] [2022-03-15 20:42:17,890 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:42:17,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568950934] [2022-03-15 20:42:17,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568950934] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:17,890 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:42:17,890 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-03-15 20:42:17,890 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [651729544] [2022-03-15 20:42:17,890 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:17,891 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:17,894 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 68 transitions. [2022-03-15 20:42:17,894 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:18,982 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [956#(and (or (< 1 L) (<= L 0) (= i 0)) (or (< 1 L) (<= 0 j) (<= L 0))), 948#(and (or (= i 0) (< x L)) (or (<= L 1) (< x L)) (or (<= 0 j) (< x L))), 947#(and (or (= i 0) (< x L)) (or (<= L 1) (< x L)) (or (<= 1 j) (< x L))), 957#(or (< 1 L) (<= L 0) (= i 0)), 944#(and (or (<= i 1) (<= L x) (< (+ x 1) L)) (or (<= L x) (< (+ x 1) L) (<= L 1)) (or (<= L x) (< 1 M) (< (+ x 1) L))), 940#(and (or (<= L 1) (< x L)) (or (< 1 M) (< x L)) (or (<= N 1) (< x L))), 951#(and (or (<= L x) (< (+ x 1) L) (<= L 1)) (or (<= L x) (<= 0 j) (< (+ x 1) L)) (or (<= L x) (< (+ x 1) L) (= i 0))), 941#(and (or (<= L x) (< (+ x 1) L) (<= N 1)) (or (<= L x) (< (+ x 1) L) (<= L 1)) (or (<= L x) (< 1 M) (< (+ x 1) L))), 955#(and (or (<= 1 j) (< 1 L) (<= L 0)) (or (< 1 L) (<= L 0) (= i 0))), 946#(and (or (= i 0) (< x L)) (or (<= L 1) (< x L)) (or (< 1 M) (< x L))), 943#(and (or (<= L 1) (< x L)) (or (< 1 M) (< x L)) (or (<= i 1) (< x L))), 952#(and (or (= i 0) (< x L)) (or (<= L 1) (< x L))), 945#(and (or (< 1 L) (< 1 M) (<= L 0)) (or (< 1 L) (<= i 1) (<= L 0))), 954#(and (or (< 1 L) (<= L 0) (= i 0)) (or (< 1 L) (< 1 M) (<= L 0))), 953#(and (or (<= L x) (< (+ x 1) L) (<= L 1)) (or (<= L x) (< (+ x 1) L) (= i 0))), 949#(and (or (<= L x) (< (+ x 1) L) (<= L 1)) (or (<= L x) (< 1 M) (< (+ x 1) L)) (or (<= L x) (< (+ x 1) L) (= i 0))), 950#(and (or (<= L x) (< (+ x 1) L) (<= L 1)) (or (<= 1 j) (<= L x) (< (+ x 1) L)) (or (<= L x) (< (+ x 1) L) (= i 0))), 942#(and (or (< 1 L) (<= L 0) (<= N 1)) (or (< 1 L) (< 1 M) (<= L 0)))] [2022-03-15 20:42:18,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 20:42:18,982 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:18,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 20:42:18,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 20:42:18,983 INFO L87 Difference]: Start difference. First operand 52 states and 111 transitions. Second operand has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 29 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:21,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:21,941 INFO L93 Difference]: Finished difference Result 196 states and 398 transitions. [2022-03-15 20:42:21,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 20:42:21,942 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 29 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:42:21,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:21,946 INFO L225 Difference]: With dead ends: 196 [2022-03-15 20:42:21,946 INFO L226 Difference]: Without dead ends: 190 [2022-03-15 20:42:21,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1900 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=943, Invalid=5863, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 20:42:21,950 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 224 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:21,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 59 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 20:42:21,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-03-15 20:42:21,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 74. [2022-03-15 20:42:21,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 2.2465753424657535) internal successors, (164), 73 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:21,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 164 transitions. [2022-03-15 20:42:21,966 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 164 transitions. Word has length 14 [2022-03-15 20:42:21,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:21,966 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 164 transitions. [2022-03-15 20:42:21,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 29 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 164 transitions. [2022-03-15 20:42:21,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:42:21,967 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:21,967 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:21,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:22,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:22,184 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:22,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:22,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1200575356, now seen corresponding path program 3 times [2022-03-15 20:42:22,185 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:22,185 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018248760] [2022-03-15 20:42:22,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:22,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:22,191 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:42:22,192 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [54438127] [2022-03-15 20:42:22,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:42:22,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:22,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:22,193 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:22,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 20:42:22,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 20:42:22,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:22,226 WARN L261 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 20:42:22,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:22,235 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-03-15 20:42:22,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 20:42:22,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-03-15 20:42:22,321 INFO L353 Elim1Store]: treesize reduction 64, result has 9.9 percent of original size [2022-03-15 20:42:22,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 39 [2022-03-15 20:42:22,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:42:22,329 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-03-15 20:42:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:22,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:24,631 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 258 treesize of output 250 [2022-03-15 20:42:26,953 INFO L353 Elim1Store]: treesize reduction 22, result has 24.1 percent of original size [2022-03-15 20:42:26,953 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:42:26,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:26,960 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:26,964 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 20:42:26,964 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-03-15 20:42:26,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:26,969 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:26,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018248760] [2022-03-15 20:42:26,969 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:42:26,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54438127] [2022-03-15 20:42:26,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54438127] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:26,969 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:42:26,969 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-03-15 20:42:26,969 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1108607177] [2022-03-15 20:42:26,969 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:26,970 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:26,974 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 83 transitions. [2022-03-15 20:42:26,974 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:29,106 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [1514#(and (= 2 j) (= (select F 1) (select (select B i) (+ (- 1) j))) (= (select (select B i) (+ (- 2) j)) (select F 0)) (= i 0)), 1503#(and (<= i 1) (or (and (= (select A 0) (select (select B 0) 0)) (not (= x 0))) (and (= (select (select B 0) 0) (select F x)) (= x 0))) (<= M 2) (or (and (= (select (select B 0) 1) (select A 1)) (not (= x 1))) (and (= x 1) (= (select (select B 0) 1) (select F x))))), 1509#(and (= (select (select B 0) 1) (select F 1)) (= (select (select B 0) 0) (select F 0)) (<= M 2) (<= N 1)), 1518#(and (or (= (+ x 1) 0) (= (select A 0) (select F 0)) (= x 0)) (or (= (select F 1) (select A 1)) (= x 1) (= x 0)) (= i 0)), 1515#(and (= (select (select B i) (+ (- 1) j)) (select F (+ (- 1) (* M i) j))) (= i 0) (= j 1)), 1511#(and (= (select (select B 0) 1) (select F 1)) (<= i 1) (= (select (select B 0) 0) (select F 0)) (<= M 2)), 1512#(and (or (= (+ x 1) 1) (and (= x 1) (= (select F x) (select (select B i) (+ (- 1) j)))) (and (= (select A 1) (select (select B i) (+ (- 1) j))) (not (= x 1)))) (or (= (select (select B i) (+ (- 1) j)) (select F (+ x 1))) (not (= (+ x 1) 1))) (or (and (not (= x 0)) (= (select (select B i) (+ (- 2) j)) (select A 0))) (and (= (select (select B i) (+ (- 2) j)) (select F x)) (= x 0)) (= (+ x 1) 0)) (= 2 j) (= i 0) (or (= (select (select B i) (+ (- 2) j)) (select F (+ x 1))) (not (= (+ x 1) 0)))), 1516#(and (or (= (+ x 1) 0) (= (select A 0) (select F 0)) (= x 0)) (= j 0) (or (= (select F 1) (select A 1)) (= x 1) (= x 0)) (= i 0)), 1505#(and (or (= (select F 1) (select A 1)) (= x 1)) (or (= (select A 0) (select F 0)) (= x 0)) (= (select (select B i) (+ (- 1) j)) (select F (+ (- 1) (* M i) j))) (= i 0) (= j 1)), 1502#(and (or (and (= (select A 0) (select (select B 0) 0)) (not (= x 0))) (and (= (select (select B 0) 0) (select F x)) (= x 0))) (not (< 2 M)) (<= N 1) (or (and (= (select (select B 0) 1) (select A 1)) (not (= x 1))) (and (= x 1) (= (select (select B 0) 1) (select F x))))), 1510#(and (or (and (= (select A 0) (select (select B 0) 0)) (not (= x 0))) (and (= (select (select B 0) 0) (select F x)) (= x 0)) (= (+ x 1) 0)) (<= i 1) (or (= (+ x 1) 1) (and (= (select (select B 0) 1) (select A 1)) (not (= x 1))) (and (= x 1) (= (select (select B 0) 1) (select F x)))) (or (= (select (select B 0) 0) (select F (+ x 1))) (not (= (+ x 1) 0))) (<= M 2) (or (= (select (select B 0) 1) (select F (+ x 1))) (not (= (+ x 1) 1)))), 1506#(and (or (= (select F 1) (select A 1)) (= x 1)) (= j 0) (or (= (select A 0) (select F 0)) (= x 0)) (= i 0)), 1519#(= i 0), 1504#(and (= 2 j) (or (and (not (= x 0)) (= (select (select B i) (+ (- 2) j)) (select A 0))) (and (= (select (select B i) (+ (- 2) j)) (select F x)) (= x 0))) (or (and (= x 1) (= (select F x) (select (select B i) (+ (- 1) j)))) (and (= (select A 1) (select (select B i) (+ (- 1) j))) (not (= x 1)))) (= i 0)), 1507#(and (or (= (select F 1) (select A 1)) (= x 1)) (or (= (select A 0) (select F 0)) (= x 0)) (= i 0)), 1517#(and (= j 0) (= i 0)), 1508#(and (or (and (= (select A 0) (select (select B 0) 0)) (not (= x 0))) (and (= (select (select B 0) 0) (select F x)) (= x 0)) (= (+ x 1) 0)) (or (= (+ x 1) 1) (and (= (select (select B 0) 1) (select A 1)) (not (= x 1))) (and (= x 1) (= (select (select B 0) 1) (select F x)))) (or (= (select (select B 0) 0) (select F (+ x 1))) (not (= (+ x 1) 0))) (<= M 2) (or (= (select (select B 0) 1) (select F (+ x 1))) (not (= (+ x 1) 1))) (<= N 1)), 1513#(and (or (= (+ x 1) 0) (= (select A 0) (select F 0)) (= x 0)) (= (select (select B i) (+ (- 1) j)) (select F (+ (- 1) (* M i) j))) (or (= (select F 1) (select A 1)) (= x 1) (= x 0)) (= i 0) (= j 1))] [2022-03-15 20:42:29,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 20:42:29,106 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:29,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 20:42:29,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1104, Unknown=1, NotChecked=0, Total=1260 [2022-03-15 20:42:29,107 INFO L87 Difference]: Start difference. First operand 74 states and 164 transitions. Second operand has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:30,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:30,593 INFO L93 Difference]: Finished difference Result 136 states and 307 transitions. [2022-03-15 20:42:30,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 20:42:30,594 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:42:30,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:30,595 INFO L225 Difference]: With dead ends: 136 [2022-03-15 20:42:30,595 INFO L226 Difference]: Without dead ends: 129 [2022-03-15 20:42:30,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 19 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=313, Invalid=2338, Unknown=1, NotChecked=0, Total=2652 [2022-03-15 20:42:30,596 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 122 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:30,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 95 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:42:30,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-03-15 20:42:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 80. [2022-03-15 20:42:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 2.3164556962025316) internal successors, (183), 79 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:30,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 183 transitions. [2022-03-15 20:42:30,601 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 183 transitions. Word has length 15 [2022-03-15 20:42:30,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:30,602 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 183 transitions. [2022-03-15 20:42:30,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:30,602 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 183 transitions. [2022-03-15 20:42:30,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:42:30,602 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:30,602 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:30,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-15 20:42:30,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:30,819 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:30,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:30,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1297614605, now seen corresponding path program 4 times [2022-03-15 20:42:30,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:30,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592760734] [2022-03-15 20:42:30,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:30,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:30,825 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:42:30,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2133974187] [2022-03-15 20:42:30,825 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:42:30,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:30,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:30,826 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:30,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 20:42:30,852 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:42:30,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:30,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 20:42:30,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:30,999 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:30,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:31,269 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:31,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592760734] [2022-03-15 20:42:31,269 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:42:31,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133974187] [2022-03-15 20:42:31,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133974187] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:31,270 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:42:31,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-03-15 20:42:31,270 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2145871870] [2022-03-15 20:42:31,270 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:31,271 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:31,275 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 86 transitions. [2022-03-15 20:42:31,275 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:32,791 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [1966#(and (or (<= 0 i) (<= L x) (< (+ x 1) L)) (or (<= L x) (< (+ x 1) L) (<= L 1))), 1953#(and (or (< x L) (<= M 1)) (or (< 1 N) (< x L)) (or (<= L 1) (< x L)) (or (< 0 M) (< x L))), 1955#(and (or (<= L 1) (< x L)) (or (< 0 M) (< x L)) (or (<= 0 i) (< x L)) (or (<= j 1) (< x L))), 1959#(and (or (<= L x) (< (+ x 1) L) (< 0 M)) (or (<= L x) (< (+ x 1) L) (<= L 1)) (or (<= L x) (< (+ x 1) L) (<= 1 i)) (or (<= L x) (< (+ x 1) L) (<= M 1))), 1958#(and (or (<= L x) (< (+ x 1) L) (< 0 M)) (or (<= L x) (< (+ x 1) L) (<= L 1)) (or (<= L x) (< (+ x 1) L) (< 1 N)) (or (<= L x) (< (+ x 1) L) (<= M 1))), 1957#(and (or (<= L 1) (< x L)) (or (<= 0 i) (< x L))), 1967#(or (< 1 L) (<= 0 i) (<= L 0)), 1954#(and (or (< x L) (<= M 1)) (or (<= L 1) (< x L)) (or (< x L) (<= 1 i)) (or (< 0 M) (< x L))), 1964#(and (or (<= L x) (= j 0) (< (+ x 1) L)) (or (<= 0 i) (<= L x) (< (+ x 1) L)) (or (<= L x) (< (+ x 1) L) (<= L 1))), 1965#(and (or (< 1 L) (<= 0 i) (<= L 0)) (or (< 1 L) (= j 0) (<= L 0))), 1956#(and (or (= j 0) (< x L)) (or (<= L 1) (< x L)) (or (<= 0 i) (< x L))), 1961#(and (or (< 1 L) (<= L 0) (< 0 M)) (or (< 1 L) (<= L 0) (<= 1 i)) (or (< 1 L) (<= L 0) (<= M 1))), 1962#(and (or (<= L x) (< (+ x 1) L) (< 0 M)) (or (<= 0 i) (<= L x) (< (+ x 1) L)) (or (<= L x) (< (+ x 1) L) (<= L 1)) (or (<= L x) (<= j 1) (< (+ x 1) L))), 1963#(and (or (< 1 L) (<= L 0) (< 0 M)) (or (< 1 L) (<= j 1) (<= L 0)) (or (< 1 L) (<= 0 i) (<= L 0))), 1960#(and (or (< 1 L) (<= L 0) (< 1 N)) (or (< 1 L) (<= L 0) (< 0 M)) (or (< 1 L) (<= L 0) (<= M 1)))] [2022-03-15 20:42:32,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:42:32,792 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:32,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:42:32,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:42:32,792 INFO L87 Difference]: Start difference. First operand 80 states and 183 transitions. Second operand has 25 states, 24 states have (on average 2.625) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:35,881 INFO L93 Difference]: Finished difference Result 267 states and 567 transitions. [2022-03-15 20:42:35,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-15 20:42:35,882 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:42:35,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:35,883 INFO L225 Difference]: With dead ends: 267 [2022-03-15 20:42:35,883 INFO L226 Difference]: Without dead ends: 247 [2022-03-15 20:42:35,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1598 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1105, Invalid=5375, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 20:42:35,884 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 202 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:35,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 58 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:42:35,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-03-15 20:42:35,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 116. [2022-03-15 20:42:35,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 2.382608695652174) internal successors, (274), 115 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:35,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 274 transitions. [2022-03-15 20:42:35,890 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 274 transitions. Word has length 16 [2022-03-15 20:42:35,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:35,890 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 274 transitions. [2022-03-15 20:42:35,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:35,890 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 274 transitions. [2022-03-15 20:42:35,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:42:35,892 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:35,892 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:35,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:36,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:36,115 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:36,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:36,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1435998044, now seen corresponding path program 5 times [2022-03-15 20:42:36,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:36,117 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911633784] [2022-03-15 20:42:36,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:36,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:36,125 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:42:36,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [384513118] [2022-03-15 20:42:36,125 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:42:36,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:36,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:36,131 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:36,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 20:42:36,161 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:42:36,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:36,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 20:42:36,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:36,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:36,455 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:36,455 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911633784] [2022-03-15 20:42:36,455 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:42:36,455 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384513118] [2022-03-15 20:42:36,455 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384513118] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:36,455 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:42:36,455 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-03-15 20:42:36,455 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [959439532] [2022-03-15 20:42:36,455 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:36,456 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:36,460 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 94 transitions. [2022-03-15 20:42:36,460 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:38,263 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [2697#(and (or (<= 1 j) (<= L (+ x 1)) (< (+ 2 x) L)) (or (<= L (+ x 1)) (< (+ 2 x) L) (= i 0)) (or (<= L (+ x 1)) (< (+ 2 x) L) (<= L 2)) (or (<= L (+ x 1)) (< (+ 2 x) L) (< i N))), 2685#(and (or (<= i 1) (<= L x) (< (+ x 1) L)) (or (<= L x) (< (+ x 1) L) (<= L 2)) (or (<= L x) (< (+ x 1) L) (< 2 M)) (or (< 0 N) (<= L x) (< (+ x 1) L))), 2699#(and (or (<= i 1) (< 2 L) (<= L 1)) (or (< 2 L) (<= L 1) (< 2 M)) (or (< 0 N) (< 2 L) (<= L 1))), 2708#(or (< 2 L) (<= L 1) (= i 0)), 2702#(and (or (<= 1 j) (< 2 L) (<= L 1)) (or (< 2 L) (<= L 1) (= i 0)) (or (< 2 L) (<= L 1) (< i N))), 2681#(and (or (<= L 2) (< x L)) (or (< 2 M) (< x L)) (or (< 0 N) (< x L)) (or (<= N 1) (< x L))), 2691#(and (or (= i 0) (< x L)) (or (< i N) (< x L)) (or (<= L 2) (< x L)) (or (<= 0 j) (< x L))), 2687#(and (or (<= L x) (< (+ x 1) L) (<= L 2)) (or (<= L x) (< (+ x 1) L) (< i N)) (or (<= L x) (< (+ x 1) L) (< 2 M)) (or (<= L x) (< (+ x 1) L) (= i 0))), 2694#(and (or (<= i 1) (<= L (+ x 1)) (< (+ 2 x) L)) (or (<= L (+ x 1)) (< (+ 2 x) L) (<= L 2)) (or (< 0 N) (<= L (+ x 1)) (< (+ 2 x) L)) (or (<= L (+ x 1)) (< (+ 2 x) L) (< 2 M))), 2692#(and (or (<= L x) (< (+ x 1) L) (<= L 2)) (or (<= 1 j) (<= L x) (< (+ x 1) L)) (or (<= L x) (< (+ x 1) L) (< i N)) (or (<= L x) (< (+ x 1) L) (= i 0))), 2686#(and (or (= i 0) (< x L)) (or (< i N) (< x L)) (or (<= L 2) (< x L)) (or (< 2 M) (< x L))), 2682#(and (or (<= L x) (< (+ x 1) L) (<= N 1)) (or (<= L x) (< (+ x 1) L) (<= L 2)) (or (<= L x) (< (+ x 1) L) (< 2 M)) (or (< 0 N) (<= L x) (< (+ x 1) L))), 2703#(and (or (<= L (+ x 1)) (<= 0 j) (< (+ 2 x) L)) (or (<= L (+ x 1)) (< (+ 2 x) L) (= i 0)) (or (<= L (+ x 1)) (< (+ 2 x) L) (<= L 2)) (or (<= L (+ x 1)) (< (+ 2 x) L) (< i N))), 2696#(and (or (<= L (+ x 1)) (< (+ 2 x) L) (= i 0)) (or (<= L (+ x 1)) (< (+ 2 x) L) (<= L 2)) (or (<= L (+ x 1)) (< (+ 2 x) L) (< i N)) (or (<= 2 j) (<= L (+ x 1)) (< (+ 2 x) L))), 2700#(and (or (< 2 L) (<= L 1) (< 2 M)) (or (< 2 L) (<= L 1) (= i 0)) (or (< 2 L) (<= L 1) (< i N))), 2683#(and (or (<= L (+ x 1)) (< (+ 2 x) L) (<= N 1)) (or (<= L (+ x 1)) (< (+ 2 x) L) (<= L 2)) (or (< 0 N) (<= L (+ x 1)) (< (+ 2 x) L)) (or (<= L (+ x 1)) (< (+ 2 x) L) (< 2 M))), 2698#(and (or (< 2 L) (<= L 1) (<= N 1)) (or (< 2 L) (<= L 1) (< 2 M)) (or (< 0 N) (< 2 L) (<= L 1))), 2689#(and (or (= i 0) (< x L)) (or (< i N) (< x L)) (or (<= L 2) (< x L)) (or (<= 1 j) (< x L))), 2690#(and (or (<= L x) (< (+ x 1) L) (<= L 2)) (or (<= L x) (< (+ x 1) L) (< i N)) (or (<= L x) (< (+ x 1) L) (= i 0)) (or (<= L x) (<= 2 j) (< (+ x 1) L))), 2705#(and (or (= i 0) (< x L)) (or (<= L 2) (< x L))), 2688#(and (or (= i 0) (< x L)) (or (<= 2 j) (< x L)) (or (< i N) (< x L)) (or (<= L 2) (< x L))), 2693#(and (or (<= L x) (< (+ x 1) L) (<= L 2)) (or (<= L x) (<= 0 j) (< (+ x 1) L)) (or (<= L x) (< (+ x 1) L) (< i N)) (or (<= L x) (< (+ x 1) L) (= i 0))), 2704#(and (or (< 2 L) (<= L 1) (= i 0)) (or (< 2 L) (<= L 1) (< i N)) (or (< 2 L) (<= 0 j) (<= L 1))), 2684#(and (or (<= L 2) (< x L)) (or (< 2 M) (< x L)) (or (< 0 N) (< x L)) (or (<= i 1) (< x L))), 2695#(and (or (<= L (+ x 1)) (< (+ 2 x) L) (= i 0)) (or (<= L (+ x 1)) (< (+ 2 x) L) (<= L 2)) (or (<= L (+ x 1)) (< (+ 2 x) L) (< 2 M)) (or (<= L (+ x 1)) (< (+ 2 x) L) (< i N))), 2701#(and (or (< 2 L) (<= L 1) (= i 0)) (or (<= 2 j) (< 2 L) (<= L 1)) (or (< 2 L) (<= L 1) (< i N))), 2706#(and (or (<= L x) (< (+ x 1) L) (<= L 2)) (or (<= L x) (< (+ x 1) L) (= i 0))), 2707#(and (or (<= L (+ x 1)) (< (+ 2 x) L) (= i 0)) (or (<= L (+ x 1)) (< (+ 2 x) L) (<= L 2)))] [2022-03-15 20:42:38,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 20:42:38,264 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:38,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 20:42:38,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2024, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 20:42:38,265 INFO L87 Difference]: Start difference. First operand 116 states and 274 transitions. Second operand has 41 states, 40 states have (on average 2.075) internal successors, (83), 41 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:46,783 INFO L93 Difference]: Finished difference Result 359 states and 769 transitions. [2022-03-15 20:42:46,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-03-15 20:42:46,783 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.075) internal successors, (83), 41 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:42:46,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:46,792 INFO L225 Difference]: With dead ends: 359 [2022-03-15 20:42:46,793 INFO L226 Difference]: Without dead ends: 353 [2022-03-15 20:42:46,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5778 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=2828, Invalid=16078, Unknown=0, NotChecked=0, Total=18906 [2022-03-15 20:42:46,796 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 478 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 1732 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:46,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [478 Valid, 81 Invalid, 2028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1732 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:42:46,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-03-15 20:42:46,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 135. [2022-03-15 20:42:46,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.3805970149253732) internal successors, (319), 134 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 319 transitions. [2022-03-15 20:42:46,818 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 319 transitions. Word has length 16 [2022-03-15 20:42:46,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:46,819 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 319 transitions. [2022-03-15 20:42:46,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.075) internal successors, (83), 41 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:46,819 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 319 transitions. [2022-03-15 20:42:46,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:42:46,820 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:46,820 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:46,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:47,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-03-15 20:42:47,037 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:47,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:47,037 INFO L85 PathProgramCache]: Analyzing trace with hash -709776269, now seen corresponding path program 6 times [2022-03-15 20:42:47,038 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:47,038 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671488253] [2022-03-15 20:42:47,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:47,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:47,045 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:42:47,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1896147926] [2022-03-15 20:42:47,045 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:42:47,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:47,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:47,046 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:47,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 20:42:47,073 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 20:42:47,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:47,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 20:42:47,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 20:42:47,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:47,159 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-15 20:43:12,793 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 20:43:12,793 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:12,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671488253] [2022-03-15 20:43:12,793 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:43:12,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896147926] [2022-03-15 20:43:12,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896147926] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:12,793 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:43:12,793 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-03-15 20:43:12,793 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [68752604] [2022-03-15 20:43:12,794 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:12,795 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:12,798 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 95 transitions. [2022-03-15 20:43:12,798 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:25,506 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [3631#(and (or (< 1 N) (< x L)) (or (<= L 1) (< x L)) (or (< 0 L) (< x L))), 3637#(or (< 1 L) (<= L 0) (< 1 N)), 3632#(and (or (<= L 1) (< x L)) (or (< 0 L) (< x L)) (or (< x L) (<= 1 i))), 3639#(or (< 1 L) (<= 0 i) (<= L 0)), 3638#(or (< 1 L) (<= L 0) (<= 1 i)), 3635#(and (or (<= L x) (< (+ x 1) L) (<= L 1)) (or (< 0 L) (<= L x) (< (+ x 1) L)) (or (<= L x) (< (+ x 1) L) (<= 1 i))), 3633#(and (or (<= L 1) (< x L)) (or (< 0 L) (< x L)) (or (<= 0 i) (< x L))), 3636#(and (or (<= 0 i) (<= L x) (< (+ x 1) L)) (or (<= L x) (< (+ x 1) L) (<= L 1)) (or (< 0 L) (<= L x) (< (+ x 1) L))), 3634#(and (or (<= L x) (< (+ x 1) L) (<= L 1)) (or (< 0 L) (<= L x) (< (+ x 1) L)) (or (<= L x) (< (+ x 1) L) (< 1 N)))] [2022-03-15 20:43:25,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 20:43:25,507 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:25,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 20:43:25,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=403, Unknown=17, NotChecked=0, Total=506 [2022-03-15 20:43:25,507 INFO L87 Difference]: Start difference. First operand 135 states and 319 transitions. Second operand has 17 states, 16 states have (on average 3.4375) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:27,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:27,805 INFO L93 Difference]: Finished difference Result 177 states and 395 transitions. [2022-03-15 20:43:27,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:43:27,805 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:43:27,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:27,806 INFO L225 Difference]: With dead ends: 177 [2022-03-15 20:43:27,806 INFO L226 Difference]: Without dead ends: 143 [2022-03-15 20:43:27,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=299, Invalid=1244, Unknown=17, NotChecked=0, Total=1560 [2022-03-15 20:43:27,807 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 100 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:27,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 41 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:43:27,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-03-15 20:43:27,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 93. [2022-03-15 20:43:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.3260869565217392) internal successors, (214), 92 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:27,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 214 transitions. [2022-03-15 20:43:27,811 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 214 transitions. Word has length 17 [2022-03-15 20:43:27,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:27,811 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 214 transitions. [2022-03-15 20:43:27,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:27,811 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 214 transitions. [2022-03-15 20:43:27,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:43:27,811 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:27,811 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:27,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 20:43:28,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:28,012 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:28,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:28,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1899327097, now seen corresponding path program 7 times [2022-03-15 20:43:28,014 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:28,014 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976992655] [2022-03-15 20:43:28,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:28,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:28,035 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:43:28,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2145739755] [2022-03-15 20:43:28,035 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:43:28,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:28,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:28,040 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:28,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 20:43:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:28,074 WARN L261 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 20:43:28,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:28,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-03-15 20:43:28,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 20:43:28,186 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 20:43:28,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:43:28,325 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:43:28,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2022-03-15 20:43:28,329 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-03-15 20:43:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:28,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:39,474 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 120 treesize of output 116 [2022-03-15 20:43:44,809 INFO L353 Elim1Store]: treesize reduction 22, result has 24.1 percent of original size [2022-03-15 20:43:44,810 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:43:44,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:43:44,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:43:44,824 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 20:43:44,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-03-15 20:43:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:44,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:44,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976992655] [2022-03-15 20:43:44,830 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:43:44,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145739755] [2022-03-15 20:43:44,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145739755] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:44,830 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:43:44,830 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2022-03-15 20:43:44,830 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1805251296] [2022-03-15 20:43:44,830 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:44,831 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:44,835 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 105 transitions. [2022-03-15 20:43:44,835 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:49,380 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [4179#(and (or (= (+ x 1) 0) (= (select A 0) (select F 0)) (= x 0)) (or (= (select F 1) (select A 1)) (= x 1) (= x 0)) (= i 0)), 4166#(and (= i 1) (= (select (select B 0) 0) (select F 0)) (or (= (select F 1) (select A 1)) (= x 1)) (or (= (select A 0) (select F 0)) (= x 0)) (< 0 M) (<= M 1)), 4172#(and (or (= (+ x 1) 0) (= (select A 0) (select F 0)) (= x 0)) (= j 0) (or (= (select F 1) (select A 1)) (= x 1) (= x 0)) (= i 0)), 4161#(and (or (and (= (select A 0) (select (select B 0) 0)) (not (= x 0))) (and (= (select (select B 0) 0) (select F x)) (= x 0)) (= (+ x 1) 0)) (or (= (select (select B 1) 0) (select F (+ x 1))) (not (= (+ x 1) 1))) (or (= (select (select B 0) 0) (select F (+ x 1))) (not (= (+ x 1) 0))) (<= i 2) (< 0 M) (<= M 1) (or (= (+ x 1) 1) (and (= (select (select B 1) 0) (select F x)) (= x 1)) (and (not (= x 1)) (= (select (select B 1) 0) (select A 1))))), 4165#(and (or (= (select A 0) (select (select B 0) 0)) (= x 0)) (or (= (select A 1) (select F (+ (* M i) j))) (= x 1)) (= i 1) (= (select (select B 0) 0) (select F 0)) (= j 0) (< 0 M) (<= M 1)), 4162#(and (= (select F 1) (select (select B 1) 0)) (= (select (select B 0) 0) (select F 0)) (<= i 2) (< 0 M) (<= M 1)), 4170#(and (or (= (+ x 1) 0) (= (select A 0) (select F 0)) (= x 0)) (= (select (select B i) 0) (select F (* M i))) (or (= (select F 1) (select A 1)) (= x 1) (= x 0)) (< 0 M) (= i 0) (= j 1)), 4171#(and (or (= (select F 1) (select A 1)) (= x 1)) (= j 0) (or (= (select A 0) (select F 0)) (= x 0)) (= i 0)), 4173#(and (= (select F 1) (select (select B i) 0)) (= i 1) (= (select (select B 0) 0) (select F 0)) (< 0 M) (<= M 1)), 4160#(and (or (and (= (select A 0) (select (select B 0) 0)) (not (= x 0))) (and (= (select (select B 0) 0) (select F x)) (= x 0))) (<= i 2) (< 0 M) (or (and (= (select (select B 1) 0) (select F x)) (= x 1)) (and (not (= x 1)) (= (select (select B 1) 0) (select A 1)))) (<= M 1)), 4180#(= i 0), 4178#(and (or (= (select F 1) (select A 1)) (= x 1)) (or (= (select A 0) (select F 0)) (= x 0)) (= i 0)), 4174#(and (= i 1) (= (select (select B 0) 0) (select F 0)) (= j 0) (< 0 M) (<= M 1)), 4159#(and (= (select F 1) (select (select B 1) 0)) (= (select (select B 0) 0) (select F 0)) (<= N 2) (< 0 M) (<= M 1)), 4175#(and (= i 1) (= (select (select B 0) 0) (select F 0)) (< 0 M) (<= M 1)), 4176#(and (= (select (select B i) 0) (select F (* M i))) (< 0 M) (= i 0) (= j 1)), 4164#(and (or (and (= (select A 0) (select (select B 0) 0)) (not (= x 0))) (and (= (select (select B 0) 0) (select F x)) (= x 0)) (= (+ x 1) 0)) (or (= (select (select B 0) 0) (select F (+ x 1))) (not (= (+ x 1) 0))) (= i 1) (or (= (+ x 1) 1) (and (= (select F x) (select (select B i) 0)) (= x 1)) (and (= (select A 1) (select (select B i) 0)) (not (= x 1)))) (< 0 M) (or (= (select (select B i) 0) (select F (+ x 1))) (not (= (+ x 1) 1))) (<= M 1)), 4158#(and (or (and (= (select A 0) (select (select B 0) 0)) (not (= x 0))) (and (= (select (select B 0) 0) (select F x)) (= x 0)) (= (+ x 1) 0)) (or (= (select (select B 1) 0) (select F (+ x 1))) (not (= (+ x 1) 1))) (or (= (select (select B 0) 0) (select F (+ x 1))) (not (= (+ x 1) 0))) (<= N 2) (< 0 M) (<= M 1) (or (= (+ x 1) 1) (and (= (select (select B 1) 0) (select F x)) (= x 1)) (and (not (= x 1)) (= (select (select B 1) 0) (select A 1))))), 4177#(and (= j 0) (= i 0)), 4157#(and (or (and (= (select A 0) (select (select B 0) 0)) (not (= x 0))) (and (= (select (select B 0) 0) (select F x)) (= x 0))) (<= N 2) (not (< 1 M)) (< 0 M) (or (and (= (select (select B 1) 0) (select F x)) (= x 1)) (and (not (= x 1)) (= (select (select B 1) 0) (select A 1))))), 4167#(and (or (= (select A 0) (select (select B 0) 0)) (= (+ x 1) 0) (= x 0)) (= i 1) (= (select (select B 0) 0) (select F 0)) (= j 0) (or (= (select A 1) (select F (+ (* M i) j))) (= x 1) (= x 0)) (< 0 M) (<= M 1)), 4169#(and (= (select (select B i) 0) (select F (* M i))) (or (= (select F 1) (select A 1)) (= x 1)) (or (= (select A 0) (select F 0)) (= x 0)) (< 0 M) (= i 0) (= j 1)), 4163#(and (= i 1) (or (and (= (select F x) (select (select B i) 0)) (= x 1)) (and (= (select A 1) (select (select B i) 0)) (not (= x 1)))) (or (and (= (select A 0) (select (select B 0) 0)) (not (= x 0))) (and (= (select (select B 0) 0) (select F x)) (= x 0))) (< 0 M) (<= M 1)), 4168#(and (or (= (+ x 1) 0) (= (select A 0) (select F 0)) (= x 0)) (= i 1) (= (select (select B 0) 0) (select F 0)) (or (= (select F 1) (select A 1)) (= x 1) (= x 0)) (< 0 M) (<= M 1))] [2022-03-15 20:43:49,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 20:43:49,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:49,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 20:43:49,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1857, Unknown=5, NotChecked=0, Total=2070 [2022-03-15 20:43:49,381 INFO L87 Difference]: Start difference. First operand 93 states and 214 transitions. Second operand has 37 states, 36 states have (on average 2.3333333333333335) internal successors, (84), 37 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:52,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:52,480 INFO L93 Difference]: Finished difference Result 143 states and 327 transitions. [2022-03-15 20:43:52,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 20:43:52,481 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.3333333333333335) internal successors, (84), 37 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:43:52,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:52,483 INFO L225 Difference]: With dead ends: 143 [2022-03-15 20:43:52,483 INFO L226 Difference]: Without dead ends: 136 [2022-03-15 20:43:52,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 20 SyntacticMatches, 12 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=411, Invalid=3874, Unknown=5, NotChecked=0, Total=4290 [2022-03-15 20:43:52,485 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 116 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:52,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 114 Invalid, 1837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 20:43:52,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-03-15 20:43:52,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 111. [2022-03-15 20:43:52,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 2.327272727272727) internal successors, (256), 110 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 256 transitions. [2022-03-15 20:43:52,494 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 256 transitions. Word has length 17 [2022-03-15 20:43:52,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:52,494 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 256 transitions. [2022-03-15 20:43:52,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.3333333333333335) internal successors, (84), 37 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:52,494 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 256 transitions. [2022-03-15 20:43:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:43:52,494 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:52,494 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:52,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 20:43:52,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 20:43:52,712 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:52,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:52,712 INFO L85 PathProgramCache]: Analyzing trace with hash 834285552, now seen corresponding path program 8 times [2022-03-15 20:43:52,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:52,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019626644] [2022-03-15 20:43:52,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:52,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:52,720 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:43:52,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [239398080] [2022-03-15 20:43:52,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:43:52,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:52,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:52,721 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:52,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 20:43:52,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:43:52,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:52,757 WARN L261 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 20:43:52,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:52,770 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-03-15 20:43:52,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:43:52,797 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-03-15 20:43:52,836 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-03-15 20:43:52,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 20:43:52,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:43:52,973 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2022-03-15 20:43:53,040 INFO L353 Elim1Store]: treesize reduction 137, result has 6.8 percent of original size [2022-03-15 20:43:53,041 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 63 treesize of output 50 [2022-03-15 20:43:53,045 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-03-15 20:43:53,154 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:53,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:00,120 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2250 treesize of output 2218 [2022-03-15 20:44:20,506 INFO L353 Elim1Store]: treesize reduction 49, result has 19.7 percent of original size [2022-03-15 20:44:20,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 20:44:20,514 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:20,514 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:20,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:20,516 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:20,531 INFO L353 Elim1Store]: treesize reduction 14, result has 33.3 percent of original size [2022-03-15 20:44:20,531 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2022-03-15 20:44:20,537 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:20,537 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:20,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:20,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:20,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:20,546 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 20:44:20,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 22 [2022-03-15 20:44:20,552 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:20,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:20,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019626644] [2022-03-15 20:44:20,552 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:44:20,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239398080] [2022-03-15 20:44:20,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239398080] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:20,553 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:44:20,553 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2022-03-15 20:44:20,553 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1955956714] [2022-03-15 20:44:20,553 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:20,554 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:20,558 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 111 transitions. [2022-03-15 20:44:20,558 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:29,493 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [4706#(and (or (and (not (= x 1)) (= (select (select B i) 1) (select A 1))) (and (= (select (select B i) 1) (select F x)) (= x 1))) (or (and (= (select F x) (select (select B i) 0)) (= x 0)) (and (not (= x 0)) (= (select A 0) (select (select B i) 0)))) (<= j 3) (or (and (= (select A 2) (select (select B i) 2)) (not (= 2 x))) (and (= 2 x) (= (select F x) (select (select B i) 2)))) (= i 0)), 4708#(and (or (and (= (select A 0) (select (select B 0) 0)) (not (= x 0))) (and (= (select (select B 0) 0) (select F x)) (= x 0)) (= (+ x 1) 0)) (<= M 3) (or (= (+ x 1) 1) (and (= (select (select B 0) 1) (select A 1)) (not (= x 1))) (and (= x 1) (= (select (select B 0) 1) (select F x)))) (or (= (select (select B 0) 0) (select F (+ x 1))) (not (= (+ x 1) 0))) (or (= (select (select B 0) 1) (select F (+ x 1))) (not (= (+ x 1) 1))) (or (and (not (= 2 x)) (= (select (select B 0) 2) (select A 2))) (and (= 2 x) (= (select (select B 0) 2) (select F x))) (= x 1)) (<= N 1) (or (not (= (+ x 1) 2)) (= (select (select B 0) 2) (select F (+ x 1))))), 4717#(and (or (and (not (= 2 x)) (= (select (select B 0) 2) (select A 2))) (and (= 2 x) (= (select (select B 0) 2) (select F x))) (= (+ x 1) 2) (= 2 (+ 2 x))) (<= M 3) (or (= (select (select B 0) 1) (select F (+ x 1))) (not (= x 0))) (or (not (= (+ 2 x) 1)) (= (select (select B 0) 1) (select F (+ 2 x)))) (<= i 1) (or (not (= (+ 2 x) 0)) (= (select (select B 0) 0) (select F (+ 2 x)))) (or (not (= x 1)) (= (select (select B 0) 2) (select F (+ x 1)))) (or (= (select (select B 0) 0) (select F (+ x 1))) (not (= (+ x 1) 0))) (or (and (= (select A 0) (select (select B 0) 0)) (not (= x 0))) (= (+ 2 x) 0) (and (= (select (select B 0) 0) (select F x)) (= x 0)) (= (+ x 1) 0)) (or (= (select (select B 0) 2) (select F (+ 2 x))) (not (= 2 (+ 2 x)))) (or (= (+ x 1) 1) (= (+ 2 x) 1) (and (= (select (select B 0) 1) (select A 1)) (not (= x 1))) (and (= x 1) (= (select (select B 0) 1) (select F x))))), 4711#(and (= 2 j) (or (= (+ x 1) 0) (= (select A 0) (select F 0)) (= x 0)) (= (select (select B i) 0) (select F (* M i))) (= (select (select B i) (+ (- 1) j)) (select F (+ (- 1) (* M i) j))) (or (= (select F 1) (select A 1)) (= x 1) (= x 0)) (= i 0) (or (= 2 x) (= (select F 2) (select A 2)) (= x 1))), 4714#(and (or (= 2 x) (= (select F 2) (select A 2))) (or (= (select F 1) (select A 1)) (= x 1)) (= j 0) (or (= (select A 0) (select F 0)) (= x 0)) (= i 0)), 4707#(and (= 2 j) (or (= 2 x) (= (select F 2) (select A 2))) (= (select (select B i) 0) (select F (* M i))) (or (= (select F 1) (select A 1)) (= x 1)) (or (= (select A 0) (select F 0)) (= x 0)) (= (select (select B i) (+ (- 1) j)) (select F (+ (- 1) (* M i) j))) (= i 0)), 4730#(and (or (= 2 x) (= (select F 2) (select A 2)) (= x 1) (= x 0)) (or (= (+ 2 x) 0) (= (+ x 1) 0) (= (select A 0) (select F 0)) (= x 0)) (or (= (select F 1) (select A 1)) (= x 1) (= (+ x 1) 0) (= x 0)) (= i 0)), 4725#(and (= 2 j) (= (select (select B i) 0) (select F (* M i))) (= (select (select B i) (+ (- 1) j)) (select F (+ (- 1) (* M i) j))) (= i 0)), 4729#(and (or (= (+ x 1) 0) (= (select A 0) (select F 0)) (= x 0)) (or (= (select F 1) (select A 1)) (= x 1) (= x 0)) (= i 0) (or (= 2 x) (= (select F 2) (select A 2)) (= x 1))), 4723#(and (= (select (select B 0) 1) (select F 1)) (= (select F 2) (select (select B 0) 2)) (<= M 3) (<= i 1) (= (select (select B 0) 0) (select F 0))), 4728#(and (or (= 2 x) (= (select F 2) (select A 2))) (or (= (select F 1) (select A 1)) (= x 1)) (or (= (select A 0) (select F 0)) (= x 0)) (= i 0)), 4704#(and (or (and (not (= 2 x)) (= (select (select B 0) 2) (select A 2))) (and (= 2 x) (= (select (select B 0) 2) (select F x)))) (<= M 3) (or (and (= (select A 0) (select (select B 0) 0)) (not (= x 0))) (and (= (select (select B 0) 0) (select F x)) (= x 0))) (<= N 1) (or (and (= (select (select B 0) 1) (select A 1)) (not (= x 1))) (and (= x 1) (= (select (select B 0) 1) (select F x))))), 4724#(and (= (select F 1) (select (select B i) 1)) (<= j 3) (= (select (select B i) 0) (select F 0)) (= i 0) (= (select F 2) (select (select B i) 2))), 4712#(and (or (= 2 x) (= (select F 2) (select A 2))) (= (select (select B i) 0) (select F (* M i))) (or (= (select F 1) (select A 1)) (= x 1)) (or (= (select A 0) (select F 0)) (= x 0)) (= i 0) (= j 1)), 4713#(and (or (= (+ x 1) 0) (= (select A 0) (select F 0)) (= x 0)) (= (select (select B i) 0) (select F (* M i))) (or (= (select F 1) (select A 1)) (= x 1) (= x 0)) (= i 0) (= j 1) (or (= 2 x) (= (select F 2) (select A 2)) (= x 1))), 4705#(and (or (and (not (= 2 x)) (= (select (select B 0) 2) (select A 2))) (and (= 2 x) (= (select (select B 0) 2) (select F x)))) (<= M 3) (<= i 1) (or (and (= (select A 0) (select (select B 0) 0)) (not (= x 0))) (and (= (select (select B 0) 0) (select F x)) (= x 0))) (or (and (= (select (select B 0) 1) (select A 1)) (not (= x 1))) (and (= x 1) (= (select (select B 0) 1) (select F x))))), 4722#(and (= (select (select B 0) 1) (select F 1)) (= (select F 2) (select (select B 0) 2)) (<= M 3) (= (select (select B 0) 0) (select F 0)) (<= N 1)), 4716#(and (or (= (+ x 1) 1) (and (not (= 2 x)) (= (select (select B 0) 2) (select A 2))) (and (= 2 x) (= (select (select B 0) 2) (select F x))) (= (+ x 1) 2)) (<= M 3) (or (= (select (select B 0) 1) (select F (+ x 1))) (not (= x 0))) (or (not (= (+ 2 x) 1)) (= (select (select B 0) 1) (select F (+ 2 x)))) (or (not (= (+ 2 x) 0)) (= (select (select B 0) 0) (select F (+ 2 x)))) (or (not (= x 1)) (= (select (select B 0) 2) (select F (+ x 1)))) (or (= (select (select B 0) 0) (select F (+ x 1))) (not (= (+ x 1) 0))) (or (and (= (select A 0) (select (select B 0) 0)) (not (= x 0))) (= (+ 2 x) 0) (and (= (select (select B 0) 0) (select F x)) (= x 0)) (= (+ x 1) 0)) (<= N 1) (or (= (select (select B 0) 2) (select F (+ 2 x))) (not (= 2 (+ 2 x)))) (or (= (+ x 1) 1) (= (+ 2 x) 1) (and (= (select (select B 0) 1) (select A 1)) (not (= x 1))) (and (= x 1) (= (select (select B 0) 1) (select F x))))), 4710#(and (or (and (= (select F x) (select (select B i) 0)) (= x 0)) (and (not (= x 0)) (= (select A 0) (select (select B i) 0))) (= (+ x 1) 0)) (or (= (select (select B i) 1) (select F (+ x 1))) (not (= (+ x 1) 1))) (or (not (= (+ x 1) 2)) (= (select (select B i) 2) (select F (+ x 1)))) (or (and (= (select A 2) (select (select B i) 2)) (not (= 2 x))) (and (= 2 x) (= (select F x) (select (select B i) 2))) (= (+ x 1) 2)) (or (= (select (select B i) 0) (select F (+ x 1))) (not (= (+ x 1) 0))) (<= j 3) (or (and (not (= x 1)) (= (select (select B i) 1) (select A 1))) (= (+ x 1) 1) (and (= (select (select B i) 1) (select F x)) (= x 1))) (= i 0)), 4718#(and (or (not (= (+ 2 x) 0)) (= (select (select B i) 0) (select F (+ 2 x)))) (or (and (not (= x 1)) (= (select (select B i) 1) (select A 1))) (= (+ x 1) 1) (= (+ 2 x) 1) (and (= (select (select B i) 1) (select F x)) (= x 1))) (or (= (select (select B i) 0) (select F (+ x 1))) (not (= (+ x 1) 0))) (or (and (= (select A 2) (select (select B i) 2)) (not (= 2 x))) (and (= 2 x) (= (select F x) (select (select B i) 2))) (= (+ x 1) 2) (= 2 (+ 2 x))) (or (not (= x 0)) (= (select (select B i) 1) (select F (+ x 1)))) (or (= (select (select B i) 2) (select F (+ 2 x))) (not (= 2 (+ 2 x)))) (or (not (= (+ 2 x) 1)) (= (select (select B i) 1) (select F (+ 2 x)))) (<= j 3) (or (and (= (select F x) (select (select B i) 0)) (= x 0)) (= (+ 2 x) 0) (and (not (= x 0)) (= (select A 0) (select (select B i) 0))) (= (+ x 1) 0)) (= i 0) (or (= (select (select B i) 2) (select F (+ x 1))) (not (= x 1)))), 4709#(and (or (and (= (select A 0) (select (select B 0) 0)) (not (= x 0))) (and (= (select (select B 0) 0) (select F x)) (= x 0)) (= (+ x 1) 0)) (<= M 3) (<= i 1) (or (= (+ x 1) 1) (and (= (select (select B 0) 1) (select A 1)) (not (= x 1))) (and (= x 1) (= (select (select B 0) 1) (select F x)))) (or (= (select (select B 0) 0) (select F (+ x 1))) (not (= (+ x 1) 0))) (or (and (not (= 2 x)) (= (select (select B 0) 2) (select A 2))) (and (= 2 x) (= (select (select B 0) 2) (select F x))) (= (+ x 1) 2)) (or (= (select (select B 0) 1) (select F (+ x 1))) (not (= (+ x 1) 1))) (or (not (= (+ x 1) 2)) (= (select (select B 0) 2) (select F (+ x 1))))), 4727#(and (= j 0) (= i 0)), 4719#(and (or (= 2 x) (= (select F 2) (select A 2)) (= x 1) (= x 0)) (= 2 j) (= (select (select B i) 0) (select F (* M i))) (or (= (+ 2 x) 0) (= (+ x 1) 0) (= (select A 0) (select F 0)) (= x 0)) (= (select (select B i) (+ (- 1) j)) (select F (+ (- 1) (* M i) j))) (or (= (select F 1) (select A 1)) (= x 1) (= (+ x 1) 0) (= x 0)) (= i 0)), 4715#(and (or (= (+ x 1) 0) (= (select A 0) (select F 0)) (= x 0)) (= j 0) (or (= (select F 1) (select A 1)) (= x 1) (= x 0)) (= i 0) (or (= 2 x) (= (select F 2) (select A 2)) (= x 1))), 4731#(= i 0), 4721#(and (or (= 2 x) (= (select F 2) (select A 2)) (= x 1) (= x 0)) (or (= (+ 2 x) 0) (= (+ x 1) 0) (= (select A 0) (select F 0)) (= x 0)) (= j 0) (or (= (select F 1) (select A 1)) (= x 1) (= (+ x 1) 0) (= x 0)) (= i 0)), 4726#(and (= (select (select B i) 0) (select F (* M i))) (= i 0) (= j 1)), 4720#(and (or (= 2 x) (= (select F 2) (select A 2)) (= x 1) (= x 0)) (= (select (select B i) 0) (select F (* M i))) (or (= (+ 2 x) 0) (= (+ x 1) 0) (= (select A 0) (select F 0)) (= x 0)) (or (= (select F 1) (select A 1)) (= x 1) (= (+ x 1) 0) (= x 0)) (= i 0) (= j 1))] [2022-03-15 20:44:29,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 20:44:29,495 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:29,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 20:44:29,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=2181, Unknown=3, NotChecked=0, Total=2450 [2022-03-15 20:44:29,497 INFO L87 Difference]: Start difference. First operand 111 states and 256 transitions. Second operand has 41 states, 40 states have (on average 2.275) internal successors, (91), 41 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:36,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:36,711 INFO L93 Difference]: Finished difference Result 190 states and 438 transitions. [2022-03-15 20:44:36,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 20:44:36,712 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.275) internal successors, (91), 41 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:44:36,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:36,713 INFO L225 Difference]: With dead ends: 190 [2022-03-15 20:44:36,713 INFO L226 Difference]: Without dead ends: 182 [2022-03-15 20:44:36,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1398 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=553, Invalid=4994, Unknown=3, NotChecked=0, Total=5550 [2022-03-15 20:44:36,715 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 158 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 3428 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 3562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 3428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:36,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 137 Invalid, 3562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 3428 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-03-15 20:44:36,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-03-15 20:44:36,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 118. [2022-03-15 20:44:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.376068376068376) internal successors, (278), 117 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:36,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 278 transitions. [2022-03-15 20:44:36,718 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 278 transitions. Word has length 17 [2022-03-15 20:44:36,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:36,718 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 278 transitions. [2022-03-15 20:44:36,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.275) internal successors, (91), 41 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:36,718 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 278 transitions. [2022-03-15 20:44:36,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:44:36,719 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:36,719 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:36,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 20:44:36,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 20:44:36,927 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:44:36,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:36,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2111972959, now seen corresponding path program 9 times [2022-03-15 20:44:36,929 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:36,929 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720045377] [2022-03-15 20:44:36,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:36,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:36,957 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:44:36,957 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1446647232] [2022-03-15 20:44:36,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:44:36,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:36,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:36,961 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:44:36,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 20:44:37,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 20:44:37,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:37,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:44:37,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:44:37,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:44:37,191 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:37,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720045377] [2022-03-15 20:44:37,191 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:44:37,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446647232] [2022-03-15 20:44:37,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446647232] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:37,192 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:44:37,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-03-15 20:44:37,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1465423022] [2022-03-15 20:44:37,192 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:37,193 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:37,197 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 116 transitions. [2022-03-15 20:44:37,197 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:38,273 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:44:38,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 20:44:38,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:38,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 20:44:38,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:44:38,274 INFO L87 Difference]: Start difference. First operand 118 states and 278 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:38,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:38,546 INFO L93 Difference]: Finished difference Result 162 states and 376 transitions. [2022-03-15 20:44:38,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:44:38,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 20:44:38,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:38,548 INFO L225 Difference]: With dead ends: 162 [2022-03-15 20:44:38,548 INFO L226 Difference]: Without dead ends: 162 [2022-03-15 20:44:38,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:44:38,549 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 18 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:38,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 17 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:44:38,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-03-15 20:44:38,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 154. [2022-03-15 20:44:38,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.4052287581699345) internal successors, (368), 153 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 368 transitions. [2022-03-15 20:44:38,552 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 368 transitions. Word has length 18 [2022-03-15 20:44:38,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:38,553 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 368 transitions. [2022-03-15 20:44:38,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:38,553 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 368 transitions. [2022-03-15 20:44:38,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:44:38,553 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:38,553 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:38,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-15 20:44:38,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 20:44:38,757 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:44:38,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:38,758 INFO L85 PathProgramCache]: Analyzing trace with hash 92176752, now seen corresponding path program 10 times [2022-03-15 20:44:38,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:38,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646170188] [2022-03-15 20:44:38,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:38,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:38,774 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:44:38,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [347839833] [2022-03-15 20:44:38,774 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:44:38,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:38,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:38,792 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:44:38,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 20:44:38,839 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:44:38,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:38,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 20:44:38,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:39,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:39,800 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:39,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646170188] [2022-03-15 20:44:39,800 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:44:39,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347839833] [2022-03-15 20:44:39,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347839833] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:39,800 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:44:39,800 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2022-03-15 20:44:39,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [883277919] [2022-03-15 20:44:39,801 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:39,802 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:39,807 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 124 transitions. [2022-03-15 20:44:39,807 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:46,584 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [5953#(and (or (<= L 3) (< x L)) (or (<= 0 j) (< x L)) (or (<= i 0) (< x L))), 5931#(and (or (<= L 3) (<= L (+ x 1)) (< (+ 2 x) L)) (or (< 3 M) (<= L (+ x 1)) (< (+ 2 x) L)) (or (<= L (+ x 1)) (< (+ 2 x) L) (<= N 1))), 5932#(and (or (<= i 1) (<= L (+ x 1)) (< (+ 2 x) L)) (or (<= L 3) (<= L (+ x 1)) (< (+ 2 x) L)) (or (< 3 M) (<= L (+ x 1)) (< (+ 2 x) L))), 5944#(and (or (<= 1 j) (<= L x) (< (+ x 1) L)) (or (<= L 3) (<= L x) (< (+ x 1) L)) (or (<= L x) (<= i 0) (< (+ x 1) L))), 5955#(and (or (<= L (+ x 1)) (<= i 0) (< (+ 2 x) L)) (or (<= L 3) (<= L (+ x 1)) (< (+ 2 x) L)) (or (<= L (+ x 1)) (<= 0 j) (< (+ 2 x) L))), 5943#(and (or (<= L 3) (< x L)) (or (<= 1 j) (< x L)) (or (<= i 0) (< x L))), 5940#(and (or (<= L (+ 2 x)) (<= L 3) (< (+ 3 x) L)) (or (<= L (+ 2 x)) (< 3 M) (< (+ 3 x) L)) (or (<= L (+ 2 x)) (< (+ 3 x) L) (<= i 0))), 5930#(and (or (<= L 3) (<= L x) (< (+ x 1) L)) (or (<= 3 j) (<= L x) (< (+ x 1) L)) (or (<= L x) (<= i 0) (< (+ x 1) L))), 5950#(and (or (<= i 0) (<= L 2) (< 3 L)) (or (<= 3 j) (<= L 2) (< 3 L))), 5939#(and (or (<= L (+ 2 x)) (<= L 3) (< (+ 3 x) L)) (or (<= L (+ 2 x)) (< 3 M) (< (+ 3 x) L)) (or (<= L (+ 2 x)) (<= i 1) (< (+ 3 x) L))), 5957#(and (or (<= i 0) (<= L 2) (< 3 L)) (or (<= 0 j) (<= L 2) (< 3 L))), 5937#(and (or (<= L (+ x 1)) (<= i 0) (< (+ 2 x) L)) (or (<= L 3) (<= L (+ x 1)) (< (+ 2 x) L)) (or (<= 2 j) (<= L (+ x 1)) (< (+ 2 x) L))), 5946#(and (or (<= L (+ 2 x)) (<= L 3) (< (+ 3 x) L)) (or (<= 1 j) (<= L (+ 2 x)) (< (+ 3 x) L)) (or (<= L (+ 2 x)) (< (+ 3 x) L) (<= i 0))), 5934#(and (or (<= L (+ x 1)) (<= i 0) (< (+ 2 x) L)) (or (<= L 3) (<= L (+ x 1)) (< (+ 2 x) L)) (or (<= 3 j) (<= L (+ x 1)) (< (+ 2 x) L))), 5948#(and (or (< 3 M) (<= L 2) (< 3 L)) (or (<= i 1) (<= L 2) (< 3 L))), 5938#(and (or (<= L (+ 2 x)) (< (+ 3 x) L) (<= N 1)) (or (<= L (+ 2 x)) (<= L 3) (< (+ 3 x) L)) (or (<= L (+ 2 x)) (< 3 M) (< (+ 3 x) L))), 5958#(and (or (<= L 3) (< x L)) (or (<= i 0) (< x L))), 5954#(and (or (<= L x) (<= 0 j) (< (+ x 1) L)) (or (<= L 3) (<= L x) (< (+ x 1) L)) (or (<= L x) (<= i 0) (< (+ x 1) L))), 5925#(and (or (<= L 3) (< x L)) (or (< 3 M) (< x L)) (or (<= i 0) (< x L))), 5942#(and (or (<= L (+ 2 x)) (<= L 3) (< (+ 3 x) L)) (or (<= L (+ 2 x)) (<= 2 j) (< (+ 3 x) L)) (or (<= L (+ 2 x)) (< (+ 3 x) L) (<= i 0))), 5961#(and (or (<= L (+ 2 x)) (<= L 3) (< (+ 3 x) L)) (or (<= L (+ 2 x)) (< (+ 3 x) L) (<= i 0))), 5936#(and (or (<= L 3) (<= L x) (< (+ x 1) L)) (or (<= L x) (<= 2 j) (< (+ x 1) L)) (or (<= L x) (<= i 0) (< (+ x 1) L))), 5959#(and (or (<= L 3) (<= L x) (< (+ x 1) L)) (or (<= L x) (<= i 0) (< (+ x 1) L))), 5923#(and (or (<= L 3) (< x L)) (or (< 3 M) (< x L)) (or (<= N 1) (< x L))), 5929#(and (or (<= L 3) (<= L x) (< (+ x 1) L)) (or (< 3 M) (<= L x) (< (+ x 1) L)) (or (<= L x) (<= i 0) (< (+ x 1) L))), 5928#(and (or (<= i 1) (<= L x) (< (+ x 1) L)) (or (<= L 3) (<= L x) (< (+ x 1) L)) (or (< 3 M) (<= L x) (< (+ x 1) L))), 5927#(and (or (<= L x) (< (+ x 1) L) (<= N 1)) (or (<= L 3) (<= L x) (< (+ x 1) L)) (or (< 3 M) (<= L x) (< (+ x 1) L))), 5926#(and (or (<= 3 j) (< x L)) (or (<= L 3) (< x L)) (or (<= i 0) (< x L))), 5952#(and (or (<= i 0) (<= L 2) (< 3 L)) (or (<= 1 j) (<= L 2) (< 3 L))), 5962#(or (<= i 0) (<= L 2) (< 3 L)), 5924#(and (or (<= L 3) (< x L)) (or (< 3 M) (< x L)) (or (<= i 1) (< x L))), 5949#(and (or (<= i 0) (<= L 2) (< 3 L)) (or (< 3 M) (<= L 2) (< 3 L))), 5935#(and (or (<= L 3) (< x L)) (or (<= 2 j) (< x L)) (or (<= i 0) (< x L))), 5956#(and (or (<= L (+ 2 x)) (<= L 3) (< (+ 3 x) L)) (or (<= L (+ 2 x)) (< (+ 3 x) L) (<= 0 j)) (or (<= L (+ 2 x)) (< (+ 3 x) L) (<= i 0))), 5933#(and (or (<= L (+ x 1)) (<= i 0) (< (+ 2 x) L)) (or (<= L 3) (<= L (+ x 1)) (< (+ 2 x) L)) (or (< 3 M) (<= L (+ x 1)) (< (+ 2 x) L))), 5945#(and (or (<= 1 j) (<= L (+ x 1)) (< (+ 2 x) L)) (or (<= L (+ x 1)) (<= i 0) (< (+ 2 x) L)) (or (<= L 3) (<= L (+ x 1)) (< (+ 2 x) L))), 5941#(and (or (<= L (+ 2 x)) (<= 3 j) (< (+ 3 x) L)) (or (<= L (+ 2 x)) (<= L 3) (< (+ 3 x) L)) (or (<= L (+ 2 x)) (< (+ 3 x) L) (<= i 0))), 5947#(and (or (< 3 M) (<= L 2) (< 3 L)) (or (<= N 1) (<= L 2) (< 3 L))), 5960#(and (or (<= L (+ x 1)) (<= i 0) (< (+ 2 x) L)) (or (<= L 3) (<= L (+ x 1)) (< (+ 2 x) L))), 5951#(and (or (<= i 0) (<= L 2) (< 3 L)) (or (<= 2 j) (<= L 2) (< 3 L)))] [2022-03-15 20:44:46,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-15 20:44:46,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:46,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-15 20:44:46,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=3557, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 20:44:46,586 INFO L87 Difference]: Start difference. First operand 154 states and 368 transitions. Second operand has 55 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 55 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:38,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:38,310 INFO L93 Difference]: Finished difference Result 507 states and 1130 transitions. [2022-03-15 20:45:38,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-03-15 20:45:38,312 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 55 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 20:45:38,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:38,313 INFO L225 Difference]: With dead ends: 507 [2022-03-15 20:45:38,313 INFO L226 Difference]: Without dead ends: 501 [2022-03-15 20:45:38,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10068 ImplicationChecksByTransitivity, 51.7s TimeCoverageRelationStatistics Valid=4638, Invalid=28668, Unknown=0, NotChecked=0, Total=33306 [2022-03-15 20:45:38,316 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 631 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 2336 mSolverCounterSat, 427 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 2336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:38,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 90 Invalid, 2763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 2336 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-03-15 20:45:38,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-03-15 20:45:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 164. [2022-03-15 20:45:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 2.460122699386503) internal successors, (401), 163 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:38,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 401 transitions. [2022-03-15 20:45:38,322 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 401 transitions. Word has length 18 [2022-03-15 20:45:38,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:38,322 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 401 transitions. [2022-03-15 20:45:38,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 55 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:38,322 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 401 transitions. [2022-03-15 20:45:38,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:45:38,323 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:38,323 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:38,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 20:45:38,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 20:45:38,535 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:45:38,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:38,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1045780705, now seen corresponding path program 11 times [2022-03-15 20:45:38,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:38,538 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898143847] [2022-03-15 20:45:38,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:38,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:38,543 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:45:38,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1613942216] [2022-03-15 20:45:38,544 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:45:38,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:38,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:38,545 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:45:38,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 20:45:38,589 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 20:45:38,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:45:38,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:45:38,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:38,788 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:45:38,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:40,228 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:45:40,229 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:40,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898143847] [2022-03-15 20:45:40,229 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:45:40,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613942216] [2022-03-15 20:45:40,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613942216] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:40,229 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:45:40,229 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-03-15 20:45:40,229 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [260889062] [2022-03-15 20:45:40,229 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:40,230 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:40,236 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 127 transitions. [2022-03-15 20:45:40,236 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:47,070 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [7180#(and (or (<= L x) (< (+ x 1) L) (<= L 2)) (or (<= 0 i) (<= L x) (< (+ x 1) L))), 7189#(and (or (<= 1 j) (< 2 L) (<= L 1)) (or (<= 0 i) (< 2 L) (<= L 1))), 7176#(and (or (<= L x) (< (+ x 1) L) (<= L 2)) (or (<= 0 i) (<= L x) (< (+ x 1) L)) (or (<= 1 j) (<= L x) (< (+ x 1) L))), 7190#(and (or (<= 0 i) (< 2 L) (<= L 1)) (or (< 2 L) (<= 0 j) (<= L 1))), 7191#(and (or (<= 0 i) (<= L (+ x 1)) (< (+ 2 x) L)) (or (<= L (+ x 1)) (< (+ 2 x) L) (<= L 2))), 7187#(and (or (< 2 L) (<= L 1) (<= 1 i)) (or (< 1 M) (< 2 L) (<= L 1))), 7175#(and (or (<= L 2) (< x L)) (or (<= 1 j) (< x L)) (or (<= 0 i) (< x L))), 7185#(and (or (<= 0 i) (<= L (+ x 1)) (< (+ 2 x) L)) (or (<= L (+ x 1)) (<= 0 j) (< (+ 2 x) L)) (or (<= L (+ x 1)) (< (+ 2 x) L) (<= L 2))), 7183#(and (or (<= 0 i) (<= L (+ x 1)) (< (+ 2 x) L)) (or (<= L (+ x 1)) (< (+ 2 x) L) (<= L 2)) (or (< 1 M) (<= L (+ x 1)) (< (+ 2 x) L))), 7172#(and (or (<= L x) (< (+ x 1) L) (<= L 2)) (or (<= L x) (< (+ x 1) L) (< 1 N)) (or (<= L x) (< 1 M) (< (+ x 1) L))), 7171#(and (or (<= L 2) (< x L)) (or (< 1 M) (< x L)) (or (<= 0 i) (< x L))), 7188#(and (or (< 1 M) (< 2 L) (<= L 1)) (or (<= 0 i) (< 2 L) (<= L 1))), 7177#(and (or (<= L 2) (< x L)) (or (<= 0 j) (< x L)) (or (<= 0 i) (< x L))), 7192#(or (<= 0 i) (< 2 L) (<= L 1)), 7179#(and (or (<= L 2) (< x L)) (or (<= 0 i) (< x L))), 7182#(and (or (<= L (+ x 1)) (< (+ 2 x) L) (<= 1 i)) (or (<= L (+ x 1)) (< (+ 2 x) L) (<= L 2)) (or (< 1 M) (<= L (+ x 1)) (< (+ 2 x) L))), 7178#(and (or (<= L x) (< (+ x 1) L) (<= L 2)) (or (<= 0 i) (<= L x) (< (+ x 1) L)) (or (<= L x) (<= 0 j) (< (+ x 1) L))), 7169#(and (or (< 1 N) (< x L)) (or (<= L 2) (< x L)) (or (< 1 M) (< x L))), 7174#(and (or (<= L x) (< (+ x 1) L) (<= L 2)) (or (<= 0 i) (<= L x) (< (+ x 1) L)) (or (<= L x) (< 1 M) (< (+ x 1) L))), 7181#(and (or (<= L (+ x 1)) (< 1 N) (< (+ 2 x) L)) (or (<= L (+ x 1)) (< (+ 2 x) L) (<= L 2)) (or (< 1 M) (<= L (+ x 1)) (< (+ 2 x) L))), 7173#(and (or (<= L x) (< (+ x 1) L) (<= L 2)) (or (<= L x) (< (+ x 1) L) (<= 1 i)) (or (<= L x) (< 1 M) (< (+ x 1) L))), 7186#(and (or (< 1 M) (< 2 L) (<= L 1)) (or (< 2 L) (< 1 N) (<= L 1))), 7184#(and (or (<= 1 j) (<= L (+ x 1)) (< (+ 2 x) L)) (or (<= 0 i) (<= L (+ x 1)) (< (+ 2 x) L)) (or (<= L (+ x 1)) (< (+ 2 x) L) (<= L 2))), 7170#(and (or (<= L 2) (< x L)) (or (< x L) (<= 1 i)) (or (< 1 M) (< x L)))] [2022-03-15 20:45:47,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 20:45:47,071 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:47,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 20:45:47,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1694, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 20:45:47,072 INFO L87 Difference]: Start difference. First operand 164 states and 401 transitions. Second operand has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 36 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:00,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:46:00,393 INFO L93 Difference]: Finished difference Result 360 states and 805 transitions. [2022-03-15 20:46:00,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-03-15 20:46:00,395 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 36 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 20:46:00,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:46:00,396 INFO L225 Difference]: With dead ends: 360 [2022-03-15 20:46:00,396 INFO L226 Difference]: Without dead ends: 341 [2022-03-15 20:46:00,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2947 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=1941, Invalid=10269, Unknown=0, NotChecked=0, Total=12210 [2022-03-15 20:46:00,397 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 340 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:46:00,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 61 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 20:46:00,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-03-15 20:46:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 213. [2022-03-15 20:46:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 2.400943396226415) internal successors, (509), 212 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:00,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 509 transitions. [2022-03-15 20:46:00,402 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 509 transitions. Word has length 19 [2022-03-15 20:46:00,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:46:00,402 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 509 transitions. [2022-03-15 20:46:00,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 36 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:00,402 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 509 transitions. [2022-03-15 20:46:00,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:46:00,403 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:46:00,403 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:46:00,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 20:46:00,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:00,624 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:46:00,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:46:00,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1667056900, now seen corresponding path program 12 times [2022-03-15 20:46:00,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:46:00,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015143141] [2022-03-15 20:46:00,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:46:00,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:46:00,637 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-15 20:46:00,637 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2019330244] [2022-03-15 20:46:00,637 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:46:00,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:00,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:46:00,640 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:46:00,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 20:46:00,686 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 20:46:00,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:46:00,687 WARN L261 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-15 20:46:00,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:46:00,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-03-15 20:46:00,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:46:00,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 20:46:00,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-03-15 20:46:00,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 38 [2022-03-15 20:46:00,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 20:46:00,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:46:00,962 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2022-03-15 20:46:01,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2022-03-15 20:46:01,154 INFO L353 Elim1Store]: treesize reduction 262, result has 4.7 percent of original size [2022-03-15 20:46:01,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 83 treesize of output 65 [2022-03-15 20:46:01,158 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-03-15 20:46:01,318 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:01,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:46:11,688 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36586 treesize of output 36330 [2022-03-15 20:46:11,783 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:46:11,784 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015143141] [2022-03-15 20:46:11,784 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 20:46:11,784 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019330244] [2022-03-15 20:46:11,784 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-15 20:46:11,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-03-15 20:46:11,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 20:46:11,997 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-15 20:46:12,001 INFO L158 Benchmark]: Toolchain (without parser) took 239536.40ms. Allocated memory was 188.7MB in the beginning and 471.9MB in the end (delta: 283.1MB). Free memory was 151.5MB in the beginning and 383.0MB in the end (delta: -231.6MB). Peak memory consumption was 272.2MB. Max. memory is 8.0GB. [2022-03-15 20:46:12,001 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 188.7MB. Free memory is still 152.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:46:12,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.33ms. Allocated memory is still 188.7MB. Free memory was 151.3MB in the beginning and 149.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 20:46:12,003 INFO L158 Benchmark]: Boogie Preprocessor took 14.61ms. Allocated memory is still 188.7MB. Free memory was 149.8MB in the beginning and 148.9MB in the end (delta: 966.3kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 20:46:12,004 INFO L158 Benchmark]: RCFGBuilder took 253.88ms. Allocated memory is still 188.7MB. Free memory was 148.8MB in the beginning and 138.6MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-15 20:46:12,005 INFO L158 Benchmark]: TraceAbstraction took 239244.73ms. Allocated memory was 188.7MB in the beginning and 471.9MB in the end (delta: 283.1MB). Free memory was 138.1MB in the beginning and 383.0MB in the end (delta: -244.9MB). Peak memory consumption was 258.5MB. Max. memory is 8.0GB. [2022-03-15 20:46:12,007 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.12ms. Allocated memory is still 188.7MB. Free memory is still 152.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.33ms. Allocated memory is still 188.7MB. Free memory was 151.3MB in the beginning and 149.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.61ms. Allocated memory is still 188.7MB. Free memory was 149.8MB in the beginning and 148.9MB in the end (delta: 966.3kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 253.88ms. Allocated memory is still 188.7MB. Free memory was 148.8MB in the beginning and 138.6MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 239244.73ms. Allocated memory was 188.7MB in the beginning and 471.9MB in the end (delta: 283.1MB). Free memory was 138.1MB in the beginning and 383.0MB in the end (delta: -244.9MB). Peak memory consumption was 258.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 22 PlacesBefore, 20 PlacesAfterwards, 18 TransitionsBefore, 16 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 30 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, positive: 30, positive conditional: 0, positive unconditional: 30, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 30, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-15 20:46:12,213 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-03-15 20:46:12,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...